Non-returning PC Grammar Systems Generate Any Recursively Enumerable Language with Eight Context-free Components.
György VaszilPublished in: DCFS (2005)
Keyphrases
- context free
- inductive inference
- context dependent
- grammatical inference
- context sensitive
- context free grammars
- grammar rules
- attribute grammars
- graph grammars
- phrase structure
- recursive functions
- probabilistic context free grammars
- finite state
- natural language
- low level
- linguistic knowledge
- parse tree
- logic programs
- reinforcement learning