Improving Probabilistic Automata Learning with Additional Knowledge [chapter]

Christopher Kermorvant, Colin de la Higuera, Pierre Dupont
2004 Lecture Notes in Computer Science  
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
more » ... istically labeled data provides language models competitive with state-of-the-art n-grams on the Air Travel Information System (ATIS) task.
doi:10.1007/978-3-540-27868-9_27 fatcat:w5wtsgrdbzaq3k6hn372fsokcq