TY - GEN
T1 - Polynomial time learning of some multiple context-free languages with a minimally adequate teacher
AU - Yoshinaka, Ryo
AU - Clark, Alexander
PY - 2012
Y1 - 2012
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84865477742&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84865477742&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-32024-8_13
DO - 10.1007/978-3-642-32024-8_13
M3 - Conference contribution
AN - SCOPUS:84865477742
SN - 9783642320231
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 192
EP - 207
BT - Formal Grammar - 16th International Conference, FG 2011, Revised Selected Papers
T2 - 16th International Conference on Formal Grammar, FG 2011
Y2 - 6 August 2011 through 7 August 2011
ER -