ACL RD-TEC 1.0 Summarization of P89-1017
Paper Title:
HOW TO COVER A GRAMMAR
HOW TO COVER A GRAMMAR
Primarily assigned technology terms:
- algorithm
- automaton
- computational linguistics
- construction technique
- context-free parsing
- earley algorithm
- earley parser
- final state
- finite state
- finite state automata
- finite state automaton
- grammar reduction
- language processing
- language processing systems
- lr-parser construction
- machine translation
- machine translation system
- natural language processing
- natural language processing systems
- parser
- parsers
- parsing
- parsing method
- processing
- programming language
- pushdown automata
- quantification
- regular expression
- repair
- splitting
- state automaton
- translation system
Other assigned terms:
- approach
- automata
- case
- chomsky normal form
- concept
- context-free grammar
- context-free grammars
- context-free grammars \
- context-free languages
- cubic time
- derivation
- fact
- formalism
- grammar
- grammar format
- grammar rule
- grammar rules
- grammars
- knowledge
- language grammar
- linguistics
- method
- names
- natural language
- natural language grammar
- nonterminals
- normal form
- parse
- parse time
- parse tree
- parsing approach
- procedure
- process
- production rules
- recursion
- relation
- rewrite rules
- right-hand side
- sentence
- sentences
- symbol
- symbols
- syntax
- technique
- terminals
- terms
- theory
- tree
- trees
- universal quantification
- verb
