ACL RD-TEC 1.0 Summarization of J00-1003
Paper Title:
PRACTICAL EXPERIMENTS WITH REGULAR APPROXIMATION OF CONTEXT-FREE LANGUAGES
PRACTICAL EXPERIMENTS WITH REGULAR APPROXIMATION OF CONTEXT-FREE LANGUAGES
Primarily assigned technology terms:
- algorithm
- approximation
- automaton
- computational linguistics
- final state
- finite automata
- grammar transformation
- hpsg parser
- lr automata
- lr parsing
- parser
- parsing
- processing
- pushdown automata
- pushdown automaton
- ranking
- recognition
- recognizer
- speech recognizer
- superset approximation
- transducers
- unigram method
Other assigned terms:
- ambiguity
- approach
- association for computational linguistics
- automata
- bigram
- case
- compact representation
- context-free grammar
- context-free grammars
- context-free language
- context-free languages
- context-free rule
- derivation
- derivations
- dialogues
- empirical results
- fact
- finite automaton
- finite set
- grammar
- grammar rule
- grammar rules
- grammars
- grammaticality
- hpsg
- hypotheses
- hypothesis
- implementation
- intelligence
- intention
- language theory
- left-corner strategy
- lexical ambiguity
- linguistic
- linguistics
- meaning
- measure
- mechanisms
- memory consumption
- method
- n-gram
- n-grams
- nonterminal
- nonterminals
- parse
- parse tree
- parts of speech
- precision
- probabilities
- process
- recursion
- relation
- right-hand side
- sentence
- sentences
- stochastic context-free grammars
- symbol
- symbols
- technology
- terminals
- terms
- test material
- theory
- transformation
- tree
- trees
- trigram
- understanding
- ungrammatical input
- unigram
- utterance
- words
