Finite-State Transducers in Language and Speech Processing

Research output: Contribution to journalArticle

Abstract

Finite-state machines have been used in various domains of natural language processing. We consider here the use of a type of transducer that supports very efficient programs: sequential transducers. We recall classical theorems and give new ones characterizing sequential string-to-string transducers. Transducers that output weights also play an important role in language and speech processing. We give a specific study of string-to-weight transducers, including algorithms for determinizing and minimizing these transducers very efficiently, and characterizations of the transducers admitting determinization and the corresponding algorithms. Some applications of these algorithms in speech recognition are described and illustrated.

Original languageEnglish (US)
Pages (from-to)268-311
Number of pages44
JournalComputational Linguistics
Volume23
Issue number2
StatePublished - Jun 1997

Fingerprint

Speech processing
Transducers
language
Finite automata
Speech Processing
Language Processing
Strings
Speech recognition
Processing

ASJC Scopus subject areas

  • Language and Linguistics
  • Computational Theory and Mathematics
  • Computer Science Applications
  • Linguistics and Language

Cite this

Finite-State Transducers in Language and Speech Processing. / Mohri, Mehryar.

In: Computational Linguistics, Vol. 23, No. 2, 06.1997, p. 268-311.

Research output: Contribution to journalArticle

@article{760a265fa81e45769ae48c534e84b3ac,
title = "Finite-State Transducers in Language and Speech Processing",
abstract = "Finite-state machines have been used in various domains of natural language processing. We consider here the use of a type of transducer that supports very efficient programs: sequential transducers. We recall classical theorems and give new ones characterizing sequential string-to-string transducers. Transducers that output weights also play an important role in language and speech processing. We give a specific study of string-to-weight transducers, including algorithms for determinizing and minimizing these transducers very efficiently, and characterizations of the transducers admitting determinization and the corresponding algorithms. Some applications of these algorithms in speech recognition are described and illustrated.",
author = "Mehryar Mohri",
year = "1997",
month = "6",
language = "English (US)",
volume = "23",
pages = "268--311",
journal = "Computational Linguistics",
issn = "0891-2017",
publisher = "MIT Press Journals",
number = "2",

}

TY - JOUR

T1 - Finite-State Transducers in Language and Speech Processing

AU - Mohri, Mehryar

PY - 1997/6

Y1 - 1997/6

N2 - Finite-state machines have been used in various domains of natural language processing. We consider here the use of a type of transducer that supports very efficient programs: sequential transducers. We recall classical theorems and give new ones characterizing sequential string-to-string transducers. Transducers that output weights also play an important role in language and speech processing. We give a specific study of string-to-weight transducers, including algorithms for determinizing and minimizing these transducers very efficiently, and characterizations of the transducers admitting determinization and the corresponding algorithms. Some applications of these algorithms in speech recognition are described and illustrated.

AB - Finite-state machines have been used in various domains of natural language processing. We consider here the use of a type of transducer that supports very efficient programs: sequential transducers. We recall classical theorems and give new ones characterizing sequential string-to-string transducers. Transducers that output weights also play an important role in language and speech processing. We give a specific study of string-to-weight transducers, including algorithms for determinizing and minimizing these transducers very efficiently, and characterizations of the transducers admitting determinization and the corresponding algorithms. Some applications of these algorithms in speech recognition are described and illustrated.

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

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

M3 - Article

AN - SCOPUS:0348198473

VL - 23

SP - 268

EP - 311

JO - Computational Linguistics

JF - Computational Linguistics

SN - 0891-2017

IS - 2

ER -