Paper: Automatic Induction Of Finite State Transducers For Simple Phonological Rules

ACL ID P95-1002
Title Automatic Induction Of Finite State Transducers For Simple Phonological Rules
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 1995
Authors

This paper presents a method for learning phonological rules from sample pairs of un- derlying and surface forms, without negative evidence. The learned rules are represented as finite state transducers that accept underlying forms as input and generate surface forms as output. The algorithm for learning them is an extension of the OSTIA algorithm for learn- ing general subsequential finite state transduc- ers. Although OSTIA is capable of learning arbitrary s.-f.s.t's in the limit, large dictionaries of actual English pronunciations did not give enough samples to correctly induce phonolog- ical rules. We then augmented OSTIA with two kinds of knowledge specific to natural lan- guage phonology, biases from "universal gram- mar". One bias is that underlying phones are often realized as phon...