Inferring Morphological Rules from Small Examples using 0/1 Linear Programming
Paper i proceeding, 2019

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 result is an automatic method for segmentation and labelling that works well even when there is very little training data available.

morpheme segmentation, integer linear programming

Författare

Ann Lillieström

Chalmers, Data- och informationsteknik, Funktionell programmering

Koen Claessen

Chalmers, Data- och informationsteknik, Funktionell programmering

Nicholas Smallbone

Chalmers, Data- och informationsteknik, Funktionell programmering

22nd Nordic Conference on Computational Linguistics (NoDaLiDa)

1650-3686 (ISSN) 1650-3740 (eISSN)

164-174

the 22nd Nordic Conference on Computational Linguistics (NoDaLiDa)
Turku, Finland,

Ämneskategorier

Språkteknologi (språkvetenskaplig databehandling)

Datavetenskap (datalogi)

Mer information

Senast uppdaterat

2019-11-03