Hostname: page-component-5d84bcc8dc-7cdz5 Total loading time: 0 Render date: 2026-08-13T10:15:03.550Z Has data issue: false hasContentIssue false

Harmonic Grammar with linear programming: from linear systems to linguistic typology*

Published online by Cambridge University Press:  16 April 2010

Christopher Potts
Affiliation:
Stanford University
Joe Pater
Affiliation:
University of Massachusetts, Amherst
Karen Jesney
Affiliation:
University of Massachusetts, Amherst
Rajesh Bhatt
Affiliation:
University of Massachusetts, Amherst
Michael Becker
Affiliation:
Harvard University

Abstract

Harmonic Grammar is a model of linguistic constraint interaction in which well-formedness is calculated in terms of the sum of weighted constraint violations. We show how linear programming algorithms can be used to determine whether there is a weighting for a set of constraints that fits a set of linguistic data. The associated software package OT-Help provides a practical tool for studying large and complex linguistic systems in the Harmonic Grammar framework and comparing the results with those of OT. We first describe the translation from harmonic grammars to systems solvable by linear programming algorithms. We then develop a Harmonic Grammar analysis of ATR harmony in Lango that is, we argue, superior to the existing OT and rule-based treatments. We further highlight the usefulness of OT-Help, and the analytic power of Harmonic Grammar, with a set of studies of the predictions Harmonic Grammar makes for phonological typology.

Information

Type
Articles
Copyright
Copyright © Cambridge University Press 2010

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable