Those
<term>
hubs
</term>
mark the boundary between
<term>
root
</term>
and
<term>
suffix
</term>
, achieving similar performance to more complex mixtures of techniques .
#3217Those hubs mark the boundary between root andsuffix, achieving similar performance to more complex mixtures of techniques.
other,9-3-N03-2015,ak
We create a
<term>
word-trie
</term>
, transform it into a
<term>
minimal DFA
</term>
, then identify
<term>
hubs
</term>
.
#3202We create a word-trie, transform it into aminimal DFA, then identify hubs.
other,3-3-N03-2015,ak
We create a
<term>
word-trie
</term>
, transform it into a
<term>
minimal DFA
</term>
, then identify
<term>
hubs
</term>
.
#3196We create aword-trie, transform it into a minimal DFA, then identify hubs.
tech,14-1-N03-2015,ak
We describe a simple
<term>
unsupervised technique
</term>
for learning
<term>
morphology
</term>
by identifying
<term>
hubs
</term>
in an
<term>
automaton
</term>
.
#3168We describe a simple unsupervised technique for learning morphology by identifying hubs in anautomaton.
other,14-3-N03-2015,ak
We create a
<term>
word-trie
</term>
, transform it into a
<term>
minimal DFA
</term>
, then identify
<term>
hubs
</term>
.
#3207We create a word-trie, transform it into a minimal DFA, then identifyhubs.
other,6-4-N03-2015,ak
Those
<term>
hubs
</term>
mark the boundary between
<term>
root
</term>
and
<term>
suffix
</term>
, achieving similar performance to more complex mixtures of techniques .
#3215Those hubs mark the boundary betweenroot and suffix, achieving similar performance to more complex mixtures of techniques.
other,8-1-N03-2015,ak
We describe a simple
<term>
unsupervised technique
</term>
for learning
<term>
morphology
</term>
by identifying
<term>
hubs
</term>
in an
<term>
automaton
</term>
.
#3162We describe a simple unsupervised technique for learningmorphology by identifying hubs in an automaton.
tech,4-1-N03-2015,ak
We describe a simple
<term>
unsupervised technique
</term>
for learning
<term>
morphology
</term>
by identifying
<term>
hubs
</term>
in an
<term>
automaton
</term>
.
#3158We describe a simpleunsupervised technique for learning morphology by identifying hubs in an automaton.
other,13-2-N03-2015,ak
For our purposes , a
<term>
hub
</term>
is a
<term>
node
</term>
in a
<term>
graph
</term>
with
<term>
in-degree
</term>
greater than one and
<term>
out-degree
</term>
greater than one .
#3183For our purposes, a hub is a node in a graph within-degree greater than one and out-degree greater than one.
other,18-2-N03-2015,ak
For our purposes , a
<term>
hub
</term>
is a
<term>
node
</term>
in a
<term>
graph
</term>
with
<term>
in-degree
</term>
greater than one and
<term>
out-degree
</term>
greater than one .
#3188For our purposes, a hub is a node in a graph with in-degree greater than one andout-degree greater than one.
other,8-2-N03-2015,ak
For our purposes , a
<term>
hub
</term>
is a
<term>
node
</term>
in a
<term>
graph
</term>
with
<term>
in-degree
</term>
greater than one and
<term>
out-degree
</term>
greater than one .
#3178For our purposes, a hub is anode in a graph with in-degree greater than one and out-degree greater than one.
other,11-1-N03-2015,ak
We describe a simple
<term>
unsupervised technique
</term>
for learning
<term>
morphology
</term>
by identifying
<term>
hubs
</term>
in an
<term>
automaton
</term>
.
#3165We describe a simple unsupervised technique for learning morphology by identifyinghubs in an automaton.
other,5-2-N03-2015,ak
For our purposes , a
<term>
hub
</term>
is a
<term>
node
</term>
in a
<term>
graph
</term>
with
<term>
in-degree
</term>
greater than one and
<term>
out-degree
</term>
greater than one .
#3175For our purposes, ahub is a node in a graph with in-degree greater than one and out-degree greater than one.
other,1-4-N03-2015,ak
Those
<term>
hubs
</term>
mark the boundary between
<term>
root
</term>
and
<term>
suffix
</term>
, achieving similar performance to more complex mixtures of techniques .
#3210Thosehubs mark the boundary between root and suffix, achieving similar performance to more complex mixtures of techniques.
other,11-2-N03-2015,ak
For our purposes , a
<term>
hub
</term>
is a
<term>
node
</term>
in a
<term>
graph
</term>
with
<term>
in-degree
</term>
greater than one and
<term>
out-degree
</term>
greater than one .
#3181For our purposes, a hub is a node in agraph with in-degree greater than one and out-degree greater than one.