André Kempe

2008
25	EE	Jean-Marc Champarnaud, Franck Guingne, André Kempe, Florent Nicart: Algorithms for the Join and Auto-Intersection of Multi-Tape Weighted Finite-State Machines. Int. J. Found. Comput. Sci. 19(2): 453-476 (2008)
2007
24	EE	Florent Nicart, Jean-Marc Champarnaud, Tibor Csáki, Tamás Gaál, André Kempe: Labelling Multi-Tape Automata with Constrained Symbol Classes. Int. J. Found. Comput. Sci. 18(4): 847-858 (2007)
2006
23	EE	Florent Nicart, Jean-Marc Champarnaud, Tibor Csáki, Tamás Gaál, André Kempe: Multi-tape Automata with Symbol Classes. CIAA 2006: 126-136
22	EE	André Kempe: Acronym-Meaning Extraction from Corpora Using Multi-Tape Weighted Finite-State Machines CoRR abs/cs/0612033: (2006)
21	EE	André Kempe: Viterbi Algorithm Generalized for n-Tape Best-Path Search CoRR abs/cs/0612041: (2006)
2005
20	EE	André Kempe, Jean-Marc Champarnaud, Jason Eisner, Franck Guingne, Florent Nicart: A Class of Rational n-WFSM Auto-intersections. CIAA 2005: 188-198
19	EE	André Kempe, Jean-Marc Champarnaud, Franck Guingne, Florent Nicart: WFSM Auto-intersection and Join Algorithms. FSMNLP 2005: 120-131
2004
18	EE	André Kempe, Franck Guingne, Florent Nicart: Algorithms for weighted multi-tape automata CoRR cs.CL/0406003: (2004)
17	EE	André Kempe: Extraction and recoding of input-[epsiv]-cycles in finite state transducers. Theor. Comput. Sci. 313(1): 145-158 (2004)
16	EE	Franck Guingne, Florent Nicart, André Kempe: Acyclic networks maximizing the printing complexity. Theor. Comput. Sci. 328(1-2): 39-51 (2004)
2003
15	EE	André Kempe, Christof Baeijs, Tamás Gaál, Franck Guingne, Florent Nicart: WFSC - A New Weighted Finite State Compiler. CIAA 2003: 108-119
14	EE	Franck Guingne, André Kempe, Florent Nicart: Running Time Complexity of Printing an Acyclic Automaton. CIAA 2003: 131-140
13	EE	Franck Guingne, Florent Nicart, Jean-Marc Champarnaud, Lauri Karttunen, Tamás Gaál, André Kempe: Virtual Operations On Virtual Networks: The Priority Union . Int. J. Found. Comput. Sci. 14(6): 1055-1071 (2003)
2001
12	EE	André Kempe: Extraction of epsilon-Cyclesfrom Finite-State Transducers. CIAA 2001: 190-201
11	EE	André Kempe: Part-of-Speech Tagging with Two Sequential Transducers CoRR cs.CL/0110027: (2001)
2000
10	EE	André Kempe: Factorization of Ambiguous Finite-State Transducers. CIAA 2000: 170-181
9	EE	André Kempe: Part-of-Speech Tagging with Two Sequential Transducers. CIAA 2000: 337-339
8		André Kempe: Part-of-Speech Tagging with Two Sequential Transducers. CLIN 2000: 88-96
7	EE	André Kempe: Reduction of Intermediate Alphabets in Finite-State Transducer Cascades CoRR cs.CL/0010030: (2000)
1998
6	EE	André Kempe: Look-Back and Look-Ahead in the Conversion of Hidden Markov Models into Finite State Transducers CoRR cmp-lg/9802001: (1998)
1997
5		André Kempe: Finite State Transducers Approximating Hidden Markov Models. ACL 1997: 460-467
4	EE	André Kempe: Finite State Transducers Approximating Hidden Markov Models CoRR cmp-lg/9707006: (1997)
1996
3	EE	André Kempe, Lauri Karttunen: Parallel Replacement in Finite State Calculus. COLING 1996: 622-627
2	EE	André Kempe, Lauri Karttunen: Parallel Replacement in Finite State Calculus CoRR cmp-lg/9607007: (1996)
1994
1	EE	André Kempe: Probabilistic Tagging With Feature Structures. COLING 1994: 161-165

Coauthor Index

1	Christof Baeijs	[15]
2	Jean-Marc Champarnaud	[13] [19] [20] [23] [24] [25]
3	Tibor Csáki	[23] [24]
4	Jason Eisner	[20]
5	Tamás Gaál	[13] [15] [23] [24]
6	Franck Guingne	[13] [14] [15] [16] [18] [19] [20] [25]
7	Lauri Karttunen	[2] [3] [13]
8	Florent Nicart	[13] [14] [15] [16] [18] [19] [20] [23] [24] [25]