Non-associative Lambek Categorial Grammar in Polynomial Time.
Kees TrautweinErik AartsPublished in: Math. Log. Q. (1995)
Keyphrases
- grammar induction
- natural language
- special case
- finite automata
- context free grammars
- language processing
- associative memory
- grammatical inference
- approximation algorithms
- worst case
- computational complexity
- stochastic context free grammars
- linguistic knowledge
- search algorithm
- statistical machine translation
- spreading activation
- broad coverage
- natural language parsing
- np hard
- np hardness
- dnf formulas
- finite state automata
- polynomial size