André Kempe

According to our database1, André Kempe authored at least 26 papers between 1990 and 2011.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2011
Selected Operations, Algorithms, and Applications of n-Tape Weighted Finite-State Machines
CoRR, 2011

2009
Selected Operations and Applications of <i>n</i>-Tape Weighted Finite-State Machines.
Proceedings of the Finite-State Methods and Natural Language Processing, 2009

2008
Algorithms for the Join and Auto-Intersection of Multi-Tape Weighted Finite-State Machines.
Int. J. Found. Comput. Sci., 2008

2007
Labelling Multi-Tape Automata with Constrained Symbol Classes.
Int. J. Found. Comput. Sci., 2007

2006
Viterbi Algorithm Generalized for n-Tape Best-Path Search
CoRR, 2006

Acronym-Meaning Extraction from Corpora Using Multi-Tape Weighted Finite-State Machines
CoRR, 2006

Multi-tape Automata with Symbol Classes.
Proceedings of the Implementation and Application of Automata, 2006

2005
A Class of Rational <i>n</i>-WFSM Auto-intersections.
Proceedings of the Implementation and Application of Automata, 2005

WFSM Auto-intersection and Join Algorithms.
Proceedings of the Finite-State Methods and Natural Language Processing, 2005

2004
Extraction and recoding of input-ε-cycles in finite state transducers.
Theor. Comput. Sci., 2004

Acyclic networks maximizing the printing complexity.
Theor. Comput. Sci., 2004

Algorithms for weighted multi-tape automata
CoRR, 2004

NLP Applications Based onWeightedMulti-Tape Automata.
Proceedings of the Actes de la 11ème conférence sur le Traitement Automatique des Langues Naturelles. Posters, 2004

2003
Virtual Operations On Virtual Networks: The Priority Union .
Int. J. Found. Comput. Sci., 2003

WFSC - A New Weighted Finite State Compiler.
Proceedings of the Implementation and Application of Automata, 2003

Running Time Complexity of Printing an Acyclic Automaton.
Proceedings of the Implementation and Application of Automata, 2003

2001
Extraction of epsilon-Cyclesfrom Finite-State Transducers.
Proceedings of the Implementation and Application of Automata, 2001

2000
Reduction of Intermediate Alphabets in Finite-State Transducer Cascades
CoRR, 2000

Part-of-Speech Tagging with Two Sequential Transducers.
Proceedings of the Implementation and Application of Automata, 2000

Factorization of Ambiguous Finite-State Transducers.
Proceedings of the Implementation and Application of Automata, 2000

1999
Experiments in Unsupervised Entropy-Based Corpus Segmentation.
Proceedings of the 1999 Workshop on Computational Natural Language Learning, 1999

1998
Look-Back and Look-Ahead in the Conversion of Hidden Markov Models into Finite State Transducers.
Proceedings of the Joint Conference on New Methods in Language Processing and Computational Natural Language Learning, 1998

1997
Finite State Transducers Approximating Hidden Markov Models.
Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and 8th Conference of the European Chapter of the Association for Computational Linguistics, 1997

1996
Parallel Replacement in Finite State Calculus.
Proceedings of the 16th International Conference on Computational Linguistics, 1996

1994
Probabilistic Tagging With Feature Structures.
Proceedings of the 15th International Conference on Computational Linguistics, 1994

1990
Untersuchungen zur Schaffung einer einheitlichen Fachsprache für speicherprogrammierbare Steuer- und Regeleinrichtungen.
PhD thesis, 1990


  Loading...