Finite-State Transducers in Language and Speech Processing

Research output: Contribution to journalArticlepeer-review

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

ASJC Scopus subject areas

  • Language and Linguistics
  • Linguistics and Language
  • Computer Science Applications
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'Finite-State Transducers in Language and Speech Processing'. Together they form a unique fingerprint.

Cite this