Finite-State Transducers in Language and Speech Processing

DMCA

Finite-State Transducers in Language and Speech Processing (1997)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Mehryar Mohri

Venue:	Computational Linguistics
Citations:	392 - 42 self

BibTeX

@ARTICLE{Mohri97finite-statetransducers,
    author = {Mehryar Mohri},
    title = {Finite-State Transducers in Language and Speech Processing},
    journal = {Computational Linguistics},
    year = {1997},
    volume = {23},
    pages = {269--311}
}

OpenURL

Abstract

Finite-state machines have been used in various domains of natural language processing. We consider here the use of a type of transducers that supports very efficient programs: sequential transducers. We recall classical theorems and give new ones characterizing sequential string-tostring 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. 1.

Keyphrases

speech processing finite-state transducer important role new one corresponding algorithm speech recognition sequential string-tostring transducer string-to-weight transducer classical theorem efficient program finite-state machine natural language processing specific study various domain output weight sequential transducer

DMCA