On multiple context-free grammars
Theoretical Computer Science
Characteristic Sets for Polynomial Grammatical Inference
Machine Learning
Independent parallelism in finite copying parallel rewriting systems
Theoretical Computer Science
Inference of Reversible Languages
Journal of the ACM (JACM)
Interactive learning of node selecting tree transducer
Machine Learning
Polynomial Identification in the Limit of Substitutable Context-free Languages
The Journal of Machine Learning Research
Iterative Learning of Simple External Contextual Languages
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
A Polynomial Algorithm for the Inference of Context Free Languages
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
A Learning Algorithm for Multi-dimensional Trees, or: Learning Beyond Context-Freeness
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Identification in the Limit of k,l-Substitutable Context-Free Languages
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Iterative learning of simple external contextual languages
Theoretical Computer Science
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Identification in the limit of substitutable context-free languages
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
PAC-learning unambiguous NTS languages
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Inferring grammars for mildly context sensitive languages in polynomial-time
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Polynomial time learning of some multiple context-free languages with a minimally adequate teacher
FG'10/FG'11 Proceedings of the 15th and 16th international conference on Formal Grammar
Distributional learning of simple context-free tree grammars
ALT'11 Proceedings of the 22nd international conference on Algorithmic learning theory
Integration of the dual approaches in the distributional learning of context-free grammars
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Logical grammars, logical theories
LACL'12 Proceedings of the 7th international conference on Logical Aspects of Computational Linguistics
| Hi-index | 5.23 |
Recently Clark and Eyraud (2007) [10] have shown that substitutable context-free languages, which capture an aspect of natural language phenomena, are efficiently identifiable in the limit from positive data. Generalizing their work, this paper presents a polynomial-time learning algorithm for new subclasses of multiple context-free languages with variants of substitutability.