Parsing syllables: modeling OT computationally

Details Parsing syllables: modeling OT computationally Parsing syllables: modeling OT computationally

1997-10-14

arxiv.org/abs/cmp-lg/9710004v1

Computer Science

Computation and Language

22pp, postscript

Scientific paper

In this paper, I propose to implement syllabification in OT as a parser. I propose several innovations that result in a finite and small candidate set. The candidate set problem is handled with several moves: i) MAX and DEP violations are not hypothesized by the parser, ii) candidates are encoded locally, and iii) EVAL is applied constraint by constraint. The parser I propose is implemented in Prolog. It has a number of desirable consequences. First, it runs and thus provides an existence proof that syllabification can be implemented in OT. There are a number of other desirable consequences as well. First, constraints are implemented as finite-state transducers. Second, the parser makes several interesting claims about the phonological properties of so-called nonrecoverable insertions and deletions. Third, the implementation suggests some particular reformulations of some of the benchmark constraints in the OT arsenal, e.g. *COMPLEX, PARSE, ONSET, and NOCODA.

Affiliated with

Also associated with

No associations

Rating

Parsing syllables: modeling OT computationally 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 syllables: modeling OT computationally, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parsing syllables: modeling OT computationally will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-257944