Rigid grammars in the Associative-Commutative Lambek Calculus are not learnable.
Christophe Costa FlorêncioPublished in: EACL (2003)
Keyphrases
- formal language
- natural language
- associative memory
- grammatical inference
- visual languages
- mildly context sensitive
- three dimensional
- tree grammars
- context free grammars
- context free
- positive data
- learning algorithm
- spreading activation
- finite state automata
- pattern languages
- hypothesis space
- pac learning
- human memory
- phrase structure
- special case
- stochastic grammar
- target concept
- algebraic structure
- grammar induction
- computer algebra
- background knowledge
- knowledge base