A faster parsing algorithm for Lexicalized Tree-Adjoining Grammars

Anthology ID:: W00-2011
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:: 79–84
Language:
URL:: https://aclanthology.org/W00-2011
DOI:
Bibkey:
Cite (ACL):: Jason Eisner and Giorgio Satta. 2000. A faster parsing algorithm for Lexicalized Tree-Adjoining Grammars. In Proceedings of the Fifth International Workshop on Tree Adjoining Grammar and Related Frameworks (TAG+5), pages 79–84, Université Paris 7.
Cite (Informal):: A faster parsing algorithm for Lexicalized Tree-Adjoining Grammars (Eisner & Satta, TAG+ 2000)
Copy Citation:
PDF:: https://preview.aclanthology.org/improve-issue-templates/W00-2011.pdf