TY - GEN
T1 - Learning mildly context-sensitive languages with multidimensional substitutability from positive data
AU - Yoshinaka, Ryo
PY - 2009
Y1 - 2009
N2 - Recently Clark and Eyraud (2007) 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 mildly context-sensitive languages with variants of substitutability.
AB - Recently Clark and Eyraud (2007) 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 mildly context-sensitive languages with variants of substitutability.
UR - http://www.scopus.com/inward/record.url?scp=77952062180&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77952062180&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-04414-4_24
DO - 10.1007/978-3-642-04414-4_24
M3 - Conference contribution
AN - SCOPUS:77952062180
SN - 3642044131
SN - 9783642044137
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 278
EP - 292
BT - Algorithmic Learning Theory - 20th International Conference, ALT 2009, Proceedings
T2 - 20th International Conference on Algorithmic Learning Theory, ALT 2009
Y2 - 3 October 2009 through 5 October 2009
ER -