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 create 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 complex mixtures of techniques.

• Type: Conference
• Year: 2003
• Where: NAACL
• Authors: Howard Johnson, Joel D. Martin
• Keywords: Complex Mixtures, Minimal Dfa, NAACL 2003, NAACL 2007, Simple Unsupervised Technique