<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Testing a Statistical Word Stemmer based on Axality Measurements in INEX 2012 Tweet Contextualization Track</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Carlos-Francisco MØndez-Cruz</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Edmundo-Pavel Soriano-Morales</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Alfonso Medina-Urrea</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>El Colegio de MØxico A.C.</institution>
          ,
          <addr-line>MØxico</addr-line>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>GIL-Instituto de Ingeniera UNAM</institution>
          ,
          <addr-line>MØxico</addr-line>
        </aff>
      </contrib-group>
      <abstract>
        <p>This paper presents an experiment of statistical word stemming based on axality measurements. These measurements quantify three characteristics of language. In this experiment we tested one strategy of stemming with three dierent sizes of training data. The developed stemmer was used by the automatic summarization system Cortex to preprocess input texts and produce readable summaries. All summaries were evaluated as part of the INEX 2012 Tweet Contextualization Track. We present the results of evaluation and a discussion about our stemming strategy.</p>
      </abstract>
      <kwd-group>
        <kwd>INEX</kwd>
        <kwd>Automatic summarization system</kwd>
        <kwd>Axality Measurements</kwd>
        <kwd>Morphological Segmentation</kwd>
        <kwd>Statistical Stemming</kwd>
        <kwd>CORTEX</kwd>
        <kwd>Tweet Contextualization</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>The task proposed in the INEX 2012 Tweet Contextualization Track consists in
obtaining some textual context from the English Wikipedia about the subject
of a tweet. The nal contextualization of the tweet should take the form of a
readable summary of 500 words. An amount of 1133 documents, contextualized
tweets with text from Wikipedia from November 2011, were processed in order
to obtained summaries. Bibliographic references an empty Wikipedia pages were
omitted.</p>
      <p>
        The evaluation of summaries was done by the INEX organizers taking into
account informativeness and readability. The former was obtained using
KullbackLeibler divergence with Dirichlet smoothing by comparing n-gram distributions.
The latter was accomplished by the participants in the track; they evaluated the
summaries taking into account syntax, anaphoric resolution and redundancy.
More details of the system of evaluation and the INEX 2012 Tweet
Contextualization Track could be found in [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <p>For this track we developed a stemmer based on morphological segmentation.
The stemmer was coupled with Cortex, an automatic summarization system,
in order to generate the summaries. We tested three sizes of training corpora to
determine the best option for statistical stemming for English.</p>
      <p>The organization of this paper is as follows: in Section 2 we review some
approaches of morphological segmentation; in Section 3 we present word
stemming; in Section 4 we describe the axality measurements; Section 5 presents
the stemming strategy; evaluation obtained in INEX track is expose in Section
6 and nally, in Section 7, we briey present our conclusions and future work.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Morphological Segmentation</title>
      <p>
        The rst work for unsupervised discovery of morphological units of language
is due to Zellig Harris [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. His method, commonly known as frequent
successor, consists in counting dierent letters or symbols before and after a possible
morphological boundary. As more dierent symbols, the probability of a true
morphological cut increases. This approach shown, among other things, that
uncertainty is a well clue for morphological segmentation.
      </p>
      <p>
        Now a day, one of the most utilized methods for unsupervised learning of
morphology is based on Minimum Description Length (MDL) approach. This
has been developed as a computational system called Linguistica [
        <xref ref-type="bibr" rid="ref3 ref4">3, 4</xref>
        ].1 This
method tries to obtain a lexicon of morphs inferred from a corpus. The best
lexicon is the one that has the less redundancy, i.e. when the description length
of the data is the lowest. Also, this utilizes some combinatorial structures called
signatures in order to improve segmentation. This method has been employed
for stemming work in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. In that paper the developed stemmer was utilized for
an information retrieval task instead of summarization.
      </p>
      <p>The mission of preprocessing documents for tasks of NLP, such as Question
Answering, Information Retrieval or Automatic Text Summarization, in
agglutinative languages is more complex. This is due to the fact that agglutinative
languages have numerous combinations of morphs rather than a simple
prexstem-sux combination. A method of unsupervised morphological segmentation
for these kinds of languages is called Morfessor [69]. 2 This approach uses MDL
by Maximum a Posteriori framework. Also, it integrates a morphotactic analysis
to represent each word by a Hidden Markov Model (HMM). We are not sure if
this method has been used for word stemming.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Word stemming</title>
      <p>The majority of NLP systems preprocesses documents in order to decrease the
Vector Space Model representation. This is the case of Cortex, which will be
explained below. A well-known strategy for that purpose is word stemming, i.e.
1 http://linguistica.uchicago.edu
2 http://www.cis.hut./projects/morpho/
truncating words by eliminating the inection. Also, it is possible to remove
derivational axes.</p>
      <p>
        The methods most widely used for word stemming are created by means
of hand-made rules, like [
        <xref ref-type="bibr" rid="ref10 ref11">10, 11</xref>
        ]. These kinds of stemmers have been
successfully applied for European languages. However, languages with more complex
morphology than English, such as agglutinative ones, need unsupervised
morphological strategies in order to deal with language complexity.
      </p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] a review of stemming methods is presented. The variety of stemming
approaches includes: distance function to measure an orthographical similarity
[
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], directed graphs [
        <xref ref-type="bibr" rid="ref14 ref5">14, 5</xref>
        ], and frequency of n-grams of letters [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]. Moreover,
there are some works about stemming evaluation in information retrieval tasks,
for example [
        <xref ref-type="bibr" rid="ref16 ref17">16, 17</xref>
        ].
4
      </p>
    </sec>
    <sec id="sec-4">
      <title>Axality Measurements</title>
      <p>
        The axality measurements used to morphological segmentation were proposed
for Spanish in [
        <xref ref-type="bibr" rid="ref18 ref19">18, 19</xref>
        ]. These measurements have been also applied to Czech [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ],
and to the Amerindian Languages Chuj and Tarahumara [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ]. This approach lies
on the linguistic idea that there is a force between segments of a word (morphs)
called axality. If we can quantify this axality, we can expect some peaks
where morphological cuts are possible. In next sections we present the way to
calculate these measurements.
4.1
      </p>
      <p>
        Entropy
As we said above, Harris’s approach revealed that uncertainty helps to
morphological segmentation. This uncertainty could be seen as the Shannon’s concept
of information content (entropy) [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ]. To calculate the entropy of a possible
segmentation, given ai;j ::bi;j as a word segmentation, and Bi;j as a set of all
segments combined with ai;j , we can used the formula:
      </p>
      <p>H (ai;j :: Bi;j ) =</p>
      <p>X p (bk;j )
log2 (p (bk;j ))
(1)
where k = 1; 2; 3; : : : jBi;j j and each bk;j 2 Bi;j . For our purpose we tested
peaks of entropy from right to left in order to discover suxes.
4.2</p>
      <p>
        Economy Principle
The Economy Principle could be understood as follows: fewer units at one level
of language are combined in order to create a great number of other units at the
next level. Taking advantage of this principle, we can dene a stem as a word
segment that belong to a big set of relatively infrequent units, and axes as word
segments that belong to a small set of frequent ones. In [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ] a quantication of
this economy was suggested, however, we present a reformulation. Given a word
segmentation ai;j ::bi;j , the economy of a segmentation is calculated depending
on type of morph hypothesized:
      </p>
      <p>p
Ki;j = 1
jAi;j j
jBis;j j</p>
      <p>p
jAi;j j ;</p>
      <p>Kis;j = 1
jBi;j j</p>
      <p>jBis;j j
p
jAi;j j
(2)
where Ai;j is the set of segments which alternate with bi;j (ai;j 2 Ai;j ), and
p
Bi;j a set of segments which alternate with ai;j (bi;j 2 Bi;j ). Also, let Ai;j be
the set of segments which are likely prexes, and Bis;j the set of segments which
are likely suxes.
4.3</p>
      <p>
        Numbers of Squares
Joseph Greenberg [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ] proposed the concept of square when four expressions of
language, let say A, B, C, D, are combined to form AC, BC, AD, and BD. Hence,
we set ci;j as a number of squares found in segment j of the word i.
5
      </p>
    </sec>
    <sec id="sec-5">
      <title>Stemming Strategy</title>
      <p>The axality of all possible segmentations within a word is estimated by an
average of normalized values of the three explained measurements:
AF n (sx) =
cx=max ci + kx=max ki + hx=max hi
3
(3)</p>
      <p>
        To calculate this axality, a training corpus of raw text is required. In this
track we use three dierent sizes of 100k, 200k, and 500k word tokens. With an
index of axality calculated for each possible word segment, it is possible to
choose a strategy for morphological segmentation; for example [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ] propounded
four strategies.
      </p>
      <p>In this experiment we use a peak-valley strategy for segmentation. Given a
set of axality indexes inside a word afik, let afik 1 &lt; afik &gt; afik+1 be a peak
of axality from left to right, where k is the length of the word plus one (the
ending of the word). The main disadvantage of this approach is that small peaks
are taking into account generating oversegmentation.</p>
      <p>Regarding stemming, we truncate words at most left peak of axality. For a
language with scare morphology like English, we can imagine that a most right
peak of axality could be sucient for stemming. However, in order to improve
Cortex summarization, we decide to strongly conate words by a left-peak
strategy. Next section explains CORTEX’s approach.
5.1</p>
      <p>Cortex Summarizer
As we mentioned before, Cortex is an automatic text summarizer system. A
wide explanation of this summarizer could be found in [2529]. Here, we briey
describe some relevant aspects. First, Cortex represents input documents in
Vector Space Model. To do that, the documents should be preprocessed.
Actually, we incorporate our stemmer in this step.</p>
      <p>After preprocessing, a frequency matrix is generated representing the
presence and absence of words (terms) in a sentence:</p>
      <p>Finally, a decision algorithm combines those metrics to score sentences. Two
averages are calculated, &gt; 0:5, and &lt; 0:5 ( = 0:5 is ignored):
X
=</p>
      <p>X
=1
k k&gt;0:5
w
w
w
w
0:5 ; X
=
0:5
w
w
w
w</p>
      <p>(6)
X
=1
k k&lt;0:5
The next expression is used to calculate the score of each sentence:
If</p>
      <p>X
&gt; X</p>
      <p>!
then
= 0:5 +</p>
      <p>P
else
= 0:5</p>
      <p>P</p>
      <p>Cortex sorts nal sentences by using ; = 1; ; P . Additionally,
Cortex let us delimit a compression rate, which was xed at 500 words.
6</p>
    </sec>
    <sec id="sec-6">
      <title>Experiments and Results</title>
      <p>6.1</p>
      <p>Design of Experiments
We made use of three sizes of training corpora, 100K, 200K, and 500K word
tokens, to test our stemmer. With these sizes we performed the three runs for
INEX track. The assigned numbers of runs were 153 (100K), 154 (200K), and
155 (500K). The corpus for evaluation was the 1133 contextualized tweets with
text from Wikipedia from November 2011. About training corpora, we selected
24 documents from the same contextualized tweets.
6.2</p>
      <p>Results
For informativeness, Cortex, coupled with our stemmer, obtained rank 12, 14,
and 15. Average scores of informativeness are shown in Table 1. The best run in
this evaluation was run 154 (200K).
In this paper we reported an experiment using a stemmer based on morphological
segmentation. We used axality measurements in order to segment words. This
stemmer was coupled with Cortex, an automatic summarization system.</p>
      <p>We suggested the next stemming strategy: given some peaks of axality of a
word, we truncated at most left peak. Also, we tested three training corpus sizes
to obtain statistical information for the axality indexes: 100K, 200K, and 500K
word tokens. Our two goals were to know if our stemming strategy can produce
readable summaries, and if dierent sizes of training corpora can improve the
Cortex performance.</p>
      <p>According to results of evaluation, our stemming strategy produces not only
readable summaries but also competitive ones. That is, from an average of
relevance, syntax, and structure (0.6148), run 155 obtained a rank 7 among 27 runs.
What is more, concerning informativeness, run 154 obtained rank 12 among 33
participants.</p>
      <p>Regarding corpus sizes, it is not clear what size is the best for English,
between 200K and 500K word tokens. However, it is clear that increasing corpus
size is a good strategy because 100K obtained the worst results. Additionally, a
greater training corpus gives better position in the ranking, for example, from
an average of relevance, syntax, and structure, run 155 (500K) obtained rank 7
and run 153 (100K) obtained rank 15.</p>
      <p>In future experiments we will test dierent strategies for morphological
segmentation and stemming. Additionally, we can test dierent stemming approaches,
such as Porter’s stemmer.
28. Torres-Moreno, J.M., Velazquez-Moralez, P., Meunier, J.: CORTEX, un algorithme
pour la condensation automatique de textes. In: ARCo. Volume 2. (2005) 365
29. Torres-Moreno, J.M., Velazquez-Morales, P., Meunier, J.: CondensØs de textes par
des mØthodes numØriques. JADT 2 (2002) 723734
30. Torres-Moreno, J.M., St-Onge, P.L., Gagnon, M., El-BŁze, M., Bellot, P.:
Automatic Summarization System coupled with a Question-Answering System (QAAS).
CoRR abs/0905.2990 (2009)</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>SanJuan</surname>
          </string-name>
          , E.,
          <string-name>
            <surname>Moriceau</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tannier</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bellot</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mothe</surname>
          </string-name>
          , J.:
          <article-title>Overview of the INEX 2011 Question Answering Track (QA@INEX)</article-title>
          .
          <source>In: INEX 2011 Workshop Pree-Proceedings, IR Publications</source>
          , Hofgut Imsbach, Saarbrcken, Germany (
          <year>2011</year>
          )
          <fpage>145153</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Harris</surname>
            ,
            <given-names>Z.S.</given-names>
          </string-name>
          : From Phoneme to Morpheme.
          <source>Language</source>
          <volume>31</volume>
          (
          <year>1955</year>
          )
          <fpage>190222</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Goldsmith</surname>
          </string-name>
          , J.:
          <article-title>Unsupervised Learning of the Morphology of a Natural Language</article-title>
          .
          <source>Computational Linguistics</source>
          <volume>27</volume>
          (
          <year>2001</year>
          )
          <fpage>153198</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Goldsmith</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>An Algorithm for the Unsupervised Learning of Morphology</article-title>
          .
          <source>Natural Language Engineering</source>
          <volume>12</volume>
          (
          <year>2006</year>
          )
          <fpage>353371</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Paik</surname>
            ,
            <given-names>J.H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mitra</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Parui</surname>
            ,
            <given-names>S.K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jarvelin</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>GRAS: An eective and ecient stemming algorithm for information retrieval</article-title>
          .
          <source>ACM Trans. Inf. Syst</source>
          .
          <volume>29</volume>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Creutz</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lagus</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>Unsupervised Discovery of Morphemes</article-title>
          .
          <source>In: Proc. of the Workshop on Morphological and Phonological Learning of ACL-02</source>
          , Philadelphia, SIGPHON-ACL (
          <year>2002</year>
          )
          <fpage>2130</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Creutz</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Unsupervised segmentation of words using prior distributions of morph length and frequency</article-title>
          . In Hinrichs, E.,
          <string-name>
            <surname>Roth</surname>
          </string-name>
          , D., eds.:
          <article-title>41st Annual Meeting of the ACL</article-title>
          , Sapporo,
          <string-name>
            <surname>Japan.</surname>
          </string-name>
          (
          <year>2003</year>
          )
          <fpage>280287</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Creutz</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lagus</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>Induction of a Simple Morphology for Highly-Inecting Languages</article-title>
          .
          <source>In: Proc. of 7th</source>
          <article-title>Meeting of the ACL Special Interest Group in Computational Phonology SIGPHON-ACL</article-title>
          . (
          <year>2004</year>
          )
          <fpage>4351</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Creutz</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lagus</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>Inducing the Morphological Lexicon of a Natural Language from Unannotated Text</article-title>
          .
          <source>In: Int. and Interdisciplinary Conf. on Adaptive Knowledge Representation and Reasoning (AKRR05)</source>
          . (
          <year>2005</year>
          )
          <fpage>106113</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Lovins</surname>
            ,
            <given-names>J.B.</given-names>
          </string-name>
          :
          <article-title>Development of a Stemming Algorithm</article-title>
          .
          <source>Mechanical Translation and Computational Linguistics</source>
          <volume>11</volume>
          (
          <year>1968</year>
          )
          <fpage>2331</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Porter</surname>
            ,
            <given-names>M.F.</given-names>
          </string-name>
          :
          <article-title>An algorithm for Sux Stripping</article-title>
          .
          <source>Program</source>
          <volume>14</volume>
          (
          <year>1980</year>
          )
          <fpage>130137</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Lennon</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pierce</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tarry</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Willet</surname>
            ,
            <given-names>P.:</given-names>
          </string-name>
          <article-title>An evaluation of some conation algorithms for information retrieval</article-title>
          .
          <source>J. of Information Science</source>
          <volume>3</volume>
          (
          <year>1981</year>
          )
          <fpage>177183</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Majumder</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mitra</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pal</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          : Bulgarian,
          <article-title>Hungarian and Czech stemming using YASS</article-title>
          .
          <source>In: Proceedings of Advances in Multilingual and Multimodal Information Retrieval</source>
          , Springer-Verlag, Berlin (
          <year>2008</year>
          )
          <fpage>4956</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Bacchin</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ferro</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Melucci</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>A probabilistic model for stemmer generation</article-title>
          .
          <source>Mechanical Translation and Computational Linguistics</source>
          <volume>41</volume>
          (
          <year>2005</year>
          )
          <fpage>121137</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>McNamee</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mayeld</surname>
          </string-name>
          , J.:
          <article-title>Character n-gram tokenization for European language text retrieval</article-title>
          .
          <source>Information Retrieval</source>
          <volume>7</volume>
          (
          <year>2004</year>
          )
          <fpage>7397</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Krovetz</surname>
          </string-name>
          , R.:
          <article-title>Viewing Morphology as an Inference Process</article-title>
          .
          <source>In: Proccedings of the 16th ACM/SICIR Conference</source>
          .
          <article-title>(</article-title>
          <year>1993</year>
          )
          <fpage>191202</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Hull</surname>
            ,
            <given-names>D.A.</given-names>
          </string-name>
          :
          <article-title>Stemming algorithms - A case study for detailed evaluation</article-title>
          .
          <source>Journal of the American Society for Information Science</source>
          <volume>47</volume>
          (
          <year>1996</year>
          )
          <fpage>7084</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Medina-Urrea</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Investigacin cuantitativa de ajos y clticos del espaaeol de MØxico. Glutinometra en el Corpus del Espaaeol Mexicano ContemporÆneo</article-title>
          .
          <source>PhD thesis</source>
          , El Colegio de MØxico,
          <source>MØxico</source>
          (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Medina-Urrea</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Automatic Discovery of Axes by means of Corpus: A Catalog of Spanish Axes</article-title>
          .
          <source>Journal of Quantitative Linguistics</source>
          <volume>7</volume>
          (
          <year>2000</year>
          )
          <fpage>97114</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Medina-Urrea</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>HlavcÆovÆ</surname>
          </string-name>
          , J.:
          <article-title>Automatic Recognition of Czech Derivational Prexes</article-title>
          .
          <source>In: Proceedings of CICLing 2005</source>
          . Volume
          <volume>3406</volume>
          .,
          <string-name>
            <surname>LNCS</surname>
          </string-name>
          , Springer, Berlin/Heidelberg/New York (
          <year>2005</year>
          )
          <fpage>189197</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Medina-Urrea</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <source>Ax Discovery based on Entropy and Economy Measurements. Texas Linguistics Society</source>
          <volume>10</volume>
          (
          <year>2008</year>
          )
          <fpage>99112</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Shannon</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weaver</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          :
          <source>The Mathematical Theory of Communication</source>
          . University of Illinois Press, Urbana (
          <year>1949</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23. de Kock, J.,
          <string-name>
            <surname>Bossaert</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          :
          <article-title>Introduccin a la lingstica automÆtica en las lenguas romÆnicas</article-title>
          .
          <source>Gredos</source>
          , Madrid (
          <year>1974</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <surname>Greenberg</surname>
            ,
            <given-names>J.H.</given-names>
          </string-name>
          :
          <article-title>Essays in Linguistics. The Univ</article-title>
          . of Chicago Press, Chicago (
          <year>1957</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <string-name>
            <surname>Torres-Moreno</surname>
            ,
            <given-names>J.M.</given-names>
          </string-name>
          : RØsume automatique de documents.
          <source>Lavoisier</source>
          , Paris (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          26.
          <string-name>
            <surname>Torres-Moreno</surname>
            ,
            <given-names>J.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Saggion</surname>
          </string-name>
          , H., da
          <string-name>
            <surname>Cunha</surname>
          </string-name>
          , I.,
          <string-name>
            <surname>SanJuan</surname>
          </string-name>
          , E.,
          <string-name>
            <surname>VelÆzquez-Morales</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Summary Evaluation with and without References</article-title>
          .
          <source>Polibits</source>
          <volume>42</volume>
          (
          <year>2010</year>
          )
          <fpage>1319</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          27.
          <string-name>
            <surname>Saggion</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Torres-Moreno</surname>
            ,
            <given-names>J.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>da Cunha</surname>
          </string-name>
          , I.,
          <string-name>
            <surname>SanJuan</surname>
          </string-name>
          , E.:
          <article-title>Multilingual summarization evaluation without human models</article-title>
          .
          <source>In: 23rd Int. Conf. on Computational Linguistics. COLING '10</source>
          , Beijing, China,
          <string-name>
            <surname>ACL</surname>
          </string-name>
          (
          <year>2010</year>
          )
          <fpage>10591067</fpage>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>