In this paper, we propose a way of incorporating additional knowledge in probabilistic automata inference, by using typed automata. We compare two kinds of knowledge that are introduced into the learning algorithms. A statistical clustering algorithm and a part-of-speech tagger are used to label the data according to statistical or syntactic information automatically obtained from the data. The labeled data is then used to infer correctly typed automata. The inference of typed automata with statistically labeled data provides language models competitive with state-of-the-art n-grams on the Air Travel Information System (ATIS) task. © Springer-Verlag 2004.
CITATION STYLE
Kermorvant, C., De La Higuera, C., & Dupont, P. (2004). Improving probabilistic automata learning with additional knowledge. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3138, 260–268. https://doi.org/10.1007/978-3-540-27868-9_27
Mendeley helps you to discover research relevant for your work.