A new epsilon filter for efficient composition of weighted finite-state transducers

2011 ◽  
Author(s):  
Frank Duckhorn ◽  
Matthias Wolff ◽  
Rüdiger Hoffmann
Keyword(s):  
Finite State Transducers ◽  
Finite State ◽  
Weighted Finite State Transducers

scholarly journals Composition of weighted finite transducers in MapReduce

2021 ◽  
Vol 8 (1) ◽  
Author(s):  
Bilal Elghadyry ◽  
Faissal Ouardi ◽  
Sébastien Verel
Keyword(s):  
Speech Processing ◽  
Large Scale ◽  
Large Scale Data ◽  
Finite State Transducers ◽  
Wide Range ◽  
Finite State ◽  
Common Operation ◽  
Efficient Representation ◽  
Weighted Finite State Transducers ◽  
Np Hardness

AbstractWeighted finite-state transducers have been shown to be a general and efficient representation in many applications such as text and speech processing, computational biology, and machine learning. The composition of weighted finite-state transducers constitutes a fundamental and common operation between these applications. The NP-hardness of the composition computation problem presents a challenge that leads us to devise efficient algorithms on a large scale when considering more than two transducers. This paper describes a parallel computation of weighted finite transducers composition in MapReduce framework. To the best of our knowledge, this paper is the first to tackle this task using MapReduce methods. First, we analyze the communication cost of this problem using Afrati et al. model. Then, we propose three MapReduce methods based respectively on input alphabet mapping, state mapping, and hybrid mapping. Finally, intensive experiments on a wide range of weighted finite-state transducers are conducted to compare the proposed methods and show their efficiency for large-scale data.

scholarly journals Transliterated Mobile Keyboard Input via Weighted Finite-State Transducers

2017 ◽  
Author(s):  
Lars Hellsten ◽  
Brian Roark ◽  
Prasoon Goyal ◽  
Cyril Allauzen ◽  
Françoise Beaufays ◽  
...  
Keyword(s):  
Keyboard Input ◽  
Finite State Transducers ◽  
Finite State ◽  
Weighted Finite State Transducers

scholarly journals Modular non-repeating codes for DNA storage

2016 ◽  
Author(s):  
Ian Holmes
Keyword(s):  
Dna Sequence ◽  
Block Code ◽  
Information Storage ◽  
State Machines ◽  
Sequencing Technologies ◽  
Finite State Transducers ◽  
Dna Storage ◽  
Finite State ◽  
Simulation Results ◽  
Weighted Finite State Transducers

1AbstractWe describe a strategy for constructing codes for DNA-based information storage by serial composition of weighted finite-state transducers. The resulting state machines can integrate correction of substitution errors; synchronization by interleaving watermark and periodic marker signals; conversion from binary to ternary, quaternary or mixed-radix sequences via an efficient block code; encoding into a DNA sequence that avoids homopolymer, dinucleotide, or trinucleotide runs and other short local repeats; and detection/correction of errors (including local duplications, burst deletions, and substitutions) that are characteristic of DNA sequencing technologies. We present software implementing these codes, available at https://github.com/ihh/dnastore, with simulation results demonstrating that the generated DNA is free of short repeats and can be accurately decoded even in the presence of substitutions, short duplications and deletions.

Voice search optimization using weighted finite-state transducers

2012 ◽  
Vol 131 (4) ◽  
pp. 3235-3235
Author(s):  
Yuhong Guo ◽  
Ta Li ◽  
Yujing Si ◽  
Jielin Pan ◽  
Yonghong Yan
Keyword(s):  
Finite State Transducers ◽  
Search Optimization ◽  
Finite State ◽  
Weighted Finite State Transducers
Sign in / Sign up

Export Citation Format

Share Document