2026-09-19T10:24:56Zhttps://digital.lib.washington.edu/server/oai/request

oai:digital.lib.washington.edu:1773/224532025-01-07T20:56:05Zcom_1773_4888col_1773_4936

Levow, Gina-Anne Lushtak, Sergei A. 2013-04-17T17:57:50Z 2013-04-17T17:57:50Z 2013-04-17 2012 Lushtak_washington_0250O_11149.pdf http://hdl.handle.net/1773/22453 Thesis (Master's)--University of Washington, 2012 This thesis describes a system which clusters the words of a given lexicon into conflation sets (sets of morphologically related words). The word clustering is based on clustering of suffixes, which, in turn, is based on stem-suffix co-occurrence frequencies. The suffix clustering is performed as a clique clustering of a weighted undirected graph with the suffixes as vertices; the edges weights are calculated as similarity measure between the suffix signatures of the vertices according to the proposed metric. The clustering that yields the lowest lexicon compression ratio is considered the optimum. In addition, the hypothesis that the lowest compression ratio suffix clustering yields the best word clustering is tested. The system is tested on the CELEX English, German and Dutch lexicons and its performance is evaluated against the set of conflation classes extracted from the CELEX morphological database (Baayen, et al., 1993). The system performance is compared to that of other systems: Morfessor (Creutz and Lagus, 2005), Linguistica (Goldsmith, 2000), and χ^2 - significance test based word clustering approach (Moon et al., 2009). application/pdf en_US Copyright is held by the individual authors. acquisition; clustering; computational; conflation; morphology; unsupervised Linguistics Computer science linguistics Unsupervised Morphological Word Clustering Thesis No embargo open.access