Christopher Kermorvant, Colin de la Higuera, Pierre Dupont  Home/Search
Context
Related
| info.ucl.ac.be/~pdupon...sspr2004.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: info.ucl.ac.be/~pdupont/pdu...bib (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper , we propose a way of incorporating additional knowledge in probabilistic automata inference, by using typed automata. (Update)
Active bibliography (related documents): More All
1.1: Probabilistic Finite-State Machines - Part II - Vidal, al. (Correct)
0.4: Learning Hidden Markov Models to Fit Long-Term Dependencies - Callut, Dupont (2005) (Correct)
0.4: A Markovian Approach to the Induction of Regular String.. - Callut, Dupont (2004) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ kermorvant-improving,
author = "Christopher Kermorvant and Colin de la Higuera and Pierre Dupont",
title = "Improving Probabilistic Automata Learning with Additional Knowledge",
url = "citeseer.ist.psu.edu/kermorvant04improving.html" }
Citations (may not include all citations):265 A simple rule-based part-of-speech tagger - Brill - 1992
51 Learning stochastic regular grammars by means of a state mer.. - Carrasco, Oncina - 1994
48 Inducing probabilistic grammars by bayesian model merging - Stolcke, Omohundro - 1994
34 the learnability and usage of acyclic probabilistic nite au.. - Ron, Singer et al. - 1995
28 What is the search space of the regular inference - Dupont, Miclet et al. - 1994
20 Information and Control (context) - Gold, cation et al. - 1967
14 gram language modeling (context) - Kneser, Ney et al. - 1995
11 Probabilistic DFA inference using Kullback-Leibler divergenc.. - Thollard, Dupont et al. - 2000
11 Identifying regular languages in polynomial time (context) - Oncina, Garca - 1992
7 Using symbol clustering to improve probabilistic automaton i.. - Dupont, Chase - 1998
4 Finite state language models smoothed using N-grams (context) - Llorens, Vilar et al. - 2002
2 Learning languages with help - Kermorvant, Higuera - 2002
Documents on the same site (http://www.info.ucl.ac.be/~pdupont/pdupont/bib.html): More
Learning Hidden Markov Models to Fit Long-Term Dependencies - Callut, Dupont (2005) (Correct)
Improved smoothing for Probabilistic Suffix Trees seen as.. - Kermorvant, Dupont (2002) (Correct)
Declarative Approximate Graph Matching Using a Constraint.. - Zampelli, Deville, Dupont (2005) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC