The emptiness of intersection problem for languages of k-valued categorial grammars (classical and Lambek) is undecidable.
Annie ForetPublished in: Electron. Notes Theor. Comput. Sci. (2001)
Keyphrases
- grammar induction
- context free grammars
- grammatical inference
- language processing
- mildly context sensitive
- context free
- statistical machine translation
- context free languages
- natural language processing
- databases
- expressive power
- finite state automata
- unsupervised methods
- sufficient conditions
- language independent
- context sensitive
- closure properties
- formal language
- parse selection