ویراساینس.
سند علمی

Filters for Efficient Composition of Weighted Finite-State Transducers

Cyril Allauzen, Michael Riley, Johan Schalkwyk

چکیده

This paper describes a weighted finite-state transducer composition algorithm that generalizes the concept of the composition filter and presents various filters that process epsilon transitions, lookahead along paths, and push forward labels along epsilon paths. These filters, either individually or in combination, make it possible to compose some transducers much more efficiently in time and space than otherwise possible. We present examples of this drawn, in part, from demanding speech-processing applications. The generalized composition algorithm and many of these filters have been included in OpenFst, an open-source weighted transducer library.

اسناد مشابه

  • A Filter-Based Algorithm for Efficient Composition of Finite-State Transducers

    سند علمی۲۰۱۱Int. J. Found. Comput. Sci.Cyril Allauzen, Michael Riley, Johan Schalkwyk

    This paper describes a weighted finite-state transducer composition algorithm that generalizes the concept of the composition filter and presents various filters that process epsilon transitions, look-ahead along paths, and push forward labels along epsilon paths. These filters,

  • A New Epsilon Filter for Efficient Composition of Weighted Finite-State Transducers

    سند علمی۲۰۱۱INTERSPEECHFrank Duckhorn, Matthias Wolff, Rüdiger Hoffmann

    In this paper we propose a new composition algorithm for weighted finite-states transducers that are more and more used for speech and pattern recognition applications. Composition joins multiple transducers into one. We have implemented an embedded speech based dialog system for

  • A generalized composition algorithm for weighted finite-state transducers

    سند علمی۲۰۰۹INTERSPEECHCyril Allauzen, Michael Riley, Johan Schalkwyk

    This paper describes a weighted finite-state transducer composition algorithm that generalizes the concept of the composition filter and presents filters that remove useless epsilon paths and push forward labels and weights along epsilon paths. This filtering permits the composti

  • OpenFst: A General and Efficient Weighted Finite-State Transducer Library (Invited Talk)

    سند علمی۲۰۰۷Cyril Allauzen, Michael Riley, Johan Schalkwyk, Wojciech Skut

    We describe OpenFst, an open-source library for weighted finite-state transducers (WFSTs). OpenFst consists of a C++ template library with efficient WFST representations and over twenty-five operations for constructing, combining, optimizing, and searching them. At the shell-comm

  • OpenFst: A General and Efficient Weighted Finite-State Transducer Library

    سند علمی۲۰۰۷CIAACyril Allauzen, Michael Riley, Johan Schalkwyk, Wojciech Skut

    We describe OpenFst, an open-source library for weighted finite-state transducers (WFSTs). OpenFst consists of a C++ template library with efficient WFST representations and over twenty-five operations for constructing, combining, optimizing, and searching them. At the shell-comm

  • Fast on-the-fly composition for weighted finite-state transducers in 1.8 million-word vocabulary continuous speech recognition

    سند علمی۲۰۰۴INTERSPEECHTakaaki Hori, Chiori Hori, Yasuhiro Minami

    This paper proposes a new on-the-fly composition algorithm for Weighted Finite-State Transducers (WFSTs) in large-vocabulary continuous-speech recognition. In general on-the-fly composition, two transducers are composed during decoding, and a Viterbi search is performed based on