Ann Lillieström
Chalmers University of Technology, Gothenburg, Sweden
Koen Claessen
Chalmers University of Technology, Gothenburg, Sweden
Nicholas Smallbone
Chalmers University of Technology, Gothenburg, Sweden
Ladda ner artikel
Ingår i: Proceedings of the 22nd Nordic Conference on Computational Linguistics (NoDaLiDa), September 30 - October 2, Turku, Finland
Linköping Electronic Conference Proceedings 167:18, s. 164--174
NEALT Proceedings Series 42:18, p. 164--174
Publicerad: 2019-10-02
ISBN: 978-91-7929-995-8
ISSN: 1650-3686 (tryckt), 1650-3740 (online)
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.
Inga referenser tillgängliga
