Factoring Recursion and Dependencies: An Aspect of Tree Adjoining Grammars (TAG) and a Comparison of Some Formal Properties of TAGs, GPSGs, PLGs, and LPGs

Aravind K. Joshi


Anthology ID:
P83-1002
Volume:
21st Annual Meeting of the Association for Computational Linguistics
Month:
June
Year:
1983
Address:
Cambridge, Massachusetts, USA
Venue:
ACL
SIG:
Publisher:
Association for Computational Linguistics
Note:
Pages:
7–15
Language:
URL:
https://aclanthology.org/P83-1002
DOI:
10.3115/981311.981314
Bibkey:
Cite (ACL):
Aravind K. Joshi. 1983. Factoring Recursion and Dependencies: An Aspect of Tree Adjoining Grammars (TAG) and a Comparison of Some Formal Properties of TAGs, GPSGs, PLGs, and LPGs. In 21st Annual Meeting of the Association for Computational Linguistics, pages 7–15, Cambridge, Massachusetts, USA. Association for Computational Linguistics.
Cite (Informal):
Factoring Recursion and Dependencies: An Aspect of Tree Adjoining Grammars (TAG) and a Comparison of Some Formal Properties of TAGs, GPSGs, PLGs, and LPGs (Joshi, ACL 1983)
Copy Citation:
PDF:
https://aclanthology.org/P83-1002.pdf