Complexity of Linear Order Computation in Performance Grammar, TAG and HPSG

Karin Harbusch, Gerard Kempen


Anthology ID:
W00-2014
Volume:
Proceedings of the Fifth International Workshop on Tree Adjoining Grammar and Related Frameworks (TAG+5)
Month:
May
Year:
2000
Address:
Université Paris 7
Venue:
TAG+
SIG:
Publisher:
Note:
Pages:
101–106
Language:
URL:
https://aclanthology.org/W00-2014
DOI:
Bibkey:
Cite (ACL):
Karin Harbusch and Gerard Kempen. 2000. Complexity of Linear Order Computation in Performance Grammar, TAG and HPSG. In Proceedings of the Fifth International Workshop on Tree Adjoining Grammar and Related Frameworks (TAG+5), pages 101–106, Université Paris 7.
Cite (Informal):
Complexity of Linear Order Computation in Performance Grammar, TAG and HPSG (Harbusch & Kempen, TAG+ 2000)
Copy Citation:
PDF:
https://preview.aclanthology.org/nschneid-patch-1/W00-2014.pdf