3-Way Composition of Weighted Finite-State Transducers
Cyril Allauzen, Mehryar Mohri

TL;DR
This paper introduces a faster 3-way composition algorithm for weighted finite-state transducers, improving efficiency in automata-based applications like speech recognition and string similarity measures.
Contribution
The paper presents a novel 3-way composition algorithm that outperforms standard methods in both theoretical complexity and practical runtime, with standard composition as a special case.
Findings
Significantly faster composition in practice
Theoretical complexity improvements over standard methods
Empirical results confirm efficiency gains
Abstract
Composition of weighted transducers is a fundamental algorithm used in many applications, including for computing complex edit-distances between automata, or string kernels in machine learning, or to combine different components of a speech recognition, speech synthesis, or information extraction system. We present a generalization of the composition of weighted transducers, 3-way composition, which is dramatically faster in practice than the standard composition algorithm when combining more than two transducers. The worst-case complexity of our algorithm for composing three transducers , , and resulting in , \ignore{depending on the strategy used, is or ,} is , where denotes the number of states, the number of transitions, and the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsModular Robots and Swarm Intelligence · Advanced MEMS and NEMS Technologies · Embedded Systems Design Techniques
