other,5-2-N03-2015,bq |
automaton
</term>
. For our purposes , a
<term>
|
hub
|
</term>
is a
<term>
node
</term>
in a
<term>
graph
|
#3174
For our purposes, ahub is a node in a graph with in-degree greater than one and out-degree greater than one. |
other,3-3-N03-2015,bq |
</term>
greater than one . We create a
<term>
|
word-trie
|
</term>
, transform it into a
<term>
minimal
|
#3195
We create aword-trie, transform it into a minimal DFA, then identify hubs. |
other,11-2-N03-2015,bq |
hub
</term>
is a
<term>
node
</term>
in a
<term>
|
graph
|
</term>
with
<term>
in-degree
</term>
greater
|
#3180
For our purposes, a hub is a node in agraph with in-degree greater than one and out-degree greater than one. |
other,9-3-N03-2015,bq |
word-trie
</term>
, transform it into a
<term>
|
minimal DFA
|
</term>
, then identify
<term>
hubs
</term>
.
|
#3201
We create a word-trie, transform it into aminimal DFA, then identify hubs. |
other,8-2-N03-2015,bq |
our purposes , a
<term>
hub
</term>
is a
<term>
|
node
|
</term>
in a
<term>
graph
</term>
with
<term>
in-degree
|
#3177
For our purposes, a hub is anode in a graph with in-degree greater than one and out-degree greater than one. |
tech,14-1-N03-2015,bq |
identifying
<term>
hubs
</term>
in an
<term>
|
automaton
|
</term>
. For our purposes , a
<term>
hub
</term>
|
#3167
We describe a simple unsupervised technique for learning morphology by identifying hubs in anautomaton. |
other,18-2-N03-2015,bq |
in-degree
</term>
greater than one and
<term>
|
out-degree
|
</term>
greater than one . We create a
<term>
|
#3187
For our purposes, a hub is a node in a graph with in-degree greater than one andout-degree greater than one. |
other,8-4-N03-2015,bq |
boundary between
<term>
root
</term>
and
<term>
|
suffix
|
</term>
, achieving similar
<term>
performance
|
#3216
Those hubs mark the boundary between root andsuffix, achieving similar performance to more complex mixtures of techniques. |
other,6-4-N03-2015,bq |
hubs
</term>
mark the boundary between
<term>
|
root
|
</term>
and
<term>
suffix
</term>
, achieving
|
#3214
Those hubs mark the boundary betweenroot and suffix, achieving similar performance to more complex mixtures of techniques. |
other,14-3-N03-2015,bq |
<term>
minimal DFA
</term>
, then identify
<term>
|
hubs
|
</term>
. Those
<term>
hubs
</term>
mark the
|
#3206
We create a word-trie, transform it into a minimal DFA, then identifyhubs. |
other,11-1-N03-2015,bq |
<term>
morphology
</term>
by identifying
<term>
|
hubs
|
</term>
in an
<term>
automaton
</term>
. For
|
#3164
We describe a simple unsupervised technique for learning morphology by identifyinghubs in an automaton. |
other,8-1-N03-2015,bq |
unsupervised technique
</term>
for learning
<term>
|
morphology
|
</term>
by identifying
<term>
hubs
</term>
in
|
#3161
We describe a simple unsupervised technique for learningmorphology by identifying hubs in an automaton. |
other,12-4-N03-2015,bq |
<term>
suffix
</term>
, achieving similar
<term>
|
performance
|
</term>
to more complex mixtures of techniques
|
#3220
Those hubs mark the boundary between root and suffix, achieving similarperformance to more complex mixtures of techniques. |
tech,4-1-N03-2015,bq |
model
</term>
. We describe a simple
<term>
|
unsupervised technique
|
</term>
for learning
<term>
morphology
</term>
|
#3157
We describe a simpleunsupervised technique for learning morphology by identifying hubs in an automaton. |
other,1-4-N03-2015,bq |
then identify
<term>
hubs
</term>
. Those
<term>
|
hubs
|
</term>
mark the boundary between
<term>
root
|
#3209
Thosehubs mark the boundary between root and suffix, achieving similar performance to more complex mixtures of techniques. |
other,13-2-N03-2015,bq |
node
</term>
in a
<term>
graph
</term>
with
<term>
|
in-degree
|
</term>
greater than one and
<term>
out-degree
|
#3182
For our purposes, a hub is a node in a graph within-degree greater than one and out-degree greater than one. |