Polynomial time learning of some multiple context-free languages with a minimally adequate teacher

Authors:
Ryo Yoshinaka;Alexander Clark
Affiliations:
MINATO Discrete Structure Manipulation System Project, ERATO, Japan Science and Technology Agency, Japan;Department of Computer Science, Royal Holloway, University of London, UK
Venue:
FG'10/FG'11 Proceedings of the 15th and 16th international conference on Formal Grammar
Year:
2010

Citing 18
Cited 4

Learning regular sets from queries and counterexamples

Information and Computation
The string generating power of context-free hypergraph grammars

Journal of Computer and System Sciences
On multiple context-free grammars

Theoretical Computer Science
When won't membership queries help?

Selected papers of the 23rd annual ACM symposium on Theory of computing
Independent parallelism in finite copying parallel rewriting systems

Theoretical Computer Science
Conjunctive grammars

Journal of Automata, Languages and Combinatorics - Special issue: selected papers of the second internaional workshop on Descriptional Complexity of Automata, Grammars and Related Structures (London, Ontario, Canada, July 27-29, 2000)
Derivational Minimalism

LACL '96 Selected papers from the First International Conference on Logical Aspects of Computational Linguistics
Characterizing structural descriptions produced by various grammatical formalisms

ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
PAC-learnability of Probabilistic Deterministic Finite State Automata

The Journal of Machine Learning Research
Multitext Grammars and synchronous parsers

NAACL '03 Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology - Volume 1
The Mathematics of Language

Computational Linguistics
Polynomial Identification in the Limit of Substitutable Context-free Languages

The Journal of Machine Learning Research
A Polynomial Algorithm for the Inference of Context Free Languages

ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Tree adjunct grammars

Journal of Computer and System Sciences
Distributional learning of some context-free languages with a minimally adequate teacher

ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Polynomial-time identification of multiple context-free languages from positive data and membership queries

ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
A learnable representation for syntax using residuated lattices

FG'09 Proceedings of the 14th international conference on Formal grammar
PAC-learning unambiguous NTS languages

ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications

Efficient learning of multiple context-free languages with multidimensional substitutability from positive data

Theoretical Computer Science
Distributional learning of abstract categorial grammars

LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
Towards dual approaches for learning context-free grammars based on syntactic concept lattices

DLT'11 Proceedings of the 15th international conference on Developments in language theory
A language theoretic approach to syntactic structure

MOL'11 Proceedings of the 12th biennial conference on The mathematics of language

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an algorithm for the inference of some Multiple Context-Free Grammars from Membership and Equivalence Queries, using the Minimally Adequate Teacher model of Angluin. This is an extension of the congruence based methods for learning some Context-Free Grammars proposed by Clark (ICGI 2010). We define the natural extension of the syntactic congruence to tuples of strings, and demonstrate we can efficiently learn the class of Multiple Context-Free Grammars where the non-terminals correspond to the congruence classes under this relation.