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
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Fin...
We introduce a new class of probabilistic automata: Probabilistic Residual Finite State Automata. W...
We introduce a new statistical relational learning (SRL) approach in which models forstructured data...
Stochastic automata operating in an unknown random environment have been proposed earlier as models ...
This article presents an overview of Probabilistic Automata (PA) and discrete Hidden Markov Models (...
International audienceApplications of probabilistic grammatical inference are limited due to time an...
This paper presents an overview of the field of Stochastic Learning Automata (LA), and concentrates,...
It is quite natural to assign probabilities (or frequencies) to the sentences of a language to try t...
Statistical modeling of sequences is a central paradigm of machine learning that finds multiple uses...
Efficient learnability using the state merging algorithm is known for a subclass of probabilistic au...
In this paper we show that clustering alphabet symbols before PDFA inference is performed reduces p...
Grammatical inference is a branch of computational learning theory that attacks the problem of learn...
Abstract. In probabilistic grammatical inference, a usual goal is to infer a good approximation of a...
AbstractWe propose and analyze a distribution learning algorithm for a subclass ofacyclic probalisti...
We propose and analyze a distribution learning algorithm for variable memory length Markov processes...
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Fin...
We introduce a new class of probabilistic automata: Probabilistic Residual Finite State Automata. W...
We introduce a new statistical relational learning (SRL) approach in which models forstructured data...
Stochastic automata operating in an unknown random environment have been proposed earlier as models ...
This article presents an overview of Probabilistic Automata (PA) and discrete Hidden Markov Models (...
International audienceApplications of probabilistic grammatical inference are limited due to time an...
This paper presents an overview of the field of Stochastic Learning Automata (LA), and concentrates,...
It is quite natural to assign probabilities (or frequencies) to the sentences of a language to try t...
Statistical modeling of sequences is a central paradigm of machine learning that finds multiple uses...
Efficient learnability using the state merging algorithm is known for a subclass of probabilistic au...
In this paper we show that clustering alphabet symbols before PDFA inference is performed reduces p...
Grammatical inference is a branch of computational learning theory that attacks the problem of learn...
Abstract. In probabilistic grammatical inference, a usual goal is to infer a good approximation of a...
AbstractWe propose and analyze a distribution learning algorithm for a subclass ofacyclic probalisti...
We propose and analyze a distribution learning algorithm for variable memory length Markov processes...
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Fin...
We introduce a new class of probabilistic automata: Probabilistic Residual Finite State Automata. W...
We introduce a new statistical relational learning (SRL) approach in which models forstructured data...