Dependency parsing schemata and mildly non-projective dependency parsing

Computational Linguistics

Volumn 37, Issue 3, 2011, Pages 541-586

  Gómez Rodríuez, Carlos ^a   Carroll, John ^b   Weir, David ^b  

^a UNIVERSITY OF A CORUÑA   (Spain)

^b UNIVERSITY OF SUSSEX   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; NATURAL LANGUAGE PROCESSING SYSTEMS; POLYNOMIAL APPROXIMATION;

CORRECTNESS PROOFS; DEPENDENCY PARSER; DEPENDENCY PARSING; FORMAL FRAMEWORK; NATURAL LANGUAGES; NESTED STRUCTURES; NON-PROJECTIVE DEPENDENCY PARSING; PARSING ALGORITHM;

FORMAL LANGUAGES;

EID: 80052200655     PISSN: 08912017     EISSN: 15309312     Source Type: Journal    
DOI: 10.1162/COLI_a_00060     Document Type: Article

References (75)

1. Afonso, Susana, Eckhard Bick, Renato Haber, and Diana Santos. 2002. "Floresta sintá(c)tica": A treebank for Portuguese. In Proceedings of the 3rd International Conference on Language Resources and Evaluation (LREC 2002), pages 1968-1703, Las Palmas.
2. Alonso, Miguel A., David Cabrero, Éric Villemonte de la Clergerie, and Manuel Vilares. 1999. Tabular algorithms for TAG parsing. In Proceedings of the Ninth Conference of the European Chapter of the Association for Computational Linguistics (EACL-99), pages 150-157, Bergen.
3. Atalay, Nart B., Kemal Oflazer, and Bilge Say. 2003. The annotation process in the Turkish treebank. In Proceedings of EACL Workshop on Linguistically Interpreted Corpora (LINC-03), pages 243-246, Budapest.
4. Attardi, Giuseppe. 2006. Experiments with a multilanguage non-projective dependency parser. In Proceedings of the 10th Conference on Computational Natural Language Learning (CoNLL-X), pages 166-170, New York, NY.
5. Bamman, David and Gregory Crane. 2006. The design and use of a Latin dependency treebank. In Proceedings of the Fifth Workshop on Treebanks and Linguistic Theories (TLT 2006), pages 67-78, Prague.
6. Barbero, Cristina, Leonardo Lesmo, Vincenzo Lombardo, and Paola Merlo. 1998. Integration of syntactic and lexical information in a hierarchical dependency grammar. In Proceedings of COLING-ACL'98 Workshop on Processing of Dependency-Based Grammars, pages 58-67, Montreal.
7. van der Beek, Leonoor, Gosse Bouma, Robert Malouf, and Gertjan van Noord. 2002. The Alpino dependency treebank. In Language and Computers, Computational Linguistics in the Netherlands 2001. Selected Papers from the Twelfth CLIN Meeting, pages 8-22, Amsterdam.
8. Billot, Sylvie and Bernard Lang. 1989. The structure of shared forests in ambiguous parsing. In Proceedings of the 27th Annual Meeting of the Association for Computational Linguistics (ACL'89), pages 143-151, Montreal.
9. Bodirsky, Manuel, Marco Kuhlmann, and Mathias Möhl. 2005. Well-nested drawings as models of syntactic structure (extended version). Technical report, Saarland University.
10. Che, Wanxiang, Zhenghua Li, Yuxuan Hu, Yongqiang Li, Bing Qin, Ting Liu, and Sheng Li. 2008. A cascaded syntactic and semantic dependency parsing system. In Proceedings of the 12th Conference on Computational Natural Language Learning (CoNLL 2008), pages 238-242, Manchester.
11. Collins, Michael John. 1996. A new statistical parser based on bigram lexical dependencies. In Proceedings of the 34th Annual Meeting of the Association for Computational Linguistics (ACL'96), pages 184-191, Santa Cruz, CA.
12. Corston-Oliver, Simon, Anthony Aue, Kevin Duh, and Eric Ringger. 2006. Multilingual dependency parsing using Bayes Point Machines. In Proceedings of the Human Language Technology Conference of the North American Chapter of the Association for Computational Linguistics (NAACL HLT 2006), pages 160-167, New York, NY.
13. Courtin, Jacques and Damien Genthial. 1998. Parsing with dependency relations and robust parsing. In Proceedings of COLING-ACL'98 Workshop on Processing of Dependency-Based Grammars, pages 88-94, Montreal.
14. Covington, Michael A. 1990. A dependency parser for variable-word-order languages. Technical Report AI-1990-01, University of Georgia, Athens, GA.
15. Covington, Michael A. 2001. A fundamental algorithm for dependency parsing. In Proceedings of the 39th Annual ACM Southeast Conference, pages 95-102, Athens, GA.
16. Cui, Hang, Renxu Sun, Keya Li, Min-Yen Kan, and Tat-Seng Chua. 2005. Question answering passage retrieval using dependency relations. In SIGIR'05: Proceedings of the 28th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pages 400-407, Salvador.
17. Culotta, Aron and Jeffrey Sorensen. 2004. Dependency tree kernels for relation extraction. In ACL'04: Proceedings of the 42nd Annual Meeting of the Association for Computational Linguistics, pages 423-429, Barcelona.
18. Ding, Yuan and Martha Palmer. 2005. Machine translation using probabilistic synchronous dependency insertion grammars. In ACL'05: Proceedings of the 43rd Annual Meeting of the Association for Computational Linguistics, pages 541-548, Ann Arbor, MI.
19. Džeroski, Sašo, Tomaž Erjavec, Nina Ledinek, Petr Pajas, Zdeněk Žabokrtský, and Andreja Žele. 2006. Towards a Slovene dependency treebank. In Proceedings of the 5th International Conference on Language Resources and Evaluation (LREC 2006), pages 1388-1391, Genoa.
20. Earley, Jay. 1970. An efficient context-free parsing algorithm. Communications of the ACM, 13(2):94-102.
21. Eisner, Jason. 1996. Three new probabilistic models for dependency parsing: An exploration. In Proceedings of the 16th International Conference on Computational Linguistics (COLING-96), pages 340-345, Copenhagen.
22. Eisner, Jason, Eric Goldlust, and Noah A. Smith. 2005. Compiling comp ling: Weighted dynamic programming and the Dyna language. In Proceedings of Human Language Technology Conference and Conference on Empirical Methods in Natural Language Processing (HLT-EMNLP 2005), pages 281-290, Vancouver.
23. Eisner, Jason 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 (ACL'99), pages 457-464, College Park, MD.
24. Eisner, Jason and Giorgio Satta. 2000. A faster parsing algorithm for lexicalized tree-adjoining grammars. In Proceedings of the 5th Workshop on Tree-Adjoining Grammars and Related Formalisms (TAG+5), pages 14-19, Paris.
25. Fundel, Katrin, Robert Küffner, and Ralf Zimmer. 2006. RelEx-Relation extraction using dependency parse trees. Bioinformatics, 23(3):365-371.
26. Gaifman, Haim. 1965. Dependency systems and phrase-structure systems. Information and Control, 8:304-337.
27. Gómez-Rodríuez, Carlos. 2009. Parsing Schemata for Practical Text Analysis. Ph.D. thesis, Universidade da Corũna, Spain.
28. Gómez-Rodríuez, Carlos, John Carroll, and David Weir. 2008. A deductive approach to dependency parsing. In Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies (ACL'08:HLT), pages 968-976, Columbus, OH.
29. Gómez-Rodríuez, Carlos, Marco Kuhlmann, Giorgio Satta, and David Weir. 2009. Optimal reduction of rule length in linear context-free rewriting systems. In Proceedings of NAACL HLT 2009: the Conference of the North American Chapter of the Association for Computational Linguistics, pages 539-547, Boulder, CO.
30. Gómez-Rodríuez, Carlos, Jesüs Vilares, and Miguel A. Alonso. 2009. A compiler for parsing schemata. Software: Practice and Experience, 39(5):441-470.
31. Gómez-Rodríuez, Carlos, David Weir, and John Carroll. 2008. Parsing mildly non-projective dependency structures (extended version). Technical Report CSRP 600, Department of Informatics, University of Sussex.
32. Gómez-Rodríuez, Carlos, David Weir, and John Carroll. 2009. Parsing mildly non-projective dependency structures. In Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics (EACL-09), pages 291-299, Athens.
33. Hajič, Jan, Jarmila Panevová, Eva Hajičová, Jarmila Panevová, Petr Sgall, Petr Pajas, Jan štěpánek, Jiři Havelka, and Marie Mikulová. 2006. Prague Dependency Treebank 2.0. CDROM CAT: LDC2006T01, ISBN 1-58563-370-4. Linguistic Data Consortium, University of Pennsylvania.
34. Hajič, Jan, Otakar Smrž, Petr Zemánek, Jan šnaidauf, and Emanuel Beška. 2004. Prague Arabic dependency treebank: Development in data and tools. In Proceedings of the NEMLAR International Conference on Arabic Language Resources and Tools, pages 110-117, Cairo.
35. Havelka, Jiři. 2007. Beyond projectivity: Multilingual evaluation of constraints and measures on non-projective structures. In ACL 2007: Proceedings of the 45th Annual Meeting of the Association for Computational Linguistics, pages 608-615, Prague.
36. Hays, David. 1964. Dependency theory: a formalism and some observations. Language, 40:511-525.
37. Herrera, Jesús, Anselmo Peñas, and Felisa Verdejo. 2005. Textual entailment recognition based on dependency analysis andWordNet. In J. Quiñonero-Camdela, I. Dagan, B. Magnini, and F. d'Alchá-Buc, editors, Machine Learning Challenges. Lecture Notes in Computer Science, vol. 3944. Springer-Verlag, Berlin-Heidelberg-New York, pages 231-239.
38. Hotz, Günter and Gisela Pitsch. 1996. On parsing coupled-context-free languages. Theoretical Computer Science, 161(1-2):205-233.
39. Joshi, Aravind K. and Yves Schabes. 1997. Tree-adjoining grammars. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, vol. 3: Beyond Words, Springer-Verlag, New York, NY, pages 69-123.
40. Kahane, Sylvain, Alexis Nasr, and Owen Rambow. 1998. Pseudo-projectivity: A polynomially parsable non-projective dependency grammar. In Proceedings of the 36th Annual Meeting of the Association for Computational Linguistics and the 17th International Conference on Computational Linguistics (COLING-ACL'98), pages 646-652, San Francisco, CA.
41. Kasami, Tadao. 1965. An efficient recognition and syntax algorithm for context-free languages. Scientific Report AFCRL-65-758, Air Force Cambridge Research Lab, Bedford, MA.
42. Kromann, Matthias T. 2003. The Danish dependency treebank and the underlying linguistic theory. In Proceedings of the 2nd Workshop on Treebanks and Linguistic Theories (TLT), pages 217-220, Växjö.
43. Kuhlmann, Marco. 2007. Dependency Structures and Lexicalized Grammars. D. Phil dissertation, Saarland University, Saarbr ücken, Germany.
44. Kuhlmann, Marco. 2010. Dependency Structures and Lexicalized Grammars: An Algebraic Approach. Lecture Notes in Computer Science, vol. 6270. Springer, New York, NY.
45. Kuhlmann, Marco and Mathias Möhl. 2007. Mildly context-sensitive dependency languages. In Proceedings of the 45th Annual Meeting of the Association for Computational Linguistics (ACL 2007), pages 160-167, Prague.
46. Kuhlmann, Marco and Joakim Nivre. 2006. Mildly non-projective dependency structures. In Proceedings of the COLING/ACL 2006 Main Conference Poster Sessions, pages 507-514, Montreal.
47. Lombardo, Vincenzo and Leonardo Lesmo. 1996. An Earley-type recognizer for dependency grammar. In Proceedings of the 16th International Conference on Computational Linguistics (COLING 96), pages 723-728, San Francisco, CA.
48. Maier,Wolfgang and Timm Lichte. 2011. Characterizing discontinuity in constituent treebanks. In P. de Grook, M. Egg, and L. Kallmeyer, editors, Formal Grammar, volume 5591 of Lecture Notes in Computer Science. Springer-Verlag, Berlin-Heidelberg-New York, pages 164-179.
49. McDonald, Ryan, Koby Crammer, and Fernando Pereira. 2005. Online large-margin training of dependency parsers. In ACL'05: Proceedings of the 43rd Annual Meeting of the Association for Computational Linguistics, pages 91-98, Ann Arbor, MI.
50. McDonald, Ryan and Joakim Nivre. 2007. Characterizing the errors of data-driven dependency parsing models. In Proceedings of the 2007 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning (EMNLP-CoNLL 2007), pages 122-131, Prague.
51. McDonald, Ryan, Fernando Pereira, Kiril Ribarov, and Jan Hajič. 2005. Nonprojective dependency parsing using spanning tree algorithms. In HLT/EMNLP 2005: Proceedings of the Conference on Human Language Technology and Empirical Methods in Natural Language Processing, pages 523-530, Vancouver.
52. McDonald, Ryan and Giorgio Satta. 2007. On the complexity of non-projective data-driven dependency parsing. In IWPT 2007: Proceedings of the 10th International Conference on Parsing Technologies, pages 121-132, Prague.
53. Nilsson, Jens, Johan Hall, and Joakim Nivre. 2005. MAMBA meets TIGER: Reconstructing a Swedish treebank from antiquity. In Proceedings of NODALIDA 2005 Special Session on Treebanks, pages 119-132, Joensuu.
54. Nivre, Joakim. 2003. An efficient algorithm for projective dependency parsing. In Proceedings of the 8th International Workshop on Parsing Technologies (IWPT 03), pages 149-160, Nancy.
55. Nivre, Joakim. 2007. Incremental non-projective dependency parsing. In Proceedings of NAACL HLT 2007: The Annual Conference of the North American Chapter of the Association for Computational Linguistics, pages 396-403, Rochester, NY.
56. Nivre, Joakim, Johan Hall, Sandra Kübler, Ryan McDonald, Jens Nilsson, Sebastian Riedel, and Deniz Yuret. 2007. The CoNLL 2007 shared task on dependency parsing. In Proceedings of the CoNLL Shared Task Session of EMNLP-CoNLL 2007, pages 915-932, Prague.
57. Nivre, Joakim, Johan Hall, and Jens Nilsson. 2004. Memory-based dependency parsing. In Proceedings of the 8th Conference on Computational Natural Language Learning (CoNLL-2004), pages 49-56, Boston, MA.
58. Nivre, Joakim, Johan Hall, Jens Nilsson, Atanas Chanev, Gülsán Eryiǧit, Sandra Kübler, Stetoslav Marinov, and Erwin Marsi. 2007. MaltParser: A languageindependent system for data-driven dependency parsing. Natural Language Engineering, 13(2):99-135.
59. Nivre, Joakim, Johan Hall, Jens Nilsson, Gülsán Eryiǧit, and Stetoslav Marinov. 2006. Labeled pseudo-projective dependency parsing with support vector machines. In Proceedings of the 10th Conference on Computational Natural Language Learning (CoNLL-X), pages 221-225, Sydney.
60. Nivre, Joakim and Ryan McDonald. 2008. Integrating graph-based and transition-based dependency parsers. In Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies (ACL-08: HLT), pages 950-958, Columbus, OH.
61. Nivre, Joakim and Jens Nilsson. 2005. Pseudo-projective dependency parsing. In ACL'05: Proceedings of the 43rd Annual Meeting of the Association for Computational Linguistics, pages 99-106, Ann Arbor, MI.
62. Oflazer, Kemal, Bilge Say, Dilek Zeynep Hakkani-Tür, and Gákhan Tür. 2003. Building a Turkish treebank. In A. Abeille, editor, Building and Exploiting Syntacticallyannotated Corpora. Kluwer, Dordrecht, pages 261-277.
63. Satta, Giorgio. 1992. Recognition of linear context-free rewriting systems. In Proceedings of the 30th Annual Meeting of the Association for Computational Linguistics (ACL'92), pages 89-95, Newark, DE.
64. Schneider, Gerold. 1998. A linguistic comparison of constituency, dependency, and link grammar. M.Sc. thesis, University of Zurich, Switzerland.
65. Shen, Libin, Jinxi Xu, and Ralph Weischedel. 2008. A new string-to-dependency machine translation algorithm with a target dependency language model. In Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies (ACL-08: HLT), pages 577-585, Columbus, OH.
66. Shieber, Stuart M., Yves Schabes, and Fernando C. N. Pereira. 1995. Principles and implementation of deductive parsing. Journal of Logic Programming, 24:3-36.
67. Sikkel, Klaas. 1994. How to compare the structure of parsing algorithms. In Proceedings of ASMICS Workshop on Parsing Theory, pages 21-39, Milano.
68. Sikkel, Klaas. 1997. Parsing Schemata -A Framework for Specification and Analysis of Parsing Algorithms. Texts in Theoretical Computer Science - An EATCS Series. Springer-Verlag, Berlin-Heidelberg-New York.
69. Sleator, Daniel and Davy Temperley. 1991. Parsing English with a Link Grammar. Technical report CMU-CS-91-196, Carnegie Mellon University, Pittsburgh, PA.
70. Sleator, Daniel and Davy Temperley. 1993. Parsing English with a Link Grammar. In Proceedings of the Third International Workshop on Parsing Technologies (IWPT'93), pages 277-292, Tilburg.
71. Surdeanu, Mihai, Richard Johansson, Adam Meyers, Lluiá Màrquez, and Joakim Nivre. 2008. The CoNLL-2008 shared task on joint parsing of syntactic and semantic dependencies. In Proceedings of the 12th Conference on Computational Natural Language Learning (CoNLL-2008), pages 159-177, Manchester.
72. Vijay-Shanker, K., David J.Weir, and Aravind K. Joshi. 1987. Characterizing structural descriptions produced by various grammatical formalisms. In Proceedings of the 25th Annual Meeting of the Association for Computational Linguistics (ACL'87), pages 104-111, Stanford, CA.
73. de Vreught, J. P. M. and H. J. Honig. 1989. A tabular bottom-up recognizer. Report 89-78, Delft University of Technology, Delft, the Netherlands.
74. Yamada, Hiroyasu and Yuji Matsumoto. 2003. Statistical dependency analysis with support vector machines. In Proceedings of 8th International Workshop on Parsing Technologies (IWPT 2003), pages 195-206, Nancy.
75. 3. Information and Control, 10(2):189-208.