Unsupervised learning of morphology for English and Inuktitut
We describe a simple unsupervised technique for learning morphology by identifying hubs in an automaton. For our purposes, a hub is a node in a graph with in-degree greater than one and out-degree greater than one. We cre-ate a word-trie, transform it into a minimal DFA, then identify hubs. Those hu...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Text |
| Language: | English |
| Subjects: | |
| Online Access: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.451.9886 http://clair.si.umich.edu/clair/HLT-NAACL03/shorts/pdf/hlt_naacl_03_shortpaper_314.pdf |
| Summary: | We describe a simple unsupervised technique for learning morphology by identifying hubs in an automaton. For our purposes, a hub is a node in a graph with in-degree greater than one and out-degree greater than one. We cre-ate a word-trie, transform it into a minimal DFA, then identify hubs. Those hubs mark the boundary between root and suffix, achieving similar performance to more com-plex mixtures of techniques. 1 |
|---|