Lambek Grammars with One Division Are Decidable in Polynomial Time.
Yury SavateevPublished in: CSR (2008)
Keyphrases
- polynomial hierarchy
- grammatical inference
- special case
- computational complexity
- worst case
- approximation algorithms
- context free grammars
- finite automata
- natural language
- machine learning
- natural language processing
- first order logic
- finite state automata
- phrase structure
- syntactic pattern recognition
- datalog programs