ACL RD-TEC 1.0 Summarization of P02-1015
Paper Title:
PARSING NON-RECURSIVE CFGS
PARSING NON-RECURSIVE CFGS
Authors: Mark-Jan Nederhof and Giorgio Satta
Primarily assigned technology terms:
- algorithm
- automaton
- cky algorithm
- context-free parsing
- decomposition
- deduction system
- encoding
- finite automata
- language generation
- language processing
- left-to-right processing
- machine translation
- matching
- natural language generation
- natural language processing
- parsing
- parsing algorithm
- predictor
- processing
- reading
- recognition
- speech recognition
- terminology
Other assigned terms:
- alphabet
- ambiguity
- approach
- automata
- case
- chomsky normal form
- context-free grammar
- context-free grammars
- context-free rule
- cubic time
- deduction
- derivation
- derivations
- empirical evaluation
- empirical results
- empty string
- fact
- feature
- finite automaton
- finite set
- forest
- formal language
- formal language theory
- generation
- grammar
- grammars
- inference rule
- inference rules
- interpretation
- language theory
- lattice
- left-most derivation
- meaning
- natural language
- nonterminal
- nonterminals
- normal form
- parse
- parsing grammar
- query
- recursion
- reflexive and transitive closure
- relation
- right-hand side
- segments
- suffix
- symbol
- symbols
- terminals
- theory
- time complexity
- transitive closure
