In this paper we describe a completely automatic algorithm that builds multiple pronunciation word models by expanding baseform pronunciations with a set of candidate phonological rules. We show how to train the probabilities of these phonological rules, and how to use these probabilities to assign pronunciation probabilities to words not seen in the training corpus. The algorithm wg propose is an instance of the class of techniques we call Exploratory Computational Phonology.
Cite as: Tajchman, G., Foster, E., Jurafsky, D. (1995) Building multiple pronunciation models for novel words using exploratory computational phonology. Proc. 4th European Conference on Speech Communication and Technology (Eurospeech 1995), 2247-2250, doi: 10.21437/Eurospeech.1995-350
@inproceedings{tajchman95_eurospeech,
author={Gary Tajchman and Eric Foster and Daniel Jurafsky},
title={{Building multiple pronunciation models for novel words using exploratory computational phonology}},
year=1995,
booktitle={Proc. 4th European Conference on Speech Communication and Technology (Eurospeech 1995)},
pages={2247--2250},
doi={10.21437/Eurospeech.1995-350}
}