INFERENCE OF STRING MAPPINGS FOR LANGUAGE TECHNOLOGY
Author: Martin Jansche
Publisher: Ohio State University
Publication date: 2003
Number of pages: 284
Format / Quality: pdf
Size: 1,6 MB
Mappings between formal languages play an important role in speech and language processing. This thesis explores issues related to inductive inference or learning of string-to-string mappings. The kinds of mappings considered fall within the larger class of rational transductions realized by finite state machines. Such mappings have applications in speech synthesis, speech recognition, and information retrieval and extraction. The present work takes its examples from speech synthesis, and is in particular concerned with the task of predicting the pronunciation of words from their spelling. When applied to this task, deterministic mappings are also known as letter-to-sound rules.