A generate and test algorithm is described which parses a surface form into one or more lexical entries using linearly ordered phonological rules. This algorithm avoids the exponential expansion of search space which a naive parsing algorithm would face by encoding into the form being parsed the ambiguities which arise during parsing. The algorithm has been implemented and tested on real language data, and its speed compares favorably with that of a KIMMO-type parser.
- Pub Date:
- November 1994
- Computer Science - Computation and Language
- 105kb, 12 pages, published in Computational Phonology: First Meeting of the ACL Special Interest Group in Computational Phonology, 1994, pages 59-70