10 citations · 36 across the 10 of their papers we have counts for
10 papers
Selected Operations, Algorithms, and Applications of n-Tape Weighted Finite-State Machines
André Kempe
A weighted finite-state machine with n tapes (n-WFSM) defines a rational relation on n strings. It is a generalization of weighted acceptors (one tape) and transducers (two tapes).…
Viterbi Algorithm Generalized for n-Tape Best-Path Search
André Kempe
We present a generalization of the Viterbi algorithm for identifying the path with minimal (resp. maximal) weight in a n-tape weighted finite-state machine (n-WFSM), that accepts a…
Acronym-Meaning Extraction from Corpora Using Multi-Tape Weighted Finite-State Machines
André Kempe
The automatic extraction of acronyms and their meaning from corpora is an important sub-task of text mining. It can be seen as a special case of string alignment, where a text chun…
Algorithms for weighted multi-tape automata
Andre Kempe, Franck Guingne, Florent Nicart
This report defines various operations for weighted multi-tape automata (WMTAs) and describes algorithms that have been implemented for those operations in the WFSC toolkit. Some a…
Part-of-Speech Tagging with Two Sequential Transducers
Andre Kempe
We present a method of constructing and using a cascade consisting of a left- and a right-sequential finite-state transducer (FST), T1 and T2, for part-of-speech (POS) disambiguati…
Reduction of Intermediate Alphabets in Finite-State Transducer Cascades
Andre Kempe
This article describes an algorithm for reducing the intermediate alphabets in cascades of finite-state transducers (FSTs). Although the method modifies the component FSTs, there i…