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