other,12-2-P06-2001,bq little <term> corpus </term> of 100,000 <term> words </term> , the system guesses correctly not
measure(ment),29-2-P06-2001,bq <term> precision </term> of 96 % and a <term> recall </term> of 98 % . It also gets a <term> precision
measure(ment),10-3-P06-2001,bq <term> precision </term> of 70 % and a <term> recall </term> of 49 % in the task of placing <term>
tech,15-1-P06-2001,bq learning techniques </term> to build a <term> comma checker </term> to be integrated in a <term> grammar
measure(ment),4-3-P06-2001,bq recall </term> of 98 % . It also gets a <term> precision </term> of 70 % and a <term> recall </term> of
tech,22-1-P06-2001,bq checker </term> to be integrated in a <term> grammar checker </term> for <term> Basque </term> . After several
measure(ment),23-2-P06-2001,bq not placing <term> commas </term> with a <term> precision </term> of 96 % and a <term> recall </term> of
lr,27-4-P06-2001,bq </term> to train , that is , a bigger <term> corpus </term> written by one unique <term> author
other,25-1-P06-2001,bq in a <term> grammar checker </term> for <term> Basque </term> . After several experiments , and
lr,18-4-P06-2001,bq using a bigger and a more homogeneous <term> corpus </term> to train , that is , a bigger <term>
lr,9-2-P06-2001,bq experiments , and trained with a little <term> corpus </term> of 100,000 <term> words </term> , the
other,20-2-P06-2001,bq system guesses correctly not placing <term> commas </term> with a <term> precision </term> of 96
other,19-3-P06-2001,bq </term> of 49 % in the task of placing <term> commas </term> . Finally , we have shown that these
other,32-4-P06-2001,bq corpus </term> written by one unique <term> author </term> . This paper presents an <term> unsupervised
tech,9-1-P06-2001,bq paper , we describe the research using <term> machine learning techniques </term> to build a <term> comma checker </term>
hide detail