Parsing Regular Grammars with Finite Lookahead.
Thomas J. OstrandMarvin C. PaullElaine J. WeyukerPublished in: Acta Informatica (1981)
Keyphrases
- context free
- context free grammars
- grammatical inference
- closure properties
- tree adjoining
- context sensitive
- phrase structure
- context dependent
- natural language
- syntactic pattern recognition
- parse tree
- graph grammars
- regular languages
- visual languages
- finite automata
- grammar induction
- inductive inference
- stochastic context free grammars
- tree bank
- finite state
- natural language processing
- stochastic grammar
- natural language parsing
- grammar rules
- probabilistic context free grammars
- semantic analysis
- natural language sentences
- speech understanding
- dependency parsing
- penn treebank
- regular expressions
- pattern matching
- semantic representation
- noun phrases
- finite number
- machine learning