André Kempe

32 papers A* 1B 4C 7Journal 15Unranked 4
YearRankTypeTitle / Venue / Authors
2011 J jnl
Selected Operations, Algorithms, and Applications of n-Tape Weighted Finite-State Machines
CoRR
André Kempe
2009 — conf
Selected Operations and Applications of
FSMNLP
André Kempe
2008 J jnl
Algorithms for the Join and Auto-Intersection of Multi-Tape Weighted Finite-State Machines.
Int. J. Found. Comput. Sci.
Jean-Marc Champarnaud, Franck Guingne, André Kempe, Florent Nicart
2007 J jnl
Labelling Multi-Tape Automata with Constrained Symbol Classes.
Int. J. Found. Comput. Sci.
Florent Nicart, Jean-Marc Champarnaud, Tibor Csáki, Tamás Gaál, André Kempe
2006 J jnl
Acronym-Meaning Extraction from Corpora Using Multi-Tape Weighted Finite-State Machines
CoRR
André Kempe
2006 C conf
Multi-tape Automata with Symbol Classes.
CIAA
Florent Nicart, Jean-Marc Champarnaud, Tibor Csáki, Tamás Gaál, André Kempe
2006 J jnl
Viterbi Algorithm Generalized for n-Tape Best-Path Search
CoRR
André Kempe
2005 C conf
A Class of Rational
CIAA
André Kempe, Jean-Marc Champarnaud, Jason Eisner, Franck Guingne, Florent Nicart
2005 — conf
WFSM Auto-intersection and Join Algorithms.
FSMNLP
André Kempe, Jean-Marc Champarnaud, Franck Guingne, Florent Nicart
2004 J jnl
Acyclic networks maximizing the printing complexity.
Theor. Comput. Sci.
Franck Guingne, Florent Nicart, André Kempe
2004 J jnl
Algorithms for weighted multi-tape automata
CoRR
André Kempe, Franck Guingne, Florent Nicart
2004 J jnl
Extraction and recoding of input-ε-cycles in finite state transducers.
Theor. Comput. Sci.
André Kempe
2004 — conf
NLP Applications Based onWeightedMulti-Tape Automata.
TALN (Posters)
André Kempe
2003 C conf
Running Time Complexity of Printing an Acyclic Automaton.
CIAA
Franck Guingne, André Kempe, Florent Nicart
2003 J jnl
Virtual Operations On Virtual Networks: The Priority Union .
Int. J. Found. Comput. Sci.
Franck Guingne, Florent Nicart, Jean-Marc Champarnaud, Lauri Karttunen, Tamás Gaál, André Kempe
2003 C conf
WFSC - A New Weighted Finite State Compiler.
CIAA
André Kempe, Christof Baeijs, Tamás Gaál, Franck Guingne, Florent Nicart
2001 C conf
Extraction of epsilon-Cyclesfrom Finite-State Transducers.
CIAA
André Kempe
2001 J jnl
Part-of-Speech Tagging with Two Sequential Transducers
CoRR
André Kempe
2000 C conf
Factorization of Ambiguous Finite-State Transducers.
CIAA
André Kempe
2000 — conf
Part-of-Speech Tagging with Two Sequential Transducers.
CLIN
André Kempe
2000 C conf
Part-of-Speech Tagging with Two Sequential Transducers.
CIAA
André Kempe
2000 J jnl
Reduction of Intermediate Alphabets in Finite-State Transducer Cascades
CoRR
André Kempe
1999 B conf
Experiments in Unsupervised Entropy-Based Corpus Segmentation.
CoNLL
André Kempe
1998 J jnl
Look-Back and Look-Ahead in the Conversion of Hidden Markov Models into Finite State Transducers
CoRR
André Kempe
1998 B conf
Look-Back and Look-Ahead in the Conversion of Hidden Markov Models into Finite State Transducers.
CoNLL
André Kempe
1997 J jnl
Finite State Transducers Approximating Hidden Markov Models
CoRR
André Kempe
1997 A* conf
Finite State Transducers Approximating Hidden Markov Models.
ACL
André Kempe
1996 J jnl
Parallel Replacement in Finite State Calculus
CoRR
André Kempe, Lauri Karttunen
1996 B conf
Parallel Replacement in Finite State Calculus.
COLING
André Kempe, Lauri Karttunen
1994 B conf
Probabilistic Tagging With Feature Structures.
COLING
André Kempe
1994 J jnl
Probabilistic Tagging with Feature Structures.
CoRR
André Kempe
1990 — —
Untersuchungen zur Schaffung einer einheitlichen Fachsprache für speicherprogrammierbare Steuer- und Regeleinrichtungen.
André Kempe