- Anthology ID:
- P90-1036
- Volume:
- 28th Annual Meeting of the Association for Computational Linguistics
- Month:
- June
- Year:
- 1990
- Address:
- Pittsburgh, Pennsylvania, USA
- Venue:
- ACL
- SIG:
- Publisher:
- Association for Computational Linguistics
- Note:
- Pages:
- 284–291
- Language:
- URL:
- https://aclanthology.org/P90-1036
- DOI:
- 10.3115/981823.981859
- Cite (ACL):
- Karin Harbusch. 1990. An Efficient Parsing Algorithm for Tree Adjoining Grammars. In 28th Annual Meeting of the Association for Computational Linguistics, pages 284–291, Pittsburgh, Pennsylvania, USA. Association for Computational Linguistics.
- Cite (Informal):
- An Efficient Parsing Algorithm for Tree Adjoining Grammars (Harbusch, ACL 1990)
- PDF:
- https://preview.aclanthology.org/ml4al-ingestion/P90-1036.pdf