The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
André Kempe: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  24. Selected Operations and Applications of n-Tape Weighted Finite-State Machines. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002