ACL RD-TEC 1.0 Summarization of W05-1502
Paper Title:
PARSING LINEAR CONTEXT-FREE REWRITING SYSTEMS
PARSING LINEAR CONTEXT-FREE REWRITING SYSTEMS
Authors: Håkan Burden and Peter Ljunglöf
Primarily assigned technology terms:
- algorithm
- approximation
- boolean matrix multiplication
- cky algorithm
- computational linguistics
- computing
- context-free parsing
- context-free parsing algorithm
- context-free rewriting
- context-free rewriting systems
- incremental algorithm
- incremental parsing
- indexing
- lcfrs\/mcfg
- linear context-free rewriting
- linearization
- matrix multiplication
- parsing
- parsing algorithm
- parsing technologies
- partitioning
- post-processing
- programming language
- prolog
- top-down prediction
- unification
Other assigned terms:
- association for computational linguistics
- boolean matrix
- context-free grammar
- context-free grammars
- context-free language
- context-free rule
- data structure
- deduction
- empty string
- formalism
- formalisms
- grammar
- grammar formalisms
- grammars
- grammatical framework
- index
- inference rule
- inference rules
- input string
- knowledge
- linguistic
- linguistic knowledge
- linguistics
- mapping
- meaning
- parse
- parsing problem
- passive item
- projection
- right-hand side
- sentence
- subclass
- substring
- symbol
- technologies
- terminals
- time complexity
- trees
- word
- words
