UMass Amherst
UMass Amherst | Library | Umail | Spire | People Finder 

Search

Match case Regex

Categories

Creative Commons License
This weblog is licensed under a Creative Commons License.

« Chris Potts Guest Lecture in Computer Science | Main | Undergrad Linguistics Group»

Constraint Weighting and Linear Programming

A truly inter-subdisciplinary group of UMass Amherst linguists met yesterday (April 12), and will meet again at 10:00 am on April 19, to use algorithms and techniques from linear programming to find a general method for determining whether a given pattern of violations marks has a consistent constraint weighting. A preliminary Perl/CGI implementation is described and linked to here. The group has been working slowly but steadily towards a linguistically customized version of the famous simplex algorithm for solving linear systems.