ACL RD-TEC 1.0 Summarization of A00-2036
Paper Title:
LEFT-TO-RIGHT PARSING AND BILEXICAL CONTEXT-FREE GRAMMARS
LEFT-TO-RIGHT PARSING AND BILEXICAL CONTEXT-FREE GRAMMARS
Authors: Mark-Jan Nederhof and Giorgio Satta
Primarily assigned technology terms:
- algorithm
- automaton
- bidirectional parsing
- correct-prefix property parsing
- earley algorithm
- encoding
- finite automata
- grammar compilation
- grammar writer
- incremental construction
- indexing
- induction
- language parsing
- language parsing process
- left-corner parsing
- left-to-right parsing
- lr parsing
- natural language parsing
- off-line compilation
- parsers
- parsing
- parsing algorithm
- plr parsing
- polynomial-time parsing
- predictor
- preprocessing
- processing
- random access
- reading
- recognition
- recognition algorithm
- recognition process
- recognizer
- search
- syntactic analysis
- table lookup
- tabulation
- top-down filtering
- top-down prediction
Other assigned terms:
- alphabet
- array
- automata
- binary relations
- case
- chomsky normal form
- concept
- context-free grammar
- context-free grammars
- context-free languages
- data structure
- derivation
- derivations
- device
- empirical results
- empty string
- experimental results
- exponential time
- fact
- finite set
- formalism
- formalisms
- grammar
- grammar formalism
- grammar formalisms
- grammars
- hypotheses
- input string
- knowledge
- language models
- lemma
- lexical head
- lexical information
- lexical items
- lexicon
- linear time
- meaning
- natural language
- nonterminal
- nonterminals
- normal form
- pairs of words
- parse
- parse tree
- parsing accuracy
- parsing process
- polynomial time
- probabilities
- process
- reflexive and transitive closure
- relation
- rewrite rules
- right-hand side
- running time
- search space
- symbol
- symbols
- technique
- technology
- terminals
- terms
- theorem
- time complexity
- transitive closure
- tree
- word
- words
