default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndré Kempe
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[i10]André Kempe:
Selected Operations, Algorithms, and Applications of n-Tape Weighted Finite-State Machines. CoRR abs/1104.5362 (2011)
2000 – 2009
- 2009
- [c16]André Kempe:
Selected Operations and Applications of n-Tape Weighted Finite-State Machines. FSMNLP 2009: 31-46 - 2008
- [j5]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
- [j4]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
- [c15]Florent Nicart, Jean-Marc Champarnaud, Tibor Csáki, Tamás Gaál, André Kempe:
Multi-tape Automata with Symbol Classes. CIAA 2006: 126-136 - [i9]André Kempe:
Acronym-Meaning Extraction from Corpora Using Multi-Tape Weighted Finite-State Machines. CoRR abs/cs/0612033 (2006) - [i8]André Kempe:
Viterbi Algorithm Generalized for n-Tape Best-Path Search. CoRR abs/cs/0612041 (2006) - 2005
- [c14]André Kempe, Jean-Marc Champarnaud, Franck Guingne, Florent Nicart:
WFSM Auto-intersection and Join Algorithms. FSMNLP 2005: 120-131 - [c13]André Kempe, Jean-Marc Champarnaud, Jason Eisner, Franck Guingne, Florent Nicart:
A Class of Rational n-WFSM Auto-intersections. CIAA 2005: 188-198 - 2004
- [j3]André Kempe:
Extraction and recoding of input-ε-cycles in finite state transducers. Theor. Comput. Sci. 313(1): 145-158 (2004) - [j2]Franck Guingne, Florent Nicart, André Kempe:
Acyclic networks maximizing the printing complexity. Theor. Comput. Sci. 328(1-2): 39-51 (2004) - [c12]André Kempe:
NLP Applications Based onWeightedMulti-Tape Automata. TALN (Posters) 2004: 73-78 - [i7]André Kempe, Franck Guingne, Florent Nicart:
Algorithms for weighted multi-tape automata. CoRR cs.CL/0406003 (2004) - 2003
- [j1]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) - [c11]André Kempe, Christof Baeijs, Tamás Gaál, Franck Guingne, Florent Nicart:
WFSC - A New Weighted Finite State Compiler. CIAA 2003: 108-119 - [c10]Franck Guingne, André Kempe, Florent Nicart:
Running Time Complexity of Printing an Acyclic Automaton. CIAA 2003: 131-140 - 2001
- [c9]André Kempe:
Extraction of epsilon-Cyclesfrom Finite-State Transducers. CIAA 2001: 190-201 - [i6]André Kempe:
Part-of-Speech Tagging with Two Sequential Transducers. CoRR cs.CL/0110027 (2001) - 2000
- [c8]André Kempe:
Part-of-Speech Tagging with Two Sequential Transducers. CLIN 2000: 88-96 - [c7]André Kempe:
Factorization of Ambiguous Finite-State Transducers. CIAA 2000: 170-181 - [c6]André Kempe:
Part-of-Speech Tagging with Two Sequential Transducers. CIAA 2000: 337-339 - [i5]André Kempe:
Reduction of Intermediate Alphabets in Finite-State Transducer Cascades. CoRR cs.CL/0010030 (2000)
1990 – 1999
- 1999
- [c5]André Kempe:
Experiments in Unsupervised Entropy-Based Corpus Segmentation. CoNLL 1999: 7-13 - 1998
- [c4]André Kempe:
Look-Back and Look-Ahead in the Conversion of Hidden Markov Models into Finite State Transducers. CoNLL 1998: 29-38 - [i4]André Kempe:
Look-Back and Look-Ahead in the Conversion of Hidden Markov Models into Finite State Transducers. CoRR cmp-lg/9802001 (1998) - 1997
- [c3]André Kempe:
Finite State Transducers Approximating Hidden Markov Models. ACL 1997: 460-467 - [i3]André Kempe:
Finite State Transducers Approximating Hidden Markov Models. CoRR cmp-lg/9707006 (1997) - 1996
- [c2]André Kempe, Lauri Karttunen:
Parallel Replacement in Finite State Calculus. COLING 1996: 622-627 - [i2]André Kempe, Lauri Karttunen:
Parallel Replacement in Finite State Calculus. CoRR cmp-lg/9607007 (1996) - 1994
- [c1]André Kempe:
Probabilistic Tagging With Feature Structures. COLING 1994: 161-165 - [i1]André Kempe:
Probabilistic Tagging with Feature Structures. CoRR abs/cmp-lg/9410027 (1994) - 1990
- [b1]André Kempe:
Untersuchungen zur Schaffung einer einheitlichen Fachsprache für speicherprogrammierbare Steuer- und Regeleinrichtungen. Dresden University of Technology, Germany, 1990
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
