Parsing Using Linearly Ordered Phonological Rules

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.Comment: 105kb, 12 pages, published in Computational Phonology: First Meeting of the ACL Special Interest Group in Computational Phonology, 1994, pages 59-7

Parsing Using Linearly Ordered Phonological Rules

described which parses a surface form into one or more lexical entries using linearly ordered phonelogical 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 spe, exl compares favorably with that of a KIMMO-type parser

PARSING USING LINEARLY ORDERED PHONOLOGICAL RULES

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. 1