Parsing syllables: modeling OT computationally
| dc.creator | Hammond, Michael | |
| dc.date | 1997-10-14 | |
| dc.date.accessioned | 2026-07-07T02:36:06Z | |
| dc.date.available | 2026-07-07T02:36:06Z | |
| dc.description | 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. | |
| dc.description | 22pp, postscript | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9710004 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9710004 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/15794 | |
| dc.subject | Computation and Language | |
| dc.title | Parsing syllables: modeling OT computationally | |
| dc.type | text |