Optimality Theory implements complex functions with simple constraints
Bibliographic Data
| ID | 20399433 |
|---|---|
| Authors | Andrew Lamont (0000-0002-8395-2212, University of Massachusetts Amherst, corresponding author) |
| Year | 2021 |
| Volume | 38 |
| Issue | 4 |
| Pages | 729-740 |
| Publication date | 2021-11-01 |
| Open Access | Yes |
| Type | ARTICLE |
| Venue | Phonology (JOURNAL) |
| Journal identifiers | ISSN: 0952-6757 • E-ISSN: 1469-8188 |
| Publisher | Cambridge University Press (CUP) (PUBLISHER) |
| DOI | 10.1017/s0952675721000361 |
| OpenAlex | W4213058799 |
| Language | EN |
| References cited | 15 |
While attested phonological mappings appear to be regular, Optimality Theory is known to implement more complex functions. This squib contributes to the computational characterisation of Optimality Theory by constructing a grammar that implements a non-pushdown function. By using only simple, familiar constraints, the result suggests that a large proportion of optimality-theoretic grammars are more powerful than necessary as models of phonology
Grammar · Linguistics · Optimality theory · Phonology · Rule-based machine translation · Computer Science · Mathematics · Natural Language Processing Techniques · Phonetics and Phonology Research · Speech Recognition and Synthesis · Artificial Intelligence · Theoretical Computer Science
| Highly cited | No |
|---|