A Polynomial Parsing Algorithm for the Topological Model: Synchronizing Constituent and Dependency Grammars, Illustrated by German Word Order Phenomena

Kim Gerdes, Sylvain Kahane


Anthology ID:
P06-1138
Volume:
Proceedings of the 21st International Conference on Computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics
Month:
July
Year:
2006
Address:
Sydney, Australia
Venues:
ACL | COLING
SIG:
Publisher:
Association for Computational Linguistics
Note:
Pages:
1097–1104
Language:
URL:
https://aclanthology.org/P06-1138
DOI:
10.3115/1220175.1220313
Bibkey:
Cite (ACL):
Kim Gerdes and Sylvain Kahane. 2006. A Polynomial Parsing Algorithm for the Topological Model: Synchronizing Constituent and Dependency Grammars, Illustrated by German Word Order Phenomena. In Proceedings of the 21st International Conference on Computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics, pages 1097–1104, Sydney, Australia. Association for Computational Linguistics.
Cite (Informal):
A Polynomial Parsing Algorithm for the Topological Model: Synchronizing Constituent and Dependency Grammars, Illustrated by German Word Order Phenomena (Gerdes & Kahane, ACL 2006)
Copy Citation:
PDF:
https://aclanthology.org/P06-1138.pdf