lr,21-5-P03-1051,bq from a 155 million <term> word </term><term> unsegmented corpus </term> , and re-estimate the <term> model
measure(ment),4-5-P03-1051,bq improve the <term> segmentation </term><term> accuracy </term> , we use an <term> unsupervised algorithm
lr,28-2-P03-1051,bq word segmenter </term> from a large <term> unsegmented Arabic corpus </term> . The <term> algorithm </term> uses a
other,17-3-P03-1051,bq morpheme sequence </term> for a given <term> input </term> . The <term> language model </term> is
lr,34-5-P03-1051,bq expanded <term> vocabulary </term> and <term> training corpus </term> . The resulting <term> Arabic word
other,15-4-P03-1051,bq segmented corpus </term> of about 110,000 <term> words </term> . To improve the <term> segmentation
other,19-6-P03-1051,bq test corpus </term> containing 28,449 <term> word tokens </term> . We believe this is a state-of-the-art
other,21-1-P03-1051,bq morphemes </term> in the <term> pattern </term><term> prefix * - stem-suffix * </term> ( * denotes zero or more occurrences
other,35-1-P03-1051,bq denotes zero or more occurrences of a <term> morpheme </term> ) . Our method is seeded by a small
tech,3-5-P03-1051,bq <term> words </term> . To improve the <term> segmentation </term><term> accuracy </term> , we use an <term>
tech,2-6-P03-1051,bq training corpus </term> . The resulting <term> Arabic word segmentation system </term> achieves around 97 % <term> exact match
other,32-5-P03-1051,bq parameters </term> with the expanded <term> vocabulary </term> and <term> training corpus </term> .
lr,7-2-P03-1051,bq . Our method is seeded by a small <term> manually segmented Arabic corpus </term> and uses it to bootstrap an <term>
other,2-1-P03-1051,bq stemmer </term> above . We approximate <term> Arabic 's rich morphology </term> by a <term> model </term> that a <term>
tech,9-7-P03-1051,bq state-of-the-art performance and the <term> algorithm </term> can be used for many <term> highly
other,11-1-P03-1051,bq </term> by a <term> model </term> that a <term> word </term> consists of a sequence of <term> morphemes
lr,15-6-P03-1051,bq <term> exact match accuracy </term> on a <term> test corpus </term> containing 28,449 <term> word tokens
other,12-3-P03-1051,bq </term> to determine the most probable <term> morpheme sequence </term> for a given <term> input </term> . The
tech,9-5-P03-1051,bq </term><term> accuracy </term> , we use an <term> unsupervised algorithm </term> for automatically acquiring new <term>
other,15-5-P03-1051,bq </term> for automatically acquiring new <term> stems </term> from a 155 million <term> word </term>
hide detail