The Complexity of Recognition of Linguistically Adequate Dependency Grammars
نویسندگان
چکیده
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.
منابع مشابه
A polynomial parsing algorithm for the topological model Synchronizing Constituent and Dependency Grammars, Illustrated by German Word Order Phenomena
This paper describes a minimal topology driven parsing algorithm for topological grammars that synchronizes a rewriting grammar and a dependency grammar, obtaining two linguistically motivated syntactic structures. The use of non-local slash and visitor features can be restricted to obtain a CKY type analysis in polynomial time. German long distance phenomena illustrate the algorithm, bringing ...
متن کاملComputational properties of Unification Grammars
There is currently considerable interest among computational linguists in grammatical formalisms with highly restricted generative power. This is based on the argument that a grammar formalism should not merely be viewed as a notation, but as part of the linguistic theory. It is now generally accepted that CFGs lack the generative power needed for this purpose. Unification grammars have the abi...
متن کاملCCGbank: A Corpus of CCG Derivations and Dependency Structures Extracted from the Penn Treebank
This article presents an algorithm for translating the Penn Treebank into a corpus of Combinatory Categorial Grammar (CCG) derivations augmented with local and long-range word–word dependencies. The resulting corpus,CCGbank,includes 99.4% of the sentences in the Penn Treebank. It is available from the Linguistic Data Consortium,and has been used to train widecoverage statistical parsers that ob...
متن کاملA Finite-State Parser with Dependency Structure Output
Dependency parsers and nite-state parsers are both capable of rapid and robust parsing of natural language. Dependency parsers produce richer output structures, while nite-state parsers can be more eecient. We show how a nite-state parser can be used to produce dependency structures for most phrase types, with an O(n 2) complexity in the number of words. The parser allows syntactically ambiguou...
متن کاملHybrid text simplification using synchronous dependency grammars with hand-written and automatically harvested rules
We present an approach to text simplification based on synchronous dependency grammars. The higher level of abstraction afforded by dependency representations allows for a linguistically sound treatment of complex constructs requiring reordering and morphological change, such as conversion of passive voice to active. We present a synchronous grammar formalism in which it is easy to write rules ...
متن کامل