TY - GEN
T1 - Learning subregular classes of languages with factored deterministic automata
AU - Heinz, Jeffrey
AU - Rogers, James
N1 - Publisher Copyright:
© 2013 Association for Computational Linguistics.
PY - 2013
Y1 - 2013
N2 - This paper shows how factored finitestate representations of subregular language classes are identifiable in the limit from positive data by learners which are polytime iterative and optimal. These representations are motivated in two ways. First, the size of this representation for a given regular language can be exponentially smaller than the size of the minimal deterministic acceptor recognizing the language. Second, these representations (including the exponentially smaller ones) describe actual formal languages which successfully model natural language phenomenon, notably in the subfield of phonology.
AB - This paper shows how factored finitestate representations of subregular language classes are identifiable in the limit from positive data by learners which are polytime iterative and optimal. These representations are motivated in two ways. First, the size of this representation for a given regular language can be exponentially smaller than the size of the minimal deterministic acceptor recognizing the language. Second, these representations (including the exponentially smaller ones) describe actual formal languages which successfully model natural language phenomenon, notably in the subfield of phonology.
UR - https://www.scopus.com/pages/publications/85048736654
M3 - Conference contribution
AN - SCOPUS:85048736654
T3 - MoL 2013 - Proceedings of the 13th Meeting on the Mathematics of Language, Proceedings
SP - 64
EP - 71
BT - MoL 2013 - Proceedings of the 13th Meeting on the Mathematics of Language, Proceedings
PB - Association for Computational Linguistics (ACL)
T2 - 13th Meeting on the Mathematics of Language, MoL 2013
Y2 - 9 August 2013
ER -