no code implementations • WS (NoDaLiDa) 2019 • Ann Lillieström, Koen Claessen, Nicholas Smallbone
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.
no code implementations • LREC 2016 • Inari Listenmaa, Koen Claessen
We describe a method for analysing Constraint Grammars (CG) that can detect internal conflicts and redundancies in a given grammar, without the need for a corpus.