Peter Neuhaus
ABSTRACT
Results of computational complexity exist for a wide range of phrase structure-based grammar formalisms, while there is an apparent lack of such results for dependency-based formalisms. We here adapt a result on the complexity of ID/LP-grammars to the dependency framework. Contrary to previous studies on heavily restricted dependency grammars, we prove that recognition (and thus, parsing) of linguistically adequate dependency grammars is NP-complete.
- Barton, Jr., G. E. (1985). On the complexity of ID/LP parsing. Computational Linguistics, 11(4):205--218. Google Scholar
Digital Library
- Bröker, N. (1997). Eine Dependenzgrammatik zur Kopplung heterogener Wissenssysteme auf modallogischer Basis, (Dissertation). Freiburg, DE: Philosophische Fakultät, Albert-Ludwigs-Universtät.Google Scholar
- Earley, J. (1970). An efficient context-free parsing algorithm. Communications of the ACM, 13(2):94--102. Google ScholarDigital Library
- Gaifman, H. (1965). Dependency systems and phrase-structure systems. Information & Control, 8:304--337.Google ScholarCross Ref
- Garey, M. R. & D. S. Johnson (1983). Computers and Intractability: A Guide to the Theory of NP-completeness (2.ed.). New York, NY: Freeman. Google ScholarDigital Library
- Haegeman, L. (1994). Introduction to Government and Binding. Oxford, UK: Basil Blackwell.Google Scholar
- Hellwig, P. (1988). Chart parsing according to the slot and filler principle. In Proc. of the 12th Int. Conf. on Computational Linguistics. Budapest, HU, 22--27 Aug 1988, Vol. 1, pp. 242--244. Google ScholarDigital Library
- Hepple, M. (1990). Word order and obliqueness in categorial grammar. In G. Barry & G. Morill (Eds.), Studies in categorial grammar, pp. 47--64. Edinburgh, UK: Edinburgh University Press.Google Scholar
- Huck, G. (1988). Phrasal verbs and the categories of postponement. In R. Oehrle, E. Bach & D. Wheeler (Eds.), Categorial Grammars and Natural Language Structures, pp. 249--263. Studies in Linguistics and Philosophy 32. Dordrecht, NL: D. Reidel.Google Scholar
- Hudson, R. (1990). English Word Grammar. Oxford, UK: Basil Blackwell.Google Scholar
- Lombardo, V. & L. Lesmo (1996). An earley-type recognizer for dependency grammar. In Proc. of the 16th Int. Conf. on Computational Linguistics. Copenhagen, DK, 5--9 Aug 1996, Vol. 2, pp. 723--728. Google ScholarDigital Library
- McCord, M. (1990). Slot grammar: A system for simpler construction of practical natural language grammars. In R. Studer (Ed.), Natural Language and Logic, pp. 118--145. Berlin, Heidelberg: Springer. Google ScholarDigital Library
- Mel'čuk, I. (1988). Dependency Syntax: Theory and Practice. New York, NY: SUNY State University Press of New York.Google Scholar
- Mel'čuk, I. & N. Pertsov (1987). Surface Syntax of English: A Formal Model within the MTT Framework. Amsterdam, NL: John Benjamins.Google Scholar
- Neuhaus, P. & U. Hahn (1996). Restricted parallelism in object-oriented lexical parsing. In Proc. of the 16th Int. Conf. on Computational Linguistics. Copenhagen, DK, 5--9 Aug 1996, pp. 502--507. Google ScholarDigital Library
- Pollard, C. & I. Sag (1994). Head-Driven Phrase Structure Grammar. Chicago, IL: University of Chicago Press.Google Scholar
- Rambow, O. & A. Joshi (1994). A formal look at DGs and PSGs, with consideration of word-order phenomena. In L. Wanner (Ed.), Current Issues in Meaning-Text-Theory. London: Pinter.Google Scholar
- Reape, M. (1989). A logical treatment of semi-free word order and discontinuous constituents. In Proc. of the 27th Annual Meeting of the Association for Computational Linguistics. Vancouver, BC, 1989, pp. 103--110. Google ScholarDigital Library
- Starosta, S. (1988). The Case for Lexicase. London: Pinter.Google Scholar
- Starosta, S. (1992). Lexicase revisited. Department of Linguistics, University of Hawaii.Google Scholar
- Tesnière, L. ((1969) 1959). Eléments de Syntaxe Structurale (2.ed.). Paris, FR: Klincksieck.Google Scholar
- The complexity of recognition of linguistically adequate dependency grammars
Recommendations
Categorial dependency grammars
Categorial Dependency Grammars (CDGs) are classical categorial grammars extended by oriented polarized valencies. At the same time, CDGs represent a class of completely lexicalized dependency grammars. They express both projective and non-projective ...
Nonterminal complexity of programmed grammars
We show that, in the case of context-free programmed grammars with appearance checking working under free derivations, three nonterminals are enough to generate every recursively enumerable language. This improves the previously published bound of eight ...
Quasi-synchronous phrase dependency grammars for machine translation
EMNLP '11: Proceedings of the Conference on Empirical Methods in Natural Language ProcessingWe present a quasi-synchronous dependency grammar (Smith and Eisner, 2006) for machine translation in which the leaves of the tree are phrases rather than words as in previous work (Gimpel and Smith, 2009). This formulation allows us to combine ...
Comments