Computing Long-Distance Dependencies in Vowel Harmony

Abstract

This article develops an explicit procedural model of vowel harmony, and takes steps toward finding a lower bound on the computational power of phonological rules. The focus on formalization and procedural computation allows for simplification in models of representation and the discovery of interesting interactions involving the conditions in rules. It is shown that locality principles are derivable, which motivates the elimination of iterative rule application advocated here. Along the way, a novel analysis of neutral vowels in harmony processes is also provided.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 119 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.