Parsing Using Linearly Ordered Phonological Rules

Details Parsing Using Linearly Ordered Phonological Rules Parsing Using Linearly Ordered Phonological Rules

1994-11-08

arxiv.org/abs/cmp-lg/9411015v2

Computer Science

Computation and Language

105kb, 12 pages, published in Computational Phonology: First Meeting of the ACL Special Interest Group in Computational Phonol

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Parsing Using Linearly Ordered Phonological Rules does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Parsing Using Linearly Ordered Phonological Rules, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parsing Using Linearly Ordered Phonological Rules will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-229970