Automatic Baseform Production From Spellings
Original Publication Date: 1984-Sep-01
Included in the Prior Art Database: 2005-Feb-04
A novel method for solving the problem of automatically generating correct baseforms from English spellings is described. The problem is difficult because of the ambiguity of the English spelling system. (Image Omitted) The invention is constructed as shown above. In this implementation, English spellings can be input singly or in lists, and a set of heuristically-derived rules is applied to them by the program SPTPHON -- which is a modification of the program TPHON . The output baseform graphs may be used as is, or may undergo further transformations for the purpose of handling lower-level phonological alternatives. In either event, the output graphs are in a form able to be trained by appropriate dynamic programming methods  for use in, e.g., automatic speech recognition.