DMCA
An Efficient Implementation of Phonological Rules using Finite-State Transducers (2001)
Cached
Download Links
| Citations: | 36 - 5 self |
BibTeX
@MISC{Hetherington01anefficient,
author = {I. Lee Hetherington and Using Finite-state Transducers},
title = {An Efficient Implementation of Phonological Rules using Finite-State Transducers},
year = {2001}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Context-dependent phonological rules are used to model the mapping from phonemes to their varied phonetic surface realizations. Others, most notably Kaplan and Kay, have described how to compile general context-dependent phonological rewrite rules into finite-state transducers. Such rules are very powerful, but their compilation is complex and can result in very large nondeterministic automata. In this paper we present a simplified rewrite rule system and a technique to efficiently compile such a system into finite-state transducers.
