Rigid Lambek Grammars Are Not Learnable from Strings.
Annie ForetYannick Le NirPublished in: COLING (2002)
Keyphrases
- context free languages
- pattern languages
- finite state automata
- positive data
- regular languages
- grammatical inference
- context free grammars
- syntactic pattern recognition
- pac learning
- edit distance
- context free
- three dimensional
- finite automata
- finite alphabet
- efficient learning
- hypothesis space
- statistical queries
- equivalence queries
- string matching
- inductive inference
- mildly context sensitive
- learning from positive data
- stochastic grammar
- visual languages
- membership queries
- natural language
- learning algorithm
- lower bound
- uniform distribution
- exact learning
- positive examples