5 citations · 9 across the 2 of their papers we have counts for
Showing cs.CLShow all
2 papers · 1 filter
cs.CL2006★ 5 cited
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…
cs.CL2006★ 4 cited
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…