ACL RD-TEC 1.0 Summarization of E95-1011
Paper Title:
A TRACTABLE EXTENSION OF LINEAR INDEXED GRAMMARS
A TRACTABLE EXTENSION OF LINEAR INDEXED GRAMMARS
Authors: Bill Keller and David Weir
Primarily assigned technology terms:
- algorithm
- bottom-up recognition
- cky algorithm
- context-free rewriting
- context-free rewriting systems
- encoding
- illustration
- linear context-free rewriting
- matching
- nondestructive unification
- parser
- parsers
- parsing
- plpatr recognition
- polynomial time parsing
- polynomial time recognition
- processing
- recognition
- recognition algorithm
- structure sharing
- structure-sharing
- time recognition
- tractable processing
- tractable recognition
- unification
Other assigned terms:
- analogy
- approach
- array
- binary tree
- case
- categorial grammar
- combinatory categorial grammar
- context-free grammar
- context-free grammars
- context-free language
- context-free languages
- derivation
- derivation tree
- derivation trees
- derivations
- fact
- feature
- feature information
- feature structure
- feature structures
- formalism
- formalisms
- generative capacity
- grammar
- grammar formalism
- grammar formalisms
- grammar rules
- grammars
- heuristic
- information need
- input string
- labeling
- leaf
- local tree
- names
- nonterminal
- nonterminals
- polynomial time
- process
- processing time
- recursion
- root node
- stems
- substring
- subtree
- subtrees
- symbol
- symbols
- technique
- terms
- time complexity
- tree
- tree adjoining grammar
- tree adjoining grammars
- tree grammars
- trees
- turing machine
- unification grammar
- unification-based grammar
- unification-based grammar formalism
- words
