Handbook of Weighted Automata

By Manfred Droste, W. Kuich, Heiko Vogler. 2009

672 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/39084fb5e7f083aa07b21271fe66322ef940d048

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Yanping Huang
2. Z. Chen

Citations in the corpus

• Building Machine Translation Systems for the Next Thousand Languages (2022, positive): “The four component WFSTs are compiled into the final transliteration WFST T = N ◦ R′ ◦ P ◦ R−1, where “◦” denotes FST composition operation (Mohri, 2009).”
• Recurrent Neural Networks as Weighted Language Recognizers (2017, background): “For example, the weighted languages computed by weighted finite-state automata are closed under intersection (pointwise product) and union (pointwise sum), and the corresponding unweighted languages are closed under intersection, union, difference, and complementation (Droste et al., 2013).”
• The Kestrel TTS text normalization system (2014, background): “…and transducers have shown many applications in speech and language processing (Pereira, Riley and Sproat 1994; Mohri, Pereira and Riley 2002; Mohri 2009), and as algorithms have improved, and machines have become more powerful, the range of applications and the sizes of the problems to…”