Finitely subsequential transducers

Cyril Allauzen, Mehryar Mohri

Research output: Contribution to journalArticle

Abstract

Finitely subsequential transducers are efficient finite-state transducers with a finite number of final outputs and are used in a variety of applications. Not all transducers admit equivalent finitely subsequential transducers however. We briefly describe an existing generalized determinization algorithm for finitely subsequential transducers and give the first characterization of finitely subsequentiable transducers, transducers that admit equivalent finitely subsequential transducers. Our characterization shows the existence of an efficient algorithm for testing finite subsequentiability. We have fully implemented the generalized determinization algorithm and the algorithm for testing finite subsequentiability. We report experimental results showing that these algorithms are practical in large-vocabulary speech recognition applications. The theoretical formulation of our results is the equivalence of the following three properties for finite-state transducers: determinizability in the sense of the generalized algorithm, finite subsequentiability, and the twins property.

Original languageEnglish (US)
Pages (from-to)983-994
Number of pages12
JournalInternational Journal of Foundations of Computer Science
Volume14
Issue number6
DOIs
StatePublished - 2003

Fingerprint

Transducers
Testing
Speech recognition

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this

Finitely subsequential transducers. / Allauzen, Cyril; Mohri, Mehryar.

In: International Journal of Foundations of Computer Science, Vol. 14, No. 6, 2003, p. 983-994.

Research output: Contribution to journalArticle

@article{c98890de48884ab5bf731608bb6175f5,
title = "Finitely subsequential transducers",
abstract = "Finitely subsequential transducers are efficient finite-state transducers with a finite number of final outputs and are used in a variety of applications. Not all transducers admit equivalent finitely subsequential transducers however. We briefly describe an existing generalized determinization algorithm for finitely subsequential transducers and give the first characterization of finitely subsequentiable transducers, transducers that admit equivalent finitely subsequential transducers. Our characterization shows the existence of an efficient algorithm for testing finite subsequentiability. We have fully implemented the generalized determinization algorithm and the algorithm for testing finite subsequentiability. We report experimental results showing that these algorithms are practical in large-vocabulary speech recognition applications. The theoretical formulation of our results is the equivalence of the following three properties for finite-state transducers: determinizability in the sense of the generalized algorithm, finite subsequentiability, and the twins property.",
author = "Cyril Allauzen and Mehryar Mohri",
year = "2003",
doi = "10.1142/S0129054103002126",
language = "English (US)",
volume = "14",
pages = "983--994",
journal = "International Journal of Foundations of Computer Science",
issn = "0129-0541",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "6",

}

TY - JOUR

T1 - Finitely subsequential transducers

AU - Allauzen, Cyril

AU - Mohri, Mehryar

PY - 2003

Y1 - 2003

N2 - Finitely subsequential transducers are efficient finite-state transducers with a finite number of final outputs and are used in a variety of applications. Not all transducers admit equivalent finitely subsequential transducers however. We briefly describe an existing generalized determinization algorithm for finitely subsequential transducers and give the first characterization of finitely subsequentiable transducers, transducers that admit equivalent finitely subsequential transducers. Our characterization shows the existence of an efficient algorithm for testing finite subsequentiability. We have fully implemented the generalized determinization algorithm and the algorithm for testing finite subsequentiability. We report experimental results showing that these algorithms are practical in large-vocabulary speech recognition applications. The theoretical formulation of our results is the equivalence of the following three properties for finite-state transducers: determinizability in the sense of the generalized algorithm, finite subsequentiability, and the twins property.

AB - Finitely subsequential transducers are efficient finite-state transducers with a finite number of final outputs and are used in a variety of applications. Not all transducers admit equivalent finitely subsequential transducers however. We briefly describe an existing generalized determinization algorithm for finitely subsequential transducers and give the first characterization of finitely subsequentiable transducers, transducers that admit equivalent finitely subsequential transducers. Our characterization shows the existence of an efficient algorithm for testing finite subsequentiability. We have fully implemented the generalized determinization algorithm and the algorithm for testing finite subsequentiability. We report experimental results showing that these algorithms are practical in large-vocabulary speech recognition applications. The theoretical formulation of our results is the equivalence of the following three properties for finite-state transducers: determinizability in the sense of the generalized algorithm, finite subsequentiability, and the twins property.

UR - http://www.scopus.com/inward/record.url?scp=9544224403&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=9544224403&partnerID=8YFLogxK

U2 - 10.1142/S0129054103002126

DO - 10.1142/S0129054103002126

M3 - Article

VL - 14

SP - 983

EP - 994

JO - International Journal of Foundations of Computer Science

JF - International Journal of Foundations of Computer Science

SN - 0129-0541

IS - 6

ER -