<?xml version="1.0" standalone="yes"?>
<Paper uid="N03-2015">
  <Title>Unsupervised Learning of Morphology for English and Inuktitut</Title>
  <Section position="1" start_page="0" end_page="0" type="abstr">
    <SectionTitle>
Abstract
</SectionTitle>
    <Paragraph position="0"> 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.</Paragraph>
  </Section>
class="xml-element"></Paper>