#4726To improve the segmentation accuracy, we use an unsupervised algorithm for automatically acquiring new stems from a155 million word unsegmented corpus, and re-estimate the model parameters with the expanded vocabulary and training corpus.
measure(ment),3-5-P03-1051,ak
<term>
words
</term>
. To improve the
<term>
segmentation accuracy
</term>
, we use an
<term>
unsupervised algorithm
#4711To improve thesegmentation accuracy, we use an unsupervised algorithm for automatically acquiring new stems from a 155 million word unsegmented corpus, and re-estimate the model parameters with the expanded vocabulary and training corpus.
lr,27-2-P03-1051,ak
Arabic word segmenter
</term>
from a
<term>
large unsegmented Arabic corpus
</term>
. The
<term>
algorithm
</term>
uses a
#4667Our method is seeded by a small manually segmented Arabic corpus and uses it to bootstrap an unsupervised algorithm to build the Arabic word segmenter from alarge unsegmented Arabic corpus.
other,17-3-P03-1051,ak
morpheme sequence
</term>
for a given
<term>
input
</term>
. The
<term>
language model
</term>
is
#4689The algorithm uses a trigram language model to determine the most probable morpheme sequence for a giveninput.
lr,34-5-P03-1051,ak
expanded
<term>
vocabulary
</term>
and
<term>
training corpus
</term>
. The resulting
<term>
Arabic word
#4742To improve the segmentation accuracy, we use an unsupervised algorithm for automatically acquiring new stems from a 155 million word unsegmented corpus, and re-estimate the model parameters with the expanded vocabulary andtraining corpus.
other,15-4-P03-1051,ak
segmented corpus
</term>
of about 110,000
<term>
words
</term>
. To improve the
<term>
segmentation
#4706The language model is initially estimated from a small manually segmented corpus of about 110,000words.
other,19-6-P03-1051,ak
test corpus
</term>
containing 28,449
<term>
word tokens
</term>
. We believe this is a state-of-the-art
#4764The resulting Arabic word segmentation system achieves around 97% exact match accuracy on a test corpus containing 28,449word tokens.
other,35-1-P03-1051,ak
denotes zero or more occurrences of a
<term>
morpheme
</term>
) . Our method is seeded by a
<term>
#4637We approximate Arabic's rich morphology by a model that a word consists of a sequence of morphemes in the pattern prefix*-stem-suffix* (* denotes zero or more occurrences of amorpheme).
tech,2-6-P03-1051,ak
training corpus
</term>
. The resulting
<term>
Arabic word segmentation system
</term>
achieves around 97 %
<term>
exact match
#4747The resultingArabic word segmentation system achieves around 97% exact match accuracy on a test corpus containing 28,449 word tokens.
other,32-5-P03-1051,ak
parameters
</term>
with the expanded
<term>
vocabulary
</term>
and
<term>
training corpus
</term>
.
#4740To improve the segmentation accuracy, we use an unsupervised algorithm for automatically acquiring new stems from a 155 million word unsegmented corpus, and re-estimate the model parameters with the expandedvocabulary and training corpus.
lr,6-2-P03-1051,ak
</term>
) . Our method is seeded by a
<term>
small manually segmented Arabic corpus
</term>
and uses it to bootstrap an
<term>
#4646Our method is seeded by asmall manually segmented Arabic corpus and uses it to bootstrap an unsupervised algorithm to build the Arabic word segmenter from a large unsegmented Arabic corpus.
other,2-1-P03-1051,ak
stemmer
</term>
above . We approximate
<term>
Arabic 's rich morphology
</term>
by a model that a
<term>
word
</term>
#4604We approximateArabic 's rich morphology by a model that a word consists of a sequence of morphemes in the pattern prefix*-stem-suffix* (* denotes zero or more occurrences of a morpheme).
tech,9-7-P03-1051,ak
state-of-the-art performance and the
<term>
algorithm
</term>
can be used for many
<term>
highly
#4776We believe this is a state-of-the-art performance and thealgorithm can be used for many highly inflected languages provided that one can create a small manually segmented corpus of the language of interest.
other,11-1-P03-1051,ak
morphology
</term>
by a model that a
<term>
word
</term>
consists of a sequence of
<term>
morphemes
#4613We approximate Arabic's rich morphology by a model that aword consists of a sequence of morphemes in the pattern prefix*-stem-suffix* (* denotes zero or more occurrences of a morpheme).
lr,15-6-P03-1051,ak
<term>
exact match accuracy
</term>
on a
<term>
test corpus
</term>
containing 28,449
<term>
word tokens
#4760The resulting Arabic word segmentation system achieves around 97% exact match accuracy on atest corpus containing 28,449 word tokens.
other,12-3-P03-1051,ak
</term>
to determine the most probable
<term>
morpheme sequence
</term>
for a given
<term>
input
</term>
. The
#4684The algorithm uses a trigram language model to determine the most probablemorpheme sequence for a given input.
tech,9-5-P03-1051,ak
segmentation accuracy
</term>
, we use an
<term>
unsupervised algorithm
</term>
for automatically acquiring new
<term>
#4717To improve the segmentation accuracy, we use anunsupervised algorithm for automatically acquiring new stems from a 155 million word unsegmented corpus, and re-estimate the model parameters with the expanded vocabulary and training corpus.
other,15-5-P03-1051,ak
</term>
for automatically acquiring new
<term>
stems
</term>
from a
<term>
155 million word unsegmented
#4723To improve the segmentation accuracy, we use an unsupervised algorithm for automatically acquiring newstems from a 155 million word unsegmented corpus, and re-estimate the model parameters with the expanded vocabulary and training corpus.
tech,22-2-P03-1051,ak
unsupervised algorithm
</term>
to build the
<term>
Arabic word segmenter
</term>
from a
<term>
large unsegmented Arabic
#4662Our method is seeded by a small manually segmented Arabic corpus and uses it to bootstrap an unsupervised algorithm to build theArabic word segmenter from a large unsegmented Arabic corpus.
other,17-1-P03-1051,ak
word
</term>
consists of a sequence of
<term>
morphemes
</term>
in the
<term>
pattern
</term>
prefix
#4619We approximate Arabic's rich morphology by a model that a word consists of a sequence ofmorphemes in the pattern prefix*-stem-suffix* (* denotes zero or more occurrences of a morpheme).