On the complexity of non-projective data-driven dependency parsing

IWPT 2007 - Proceedings of the 10th International Conference on Parsing Technologies

Volumn , Issue , 2007, Pages 121-132

  McDonald, Ryan ^a   Satta, Giorgio ^b  

^a GOOGLE INC   (United States)

^b UNIVERSITY OF PADOVA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; NATURAL LANGUAGE PROCESSING SYSTEMS;

DATA DRIVEN; DEPENDENCY PARSING; FACTORED MODELS; HARDNESS RESULT; LOCAL INFORMATION; NON-PROJECTIVE DEPENDENCY PARSING; NONLOCAL; PARSING ALGORITHM; POLYNOMIAL-TIME;

POLYNOMIAL APPROXIMATION;

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

References (42)

1. G. E. Barton, R. C. Berwick, and E. S. Ristad. 1987. Computational Complexity and Natural Language. MIT Press, Cambridge, MA.
2. C. Brew. 1992. Letting the cat out of the bag: Generation for Shake-and-Bake MT. In Proc. COLING.
3. S. Buchholz, E. Marsi, A. Dubey, and Y. Krymolowski. 2006. CoNLL-X shared task on multilingual dependency parsing. In Proc. CoNLL.
4. P. M. Camerini, L. Fratta, and F. Maffioli. 1980. The k best spanning arborescences of a network. Networks, 10(2):91–110.
5. C. Chelba, D. Engle, F. Jelinek, V. Jimenez, S. Khudanpur, L. Mangu, H. Printz, E.S. Ristad, R. Rosenfeld, A. Stolcke, and D. Wu. 1997. Structure and performance of a dependency language model. In Eurospeech.
6. Y.J. Chu and T.H. Liu. 1965. On the shortest arborescence of a directed graph. Science Sinica, 14:1396–1400.
7. M. Collins. 2002. Discriminative training methods for hidden Markov models: Theory and experiments with perceptron algorithms. In Proc. EMNLP.
8. T.H. Cormen, C.E. Leiserson, and R.L. Rivest. 1990. Introduction to Algorithms. MIT Press/McGraw-Hill.
9. K. Crammer and Y. Singer. 2003. Ultraconservative online algorithms for multiclass problems. JMLR.
10. J. Edmonds. 1967. Optimum branchings. Journal of Research of the National Bureau of Standards, 71B:233–240.
11. J. Eisner. 1996. Three new probabilistic models for dependency parsing: An exploration. In Proc. COLING.
12. K. Hall and V. Nóvák. 2005. Corrective modeling for non-projective dependency parsing. In Proc. IWPT.
13. H. Hirakawa. 2006. Graph branch algorithm: An optimum tree search method for scored dependency graph with arc co-occurrence constraints. In Proc. ACL.
14. R. Hudson. 1984. Word Grammar. Blackwell.
15. S. Kahane, A. Nasr, and O Rambow. 1998. Pseudoprojectivity: A polynomially parsable non-projective dependency grammar. In Proc. ACL.
16. D. Klein and C.D. Manning. 2002. Fast exact natural language parsing with a factored model. In Proc. NIPS.
17. D. Klein and C. Manning. 2003. Accurate unlexicalized parsing. In Proc. ACL.
18. D. Klein and C. Manning. 2004. Corpus-based induction of syntactic structure: Models of dependency and constituency. In Proc. ACL.
19. T. Koo, A. Globerson, X. Carreras, and M. Collins. 2007. Structured prediction models via the matrix-tree theorem. In Proc. EMNLP.
20. J. Lafferty, A. McCallum, and F. Pereira. 2001. Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In Proc. ICML.
21. M. Marcus, B. Santorini, and M. Marcinkiewicz. 1993. Building a large annotated corpus of English: The Penn Treebank. Computational Linguistics, 19(2):313–330.
22. R. McDonald and F. Pereira. 2006. Online learning of approximate dependency parsing algorithms. In Proc EACL.
23. R. McDonald, K. Crammer, and F. Pereira. 2005a. Online large-margin training of dependency parsers. In Proc. ACL.
24. R. McDonald, F. Pereira, K. Ribarov, and J. Hajič. 2005b. Non-projective dependency parsing using spanning tree algorithms. In Proc. HLT/EMNLP.
25. M. Meila and T. Jaakkola. 2000. Tractable Bayesian learning of tree belief networks. In Proc. UAI.
26. I.A. Meĺčuk. 1988. Dependency Syntax: Theory and Practice. State University of New York Press.
27. S. Miller, H. Fox, L.A. Ramshaw, and R.M. Weischedel. 2000. A novel use of statistical parsing to extract information from text. In Proc NAACL, pages 226–233.
28. P. Neuhaus and N. Böker. 1997. The complexity of recognition of linguistically adequate dependency grammars. In Proc. ACL.
29. J. Nivre and J. Nilsson. 2005. Pseudo-projective dependency parsing. In Proc. ACL.
30. J. Nivre and M. Scholz. 2004. Deterministic dependency parsing of english text. In Proc. COLING.
31. J. Nivre. 2005. Dependency grammar and dependency parsing. Technical Report MSI report 05133, Växjö University: School of Mathematics and Systems Engineering.
32. M.A. Paskin. 2001. Cubic-time parsing and learning algorithms for grammatical bigram models. Technical Report UCB/CSD-01-1148, Computer Science Division, University of California Berkeley.
33. S. Riedel and J. Clarke. 2006. Incremental integer linear programming for non-projective dependency parsing. In Proc. EMNLP.
34. S. Robinson. 2005. Toward an optimal algorithm for matrix multiplication. News Journal of the Society for Industrial and Applied Mathematics, 38(9).
35. P. Sgall, E. Hajičová, and J. Panevová. 1986. The Meaning of the Sentence in Its Pragmatic Aspects. Reidel.
36. D.A. Smith and N.A. Smith. 2007. Probabilistic models of nonprojective dependency trees. In Proc. EMNLP.
37. L. Tesnière. 1959. Éléments de syntaxe structurale. Editions Klincksieck.
38. I. Titov and J. Henderson. 2006. Bayes risk minimization in natural language parsing. University of Geneva technical report.
39. W.T. Tutte. 1984. Graph Theory. Cambridge University Press.
40. W. Wang and M. P. Harper. 2004. A statistical constraint dependency grammar (CDG) parser. In Workshop on Incremental Parsing: Bringing Engineering and Cognition Together (ACL).
41. D. Wu. 1996. A polynomial-time algorithm for statistical machine translation. In Proc. ACL.
42. H. Yamada and Y. Matsumoto. 2003. Statistical dependency analysis with support vector machines. In Proc. IWPT.