ACL RD-TEC 1.0 Summarization of P97-1058
Paper Title:
APPROXIMATING CONTEXT-FREE GRAMMARS WITH A FINITE-STATE CALCULUS
APPROXIMATING CONTEXT-FREE GRAMMARS WITH A FINITE-STATE CALCULUS
Primarily assigned technology terms:
- algorithm
- approximation
- approximation algorithm
- automata toolkit
- automaton
- c + +
- finite automata
- finite-state approximation
- finite-state automata
- finite-state calculus
- human language
- indexing
- language processing
- matching
- morphology
- natural language processing
- parsing
- processing
- prolog
- reading
- recogniser
- recognition
- regular expression
- sicstus prolog
- speech processing
- speech recognition
- syntactic analysis
- transducers
- unification
Other assigned terms:
- alphabet
- analysis grammar
- approach
- automata
- case
- computational complexity
- constraint grammar
- context-free grammar
- context-free grammars
- context-free language
- context-free languages
- definite clause grammars
- fact
- feature
- finite-state grammar
- finite-state language model
- formal language
- formalism
- formalisms
- fsa utilities
- generalisation
- grammar
- grammar rule
- grammars
- hypotheses
- implementation
- interpretation
- language model
- method
- natural language
- nonterminal
- nonterminals
- parse
- procedure
- prolog implementation
- recursion
- regular expressions
- relation
- right-hand side
- semantic
- semantic interpretation
- sentences
- subgrammar
- symbol
- symbols
- syntactic constraints
- syntax
- terminals
- terms
- toolkit
- transitive closure
- wildcard
