Transforming Projective Bilexical Dependency Grammars into efficiently-parsable CFGs with Unfold-Fold

ACL 2007 - Proceedings of the 45th Annual Meeting of the Association for Computational Linguistics

Volumn , Issue , 2007, Pages 168-175

  Johnson, Mark ^a,b  

^a MICROSOFT RESEARCH   (United States)

^b BROWN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DEPENDENCY GRAMMAR; PARSING ALGORITHM;

COMPUTATIONAL LINGUISTICS;

ALGORITHMS;

EID: 84860503337     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. R.M. Burstall and John Darlington. 1977. A transformation system for developing recursive programs. Journal of the Association for Computing Machinery, 24(1):44-67.
2. Zhiyi Chi. 1999. Statistical properties of probabilistic contextfree grammars. Computational Linguistics, 25(1):131-160.
3. Jason Eisner and Giorgio Satta. 1999. Efficient parsing for bilexical context-free grammars and head automaton grammars. In Proceedings of the 37th Annual Meeting of the Association for Computational Linguistics, pages 457-480, University of Maryland.
4. Jason Eisner. 1996. Three new probabilistic models for dependency parsing: An exploration. In COLING96: Proceedings of the 16th International Conference on Computational Linguistics, pages 340-345, Copenhagen. Center for Sprogteknologi.
5. Jason Eisner. 2000. Bilexical grammars and their cubic-time parsing algorithms. In Harry Bunt and Anton Nijholt, editors, Advances in Probabilistic and Other Parsing Technologies, pages 29-62. Kluwer Academic Publishers.
6. Joshua T. Goodman. 1996. Parsing algorithms and metrics. In Proceedings of the 34th Annual Meeting of the Association for Computational Linguistics, pages 177-183, Santa Cruz, Ca.
7. K. Lari and S.J. Young. 1990. The estimation of Stochastic Context-Free Grammars using the Inside-Outside algorithm. Computer Speech and Language, 4(35-56).
8. Takuya Matsuzaki, Yusuke Miyao, and Jun'ichi Tsujii. 2005. Probabilistic CFG with latent annotations. In Proceedings of the 43rd Annual Meeting of the Association for Computational Linguistics (ACL'05), pages 75-82, Ann Arbor, Michigan, June. Association for Computational Linguistics.
9. David McAllester. 1999. A reformulation of Eisner and Sata's cubic time parser for split head automata grammars. Available from http://ttic.uchicago. edu/~dmcallester/.
10. Ryan McDonald and Fernando Pereira. 2006. Online learning of approximate dependency parsing algorithms. In 11th Conference of the European Chapter of the Association for Computational Linguistics, pages 81-88, Trento, Italy.
11. Ryan McDonald. 2006. Discriminative Training and Spanning Tree Algorithms for Dependency Parsing. Ph.D. thesis, University of Pennyslvania, Philadelphia, PA.
12. Fernando Pereira and StuartM. Shieber. 1987. Prolog and Natural Language Analysis. Center for the Study of Language and Information, Stanford, CA.
13. Slav Petrov, Leon Barrett, Romain Thibaux, and Dan Klein. 2006. Learning accurate, compact, and interpretable tree annotation. In Proceedings of the 21st International Conference on Computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics, pages 433-440, Sydney, Australia, July. Association for Computational Linguistics.
14. A. Pettorossi and M. Proeitti. 1992. Transformation of logic programs. In Handbook of Logic in Artificial Intelligence, volume 5, pages 697-787. Oxford University Press.
15. Taisuke Sato. 1992. Equivalence-preserving first-order unfold/ fold transformation systems. Theoretical Computer Science, 105(1):57-84.
16. 3. Information and Control, 10(2):189-208.