ACL RD-TEC 1.0 Summarization of P97-1043
Paper Title:
THE COMPLEXITY OF RECOGNITION OF LINGUISTICALLY ADEQUATE DEPENDENCY GRAMMARS
THE COMPLEXITY OF RECOGNITION OF LINGUISTICALLY ADEQUATE DEPENDENCY GRAMMARS
Authors: Peter Neuhaus and Norbert Broker
Primarily assigned technology terms:
Other assigned terms:
- alphabet
- approach
- binary relation
- case
- computational complexity
- concept
- context-free grammars
- context-free phrase structure
- cubic time
- data structure
- dependency grammar
- dependency grammars
- dependency relation
- dependency relations
- dependency tree
- dependency trees
- dependency unification grammar
- empty categories
- fact
- feature
- feature structures
- finite verb
- formal description
- formalism
- formalisms
- formalization
- generative capacity
- grammar
- grammar formalisms
- grammars
- grammatical function
- graph structure
- heuristics
- hpsg
- input string
- interpretation
- knowledge
- leaf
- lemma
- lemmata
- lexeme
- lexicase
- lexicon
- lexicon entry
- linear order
- linguistic
- linguistic framework
- linguistics
- logic
- mapping
- maps
- meaning-text theory
- measure
- mechanisms
- modifier
- parsing approach
- phrase
- phrase structure
- phrase structure grammars
- polynomial time
- precision
- predicates
- process
- proposition
- relation
- representations
- rule format
- semantic
- semantic role
- sentence
- slot
- subclass
- symbol
- technique
- terminals
- text
- theory
- time complexity
- translation component
- tree
- tree structure
- trees
- unbounded dependencies
- understanding
- unification grammar
- valency
- verb
- vertex
- word
- word classes
- word grammar
- word order
- words
