Harmonic grammar with linear programming: From linear systems to linguistic typology
|Abstract||Harmonic Grammar (HG) is a model of linguistic constraint interaction in which well-formedness is calculated as 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 HG framework and comparing the results with those of OT. We describe the translation from Harmonic Grammars to systems solvable by linear programming, and we illustrate the usefulness of OT-Help with a set of studies of the predictions HG makes for phonological typology.|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|External links||This entry has no external links. Add one.|
|Through your library||Only published papers are available at libraries|
Similar books and articles
M. Dolores Jiménez López (2006). A Grammar Systems Approach to Natural Language Grammar. Linguistics and Philosophy 29 (4):419 - 454.
Philippe de Groote & Sylvain Pogodalla (2004). On the Expressive Power of Abstract Categorial Grammars: Representing Context-Free Formalisms. [REVIEW] Journal of Logic, Language and Information 13 (4):421-438.
Michael Benedikt & H. Jerome Keisler (2003). Definability with a Predicate for a Semi-Linear Set. Journal of Symbolic Logic 68 (1):319-351.
Simona Ronchi della Rocca & Luca Roversi (1997). Lambda Calculus and Intuitionistic Linear Logic. Studia Logica 59 (3):417-448.
Simona Ronchi Della Rocca & Luca Roversi (1997). Lambda Calculus and Intuitionistic Linear Logic. Studia Logica 59 (3):417-448.
Richard Wiese (2003). Linear Order and its Place in Grammar. Behavioral and Brain Sciences 26 (6):693-694.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Recent downloads (6 months)0
How can I increase my downloads?