k-Valued Non-Associative Lambek Categorial Grammars are not Learnable from Strings.
Denis BéchetAnnie ForetPublished in: ACL (2003)
Keyphrases
- grammar induction
- context free languages
- pattern languages
- positive data
- regular languages
- finite state automata
- context free grammars
- grammatical inference
- syntactic pattern recognition
- context free
- pac learning
- natural language
- language processing
- natural language processing
- equivalence queries
- visual languages
- statistical queries
- positive examples
- finite automata
- edit distance
- associative memory
- hypothesis space
- tree grammars
- mildly context sensitive
- spreading activation
- concept class
- biological sequences
- concept classes
- human memory
- string matching
- finite state machines
- machine translation
- upper bound
- finite alphabet
- learning algorithm
- learning from positive data
- machine learning