Parsing Using Linearly Ordered Phonological Rules

1994/11/08 by Michael Maxwell, Maxwell, Michael
Computer Science · Psychology · #Computation and Language (cs.CL) #FOS: Computer and information sciences #Natural Language Processing Techniques #Phonetics and Phonology Research #Speech and dialogue systems #cmp-lg #cs.CL

paper · pdf · doi:10.48550/arxiv.cmp-lg/9411015

105kb, 12 pages, published in Computational Phonology: First Meeting of the ACL Special Interest Group in Computational Phonology, 1994, pages 59-70

openalex publication_date 1994/11/08 · arxiv created 1994/11/09 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

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.

Related

• The LL(finite) strategy for optimal LL(k) parsing
• Robust stochastic parsing using the inside-outside algorithm
• A General, Sound and Efficient Natural Language Parsing Algorithm based on Syntactic Constraints Propagation
• Linear Parsing Expression Grammars
• Three studies of grammar-based surface-syntactic parsing of unrestricted English text. A summary and orientation