Some Computational Complexity Results for Synchronous Context-Free Grammars

Giorgio Satta, Enoch Peserico


Anthology ID:
H05-1101
Volume:
Proceedings of Human Language Technology Conference and Conference on Empirical Methods in Natural Language Processing
Month:
October
Year:
2005
Address:
Vancouver, British Columbia, Canada
Editors:
Raymond Mooney, Chris Brew, Lee-Feng Chien, Katrin Kirchhoff
Venues:
HLT | EMNLP
SIG:
SIGDAT
Publisher:
Association for Computational Linguistics
Note:
Pages:
803–810
Language:
URL:
https://aclanthology.org/H05-1101
DOI:
Bibkey:
Cite (ACL):
Giorgio Satta and Enoch Peserico. 2005. Some Computational Complexity Results for Synchronous Context-Free Grammars. In Proceedings of Human Language Technology Conference and Conference on Empirical Methods in Natural Language Processing, pages 803–810, Vancouver, British Columbia, Canada. Association for Computational Linguistics.
Cite (Informal):
Some Computational Complexity Results for Synchronous Context-Free Grammars (Satta & Peserico, HLT-EMNLP 2005)
Copy Citation:
PDF:
https://aclanthology.org/H05-1101.pdf