Inferring morphological rules from small examples using 0/1 linear programming

Abstract

We show how to express the problem of finding an optimal morpheme segmentation from a set of labelled words as a 0/1 linear programming problem, and how to build on this to analyse a language’s morphology. The approach works even when there is very little training data available.

Tasks

Reproductions