<?xml version="1.0"?><!DOCTYPE article SYSTEM "/project/take/software/searchbench_offline_processing/paperxml_generator/aclextractor/src/python/../resource/dtd/paperxml.dtd"><article><header><firstpageheader><page local="1" global="1041"/><title>Web-based and combined language models: a case study on noun compound identiﬁcation</title><pubinfo>Coling 2010: Poster Volume,pages 1041-1049, Beijing, August 2010</pubinfo><author surname="Ramisch" givenname="Carlos"><org  name="Federal University of Rio Grande do Sul" country="Brazil" city="Porto Alegre"/></author><author surname="Villavicencio" givenname="Aline"><org  name="Federal University of Rio Grande do Sul" country="Brazil" city="Porto Alegre"/></author><author surname="Boitet" givenname="Christian"><org  name="University of Grenoble" country="France" city="Grenoble"/></author></firstpageheader><frontmatter><p><b>Web-based and combined language models: a case study on noun compound identification</b></p><p><b>Carlos Ramisch^* Aline Villavicencio* Christian Boitet^</b></p><p>^ GETALP - Laboratory of Informatics of Grenoble, University of Grenoble * Institute of Informatics, Federal University of Rio Grande do Sul</p><p>{ceramisch,avillavicencio}@inf.ufrgs.br Christian.Boitet@imag.fr</p></frontmatter><abstract>This paper looks at the <i>web </i>as a corpus and at the effects of using web counts to model language, particularly when we consider them as a domain-specific versus a general-purpose resource. We first com­pare three vocabularies that were ranked according to frequencies drawn from general-purpose, specialised and web cor­pora. Then, we look at methods to com­bine heterogeneous corpora and evaluate the individual and combined counts in the automatic extraction of noun compounds from English general-purpose and spe­cialised texts. Better n-gram counts can help improve the performance of empiri­cal NLP systems that rely on n-gram lan­guage models. </abstract></header><body><section number="1" title="Introduction"><p>Corpora have been extensively employed in sev­eral NLP tasks as the basis for automatically learning models for language analysis and gener­ation. In theory, <i>data-driven (empirical </i>or <i>statis­tical) </i>approaches are well suited to take intrinsic characteristics of human language into account. In practice, external factors also determine to what extent they will be popular and/or effective for a given task, so that they have shown different per­formances according to the availability of corpora, to the linguistic complexity of the task, etc.</p><p>An essential component of most empirical sys­tems is the <i>language model </i>(LM) and, in partic­ular, <i>n-gram language models. </i>It is the LM that tells the system how likely a word or <i>n</i>-gram is in that language, based on the counts obtained from corpora. However, corpora represent a sample of a language and will be sparse, i.e. certain words or expressions will not occur. One alternative to min­imise the negative effects of data sparseness and account for the probability of out-of-vocabulary words is to use discounting techniques, where a constant probability mass is discounted from each <i>n</i>-gram and assigned to unseen <i>n</i>-grams. Another strategy is to estimate the probability of an un­seen <i>n</i>-gram by backing off to the probability of the smaller <i>n</i>-grams that compose it.</p><p>In recent years, there has also been some ef­fort in using the <i>web </i>to overcome data sparseness, given that the <i>web </i>is several orders of magnitude larger than any available corpus. However, it is not straightforward to decide whether (a) it is bet­ter to use the <i>web </i>than a standard corpus for a given task or not, and (b) whether corpus and <i>web </i>counts should be combined and how this should be done (e.g. using interpolation or back-off tech­niques). As a consequence there is a strong need for better understanding of the impacts of <i>web </i>fre­quencies in NLP systems and tasks.</p><p>More reliable ways of combining word counts could improve the quality of empirical NLP sys­tems. Thus, in this paper we discuss <i>web</i>-based word frequency distributions (§ 2) and investigate to what extent "web-as-a-corpus" approaches can be employed in NLP tasks compared to standard corpora (§ 3). Then, we present the results of two experiments. First, we compare word counts drawn from general-purpose corpora, from spe­cialised corpora and from the <i>web </i>(§ 4). Second, we propose several methods to combine data from heterogeneous corpora (§ 5), and evaluate their ef­fectiveness in the context of a specific multiword expression task:<page local="2" global="1042"/> automatic noun compound iden­tification. We close this paper with some conclu­sions and future work (§6).</p></section><section number="2" title="The web as a corpus"><p>Conventional and, in particular, domain-specific corpora, are valuable resources which provide a closed-world environment where precise <i>n</i>-gram counts can be obtained. As they tend to be smaller than general purpose corpora, data sparseness can considerably hinder the results of statistical meth­ods. For instance, in the biomedical Genia cor­pus (Ohta et al., 2002), 45% of the words occur only once (so-called <i>hapax legomena), </i>and this is a very poor basis for a statistical method to decide whether this is a significant event or just random noise.</p><p>One possible solution is to see the <i>web </i>as a very large corpus containing pages written in sev­eral languages and being representative of a large fraction of human knowledge. However, there are some differences between using regular corpora and the <i>web </i>as a corpus, as discussed by Kilgar-riff (2003). One assumption, in particular, is that page counts can approximate word counts, so that the total number of pages is used as an estimator of the <i>n</i>-gram count, regardless of how many oc­currences of the <i>n</i>-gram they contain.</p><p>This simple underlying assumption has been employed for several tasks. For example, Grefen-stette (1999), in the context of example-based ma­chine translation, uses <i>web </i>counts to decide which of a set of possible translations is the most natural one for a given sequence of words (e.g. <i>groupe de travail </i>as <i>work group </i>vs <i>labour collective). </i>Like­wise, Keller and Lapata (2003) use the <i>web </i>to esti­mate the frequencies of unseen nominal bigrams, while Nicholson and Baldwin (2006) look at the interpretation of noun compounds based on the individual counts of the nouns and on the global count of the compound estimated from the <i>web </i>as a large corpus.</p><p>Villavicencio et al. (2007) show that the <i>web </i>and the British National Corpus (BNC) could be used interchangeably to identify general-purpose and type-independent multiword expressions. La-pata and Keller (2005) perform a careful and systematic evaluation of the <i>web </i>as a corpus in other general-purpose tasks both for analysis and generation, comparing it with a standard corpus (the BNC) and using two different techniques to combine them: linear interpolation and back-off. Their results show that, while <i>web </i>counts are not as effective for some tasks as standard counts, the combined counts can generate results, for most tasks, that are as good as the results produced by the best individual corpus between the BNC and the <i>web. </i>Nakov (2007) further investigates these tasks and finds that, for many of them, effective attribute selection can produce results that are at least comparable to those from the BNC using counts obtained from the <i>web.</i></p><p>On the one hand, the <i>web </i>can minimise the problem of sparse data, helping distinguish rare from invalid cases. Moreover, a search engine al­lows access to ever increasing quantities of data, even for rare constructions and words, which counts are usually equated to the number of pages in which they occur. On the other hand, <i>n-</i>grams in the highest frequency ranges, such as the words <i>the, up </i>and <i>down, </i>are often assigned the estimated size of the web, uniformly. While this still gives an idea of their massive occur­rence, it does not provide a finer grained distinc­tion among them (e.g. in the BNC, the, <i>down </i>and <i>up </i>occur 6,187,267, 84,446 and 195,426 times, respectively, while in Yahoo! they all occur in 2,147,483,647 pages).</p></section><section number="3" title="Standard vs web corpora"><p>When we compare <i>n</i>-gram counts estimated from the <i>web </i>with counts taken from a well-formed standard corpus, we notice that <i>web </i>counts are "estimated" or "approximated" as page counts, whereas standard corpus counts are the exact number of occurrences of the <i>n</i>-gram. In this way, <i>web </i>counts are dependent on the particular search engine's algorithms and representations, and these may perform approximations to handle the large size of their indexing structures and procedures, such as ignoring punctuation and using stopword lists (Kilgarriff, 2007). This assumption, as well as the following discussion, are not valid for for controlled data sets derived from Web data, such as the Google 1 trillion <i>n</i>-grams<footnote anchor="1"/>.<page local="3" global="1043"/> Thus, our re­sults cannot be compared to those using this kind of data (Bergsma et al., 2009).</p><p>In data-driven techniques, some statistical mea­sures are based on contingency tables, and the counts for each of the table cells can be straight­forwardly computed from a standard corpus. However, this is not the case for the <i>web, </i>where the occurrences of an <i>n</i>-gram are not precisely calculated in relation to the occurrences of the (n — 1)-grams composing it. For instance, the <i>n</i>-gram <i>the man </i>may appear in 200,000 pages, while the words <i>the </i>and <i>man </i>appear in respec­tively 1,000,000 and 200,000 pages, implying that the word <i>man </i>occurs with no other word than <i>the<footnote anchor="2"/> </i>.</p><p>In addition, the distribution of words in a stan­dard corpus follows the well known Zipfian dis­tribution (Baayen, 2001) while, in the <i>web, </i>it is very difficult to distinguish frequent words or n-grams as they are often estimated as the size of the <i>web. </i>For instance, the Yahoo! frequencies plotted in figure 1(a) are flattened in the upper part, giv­ing the same page counts for more than 700 of the most frequent words. Another issue is the size of the corpus, which is an important information, of­ten needed to compute frequencies from counts or to estimate probabilities in <i>n</i>-gram models. Un­like the size of a standard corpus, which is easily obtained, it is very difficult to estimate how many pages exist on the <i>web, </i>especially as this number is always increasing.</p><p>But perhaps the biggest advantage of the <i>web </i>is its availability, even for resource-poor languages and domains. It is a free, expanding and easily ac­cessible resource that is representative of language use, in the sense that it contains a great variability of writing styles, text genres, language levels and knowledge domains.</p></section><section number="4" title="Analysing n -gram frequencies"><p>In this section, we describe an experiment to com­pare the probability distribution of the vocabulary of two corpora, Europarl (Koehn, 2005) and Ge-nia (Ohta et al., 2002), that represent a sample of general-purpose and specialised English. In</p><footnote label="1">This dataset is released through LDC and is not freely available. Therefore, we do not consider it in our evaluation. 2 In practice, this procedure can lead to negative counts.</footnote><p><i>Vep Vgenia Vinter</i></p><doubt alpha="15.2" length="33" tooSmall="False" monospace="0.0">types        104,144 20,876 6,798</doubt><doubt alpha="17.9" length="28" tooSmall="False" monospace="0.0">hapax         41,377 9,410 -</doubt><doubt alpha="20.7" length="29" tooSmall="False" monospace="0.0">tokens   39,595,352 486,823 -</doubt><table caption="Table 1: Some characteristics of general vs domain-specific corpora."></table><p>addition to both corpora, we also considered the counts from the <i>web </i>as a corpus, using Google and Yahoo! APIs, and these four corpora act as <i>n-gram count sources. </i>To do that, we preprocessed the data (§ 4.1), extracted the vocabularies from each corpus and calculated their counts in our four <i>n</i>-gram count sources (§ 4.2), analysing their rank plots to compare how each of these sources models general-purpose and specialised language (§ 4.3). The experiments described in this sec­tion were implemented in the mwetoolkit and are available at http://sf.net/projects/ mwetoolkit/.</p><subsection number="4.1" title="Preprocessing"><p>The Europarl corpus v3.0 <i>(ep) </i>contains transcrip­tions of the speeches held at the European Par­liament, with more than 1.4M sentences and 39,595,352 words. The Genia corpus <i>(genia) </i>con­tains abstracts of scientific articles in biomedicine, with around 1.8K sentences and 486,823 words. These standard corpora were preprocessed in the following way:</p></subsection></section><section number="1." title="conversion to XML, lemmatisation and POS tagging 3 ;"></section><section number="2." title="case homogenisation, based on the following criteria:"><p>• all-uppercase and mixed case words were normalised to their predominant form, if it accounts for at least 80% of the occurrences;</p><p>• uppercase words at the beginning of sentences were lowercased;</p><p>• other words were not modified.</p><footnote label="3">Genia    contains    manual    POS    tag annota­tion.      Europarl  was  tagged  using  the TreeTagger ( www.ims.uni-stuttgart.de/projekte/ corplex/TreeTagger).</footnote><page local="4" global="1044"/><p>This lowercasing algorithm helps to deal with the massive use of abbreviations, acronyms, named entities, and formulae found in specialised cor­pora, such as those containing biomedical (and other specialised) scientific articles.</p><p>For calculating arbitrary-sized <i>n</i>-grams in large textual corpora efficiently, we implemented a structure based on suffix arrays (Yamamoto and Church, 2001). While suffix trees are often used in LM tools, where n-grams have a fixed size, they are not fit for arbitrary length n-gram searches and can consume quite large amounts of memory to store all the node pointers. Suffix arrays, on the other hand, allow for arbitrary length <i>n</i>-grams to be counted in a time that is proportional to log<i>(N), </i>where <i>N </i>is the number of words (which is equiva­lent to the number of suffixes) in the corpus. Suf­fix arrays use a constant amount of memory pro­portional to <i>N </i>. In our implementation, where ev­ery word and every word position in the corpus are encoded as a 4-byte integer, it corresponds pre­cisely to 4 x 2 x <i>N </i>plus the size of the vocabulary, which is generally very small if compared to <i>N, </i>given a typical token/type ratio. The construction of the suffix array takes <i>O(N</i>log2<i>N) </i>operations, due to a sorting step at the end of the process.</p><subsection number="4.2" title="Vocabulary creation"><p>After preprocessing, we extracted all the unigram surface forms (i.e. all words) from <i>ep </i>and from <i>ge-nia, </i>generating two vocabularies, <i>V</i><i>ep </i>and <i>V</i><i>genia, </i>where the words are ranked in descending fre­quency order with respect to the corpus itself seen as a <i>n</i>-gram count source. Formally, we can model a <i>vocabulary </i>as a set <i>V </i>of words <i>vi </i><i>G </i><i>V </i>taken from a corpus. A word <i>count </i>is the value <i>c(vi) = n </i>of a function that goes from words to natural numbers, <i>c </i>: <i>V </i><i>— </i>N. Therefore, there is always an implicit word order relation <i>&lt;r </i>in a vocabulary, that can be generated from <i>V </i>and <i>c </i>by using the order relation &gt; in N<footnote anchor="4"/>. Thus, a <i>rank </i>is defined as a partially-ordered set formed by a vocabulary-word order pair relation: <i>(V, </i><i>&lt;r</i>).</p><p>Table 1 summarises some measures of the ex­tracted vocabularies, where <i>V</i><i>inter </i>denotes the in­tersection of <i>V</i><i>ep </i>and <i>V</i><i>genia.   </i>Notice that <i>V</i><i>inter</i> contains considerably less entries than the small­est vocabulary <i>(V</i><i>genia).</i><i> </i>This shows to what ex­tent both types of text differ and how important it is to use the correct techniques when work­ing with domain-specific data in empirical ap­proaches. The table also shows the number of ha­pax legomena (i.e. words that occur only once) in each corpus, and in this aspect both corpora are similar<footnote anchor="5"/>. It also shows how sparseness affects lan­guage, since a vocabulary that is 400% bigger has only 5% less hapax legomena.</p><footnote label="4">Thatis, W 1, v 2 G V , suppose c(v 1) = n and c(v 2) = n 2, then v 1 &lt; r v2 if and only if n 1 &gt; n 2.</footnote><p>For each entry in each vocabulary, we ob­tained a count estimated from four different <i>n-</i>gram count sources: <i>ep, genia, </i>Google as a cor­pus <i>(google) </i>and Yahoo! as a corpus <i>(yahoo). </i>The latter were configured to return only results for pages in English. Table 2 shows an example of entries extracted from <i>V</i><i>inter. </i>Notice that there are no zeroes in columns <i>genia </i>and <i>ep, </i>since this vo­cabulary only contains words that occur at least once in these corpora. Also, some words like <i>Mac </i>and <i>SH2, </i>that are probably specialised terms, oc­cur more in <i>genia </i>than in <i>ep </i>even if the latter is more than 80 times larger than the former.</p></subsection><subsection number="4.3" title="Rank analyses"><p>For each vocabulary, we want to estimate how similar the ranks generated by each of the four count sources are. Figure 1 shows the rank po­sition <i>(x) </i>against the frequency <i>(y) </i>of words in <i>V</i><i>genia, </i><i>V</i><i>ep </i>and <i>V</i><i>inter</i>, where each plotted point rep­resents a rank position according to corpus fre-<page local="5" global="1045"/></p><footnote label="5">The percentual difference in the proportion of hapax legomena can be explained by the fact that genia is much smaller than ep.</footnote><table caption="Table 2: Distribution of some words inVinter." class="main" frame="box" rules="all" border="0" regular="False"><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><i>n</i><b>-gram genia</b></p></td><td class="cell"><p><b>ep</b></p></td><td class="cell"><p><b>google</b></p></td><td class="cell"><p><b>yahoo</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>642</p></td><td class="cell"><p>1</p></td><td class="cell"><p>4</p></td><td class="cell"><p>8090K</p></td><td class="cell"><p>220M</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>African</p></td><td class="cell"><p>2</p></td><td class="cell"><p>2028</p></td><td class="cell"><p>15400K</p></td><td class="cell"><p>916M</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>fatty</p></td><td class="cell"><p>16</p></td><td class="cell"><p>22</p></td><td class="cell"><p>2550K</p></td><td class="cell"><p>59700K</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>medicine</p></td><td class="cell"><p>4</p></td><td class="cell"><p>643</p></td><td class="cell"><p>21900K</p></td><td class="cell"><p>934M</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Mac</p></td><td class="cell"><p>15</p></td><td class="cell"><p>3</p></td><td class="cell"><p>34500K</p></td><td class="cell"><p>1910M</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>SH2</p></td><td class="cell"><p>27</p></td><td class="cell"><p>1</p></td><td class="cell"><p>113K</p></td><td class="cell"><p>3270K</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>advances</p></td><td class="cell"><p>4</p></td><td class="cell"><p>646</p></td><td class="cell"><p>6200K</p></td><td class="cell"><p>173M</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>thereby</p></td><td class="cell"><p>29</p></td><td class="cell"><p>2370</p></td><td class="cell"><p>8210K</p></td><td class="cell"><p>145M</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr></table><doubt alpha="50.0" length="4" tooSmall="False" monospace="0.0">1er3</doubt><doubt alpha="68.4" length="19" tooSmall="True" monospace="0.0">1ee 1eee 1eeee Rank</doubt><doubt alpha="0.0" length="4" tooSmall="True" monospace="0.0">10-3</doubt><doubt alpha="0.0" length="2" tooSmall="True" monospace="0.0">10</doubt><p>Rankplot of vlnterY genia -</p><doubt alpha="78.6" length="14" tooSmall="True" monospace="0.0">google yahoo ■</doubt><doubt alpha="0.0" length="18" tooSmall="True" monospace="0.0">10 100 1000^ 10000</doubt><doubt alpha="100.0" length="4" tooSmall="True" monospace="0.0">Rank</doubt><doubt alpha="50.0" length="2" tooSmall="True" monospace="0.0">1e</doubt><doubt alpha="0.0" length="2" tooSmall="True" monospace="0.0">-2</doubt><doubt alpha="100.0" length="1" tooSmall="True" monospace="0.0">N</doubt><doubt alpha="66.7" length="3" tooSmall="True" monospace="0.0">O Z</doubt><p>(a) Rank plot of <i>Vgenia. </i>(b) Rank plot of <i>Vep. </i>(c) Rank plot of <i>Vinter.</i></p><p>Figure 1: Plot of normalised frequencies of vocabularies according to rank positions, log-log scale.</p><p>quencies and may correspond to several different words.<footnote anchor="6"/> The four sources have similar shaped curves for each of the three vocabularies: <i>ep </i>and <i>genia </i>could be reasonably approximated by a linear regression curve (in the log-log domain). <i>google </i>and <i>yahoo </i>present Zipfian curves for low frequency ranges but have a flat line for higher frequencies, and the phenomenon seems consis­tent in all vocabularies and more intense on <i>yahoo. </i>This is related to the problem discussed in sec­tion 3 which is that web-based frequencies are not accurate to model common words because <i>web </i>counts correspond to page counts and not to word counts, and that a common word will probably ap­pear dozens of times in a single page. Nonethe­less, <i>google </i>seems more robust to this effect, and indeed <i>yahoo </i>returns exactly the same value (roughly 2 billion pages) for a large number of common words, producing the perfectly straight line in the rank plots. Moreover, the problem seems less serious in <i>V</i><i>inter, </i>but this could be due to its much smaller size. These results show that <i>google </i>is incapable of distinguishing among the top-100 words while <i>yahoo </i>is incapable of distin­guishing among the top-1000 words, and this can be a serious drawback for <i>web</i>-based counts both in general-purpose and specialised NLP tasks.</p><p>The curves agree in a large portion of the fre­quency range, and the only interval in which <i>ge-nia </i>and <i>ep </i>disagree is in lower frequencies (shown in the bottom right corner).  This happens because general-purpose <i>ep </i>frequencies are much less accurate to model the specialised <i>genia </i>vo­cabulary, specially in low frequency ranges when sparseness becomes more marked (figure 1(a)), and vice-versa (figure 1(b)). This effect is min­imised in figure 1(c), corresponding to <i>V</i><i>inter</i>.</p><footnote label="6">Given the Zipfian behaviour of word probability distri­butions, a log-log scale was used to plot the curves.</footnote><p>Although both vocabularies present the same word frequency distributions, it does not mean that their ranks are similar for the four count sources. Tables 3 and 4 show the correlation scores for the compared count sources and for the two vocabularies, using Kendall's <b>t</b>. The <b>t </b>corre­lation index estimates the probability that a word pair in a given rank has the same <i>respective </i>po­sition in another rank, in spite of the distance be­tween the words<footnote anchor="7"/>.</p><p>In the two vocabularies, correlation is low, which indicates that the ranks tend to order words differently even if there are some similarities in terms of the shape of the frequency distribution. When we compare <i>genia </i>with <i>google </i>and with <i>yahoo, </i>we observe that <i>yahoo </i>is slightly less cor­related with <i>genia </i>than <i>google, </i>probably because of its uniform count estimates for frequent words. However, both seem to be more similar to <i>genia </i>than <i>ep.</i></p><p>A comparison of <i>ep </i>with <i>google </i>and with <i>yahoo </i>shows that <i>web </i>frequencies are much more similar to a general-purpose count source like <i>ep </i>than to a specialised source like <i>genia. </i>Additionally, both <i>yahoo </i>and <i>google </i>seem equally correlated to <i>ep.</i></p><footnote label="7">For all correlation values, p &lt; 0.001 for the alternative hypothesis that t is greater than 0.</footnote><table class="main" frame="box" rules="all" border="1" regular="False"><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p></p></td><td class="cell"><p>Rankplot of vgenia ' :</p><p>genia - -</p><p>ep ---------</p><p>google yahoo - - -</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b><i>r</i></b></p></td><td class="cell"><p>^ i</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>r</p></td><td class="cell"><p></p></td><td class="cell"><p></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr></table><table class="main" frame="box" rules="all" border="1" regular="False"><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>r</p></td><td class="cell"><p>\</p></td><td class="cell"><p></p></td><td class="cell"><p>Rankplot ofvep'</p><p>genia - ■</p><p>ep ---------</p><p>google yahoo - - -</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>r</p></td><td class="cell"><p></p></td><td class="cell"><p></p></td><td class="cell"><p>X,</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>; VW</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>1</p></td><td class="cell"><p>10</p></td><td class="cell"><p>100</p></td><td class="cell"><p>1000 10000</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr></table><page local="6" global="1046"/><p>Surprisingly, this correlation is higher for <i>Vgenia</i>than for Vep, as <i>web </i>frequencies and <i>ep </i>frequen­cies are more similar for a specialised vocabulary than for a general-purpose vocabulary. This could mean that the three perform similarly (poorly) at estimating frequencies for the biomedical vocab­ulary <i>(Vgenia) </i>whereas they differ considerably at estimating general-purpose frequencies.</p><p>The correlation of the rank (first column) is also decomposed into the correlation for <i>top </i>words (more than 10 occurrences), <i>middle </i>words (10 to 3 occurrences) and <i>bottom </i>words (2 and 1 occur­rences). Except for the pair <i>google-yahoo, </i>the cor­relation is much higher in the top portion of the vocabulary and is close to zero in the long tail. In spite of the logarithmic scale of the graphics in figure 1, that show the largest difference in the top part, the bottom part is actually the most ir­regular. The only exception is <i>ep </i>compared with the <i>web </i>count sources in <i>V</i><i>genia: </i>these two pairs do not present the high variability of the other com­pared pairs, and this means that using <i>ep </i>counts (general-purpose) to estimate <i>genia </i>counts (spe­cialised) is similar to using <i>web </i>counts, indepen­dently of the position of the word in the rank.</p><p>Counts from <i>google </i>and from <i>yahoo </i>are also very similar, specially if we also consider Spearman's p, that is very close to total correlation. Web ranks are also more similar for a specialised vocabulary than for a general-purpose one, providing further evidence for the hypothesis that the higher corre­lation is a consequence of both sources being poor frequency estimators. That is, for a given vocabu­lary, when <i>web </i>count sources are good estimators, they will be more distinct (e.g. having less zero frequencies).</p></subsection></section><section number="5" title="Combining corpora frequencies"><p>In our second experiment, the goal is to propose and to evaluate techniques for the combination of <i>n</i>-gram counts from heterogeneous sources. Therefore, we will use the insights about the vo­cabulary differences presented in the previous sec­tion. In this evaluation, we measure the impact of the suggested techniques in the identification of noun-noun compounds in corpora. Noun com­pounds are very frequent in general-purpose and specialised texts (e.g. <i>bus stop, European Union </i>and <i>gene activation). </i>We extract them automat­ically from <i>ep </i>and from <i>genia </i>using a standard method based on POS patterns and association measures (Evert and Krenn, 2005; Pecina, 2008; Ramisch et al., 2010).</p><subsection number="5.1" title="Experimental setup"><p>The evaluation task consists of, given a corpus of <i>N </i>words, extract all occurrences of adjacent pairs of nouns<footnote anchor="8"/> and then rank them using a stan­dard statistical measure that estimates the asso­ciation strength between the two nouns. Analo­gously to the formalism adopted in section 4.2, we assume that, for each corpus, we generate a set <i>NN </i>containing n-grams v1...n G NN<footnote anchor="9"/> for which we obtain <i>n</i>-gram counts from four sources. The elements in <i>NN </i>are generated by comparing the POS pattern <i>noun-noun </i>against all the bigrams in the corpus and keeping only those pairs of adja­cent words that match the pattern. The calculation of the association measure, considering a bigram v1v2, is based on a contingency table which cells contain all possible outcomes a1a2,<i>ai </i><i>G </i><i>{vi, —vi}.</i><page local="7" global="1047"/><i> </i>For web-based counts, we corrected up to 2% of them by forcing the frequency of a unigram to be at least equal to the frequency of the bigram in which it occurs. Such inconsistencies are incom­patible with statistical approaches based on con­tingency table, as discussed in section 2.</p><footnote label="8">We ignore other types of compounds, e.g. adjective-noun pairs.</footnote><footnote label="9">We abbreviate a sequence V1... v n  as V1...„.</footnote><table caption="Table 4: Kendall'stfor count sources in Vep." class="main" frame="box" rules="all" border="0" regular="False"><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p><i>Vgenia</i></p></td><td class="cell"><p><i>Vgenia top</i></p></td><td class="cell"><p><i>Vgenia middle</i></p></td><td class="cell"><p><i>Vgenia bottom</i></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><i>genia-ep</i></p></td><td class="cell"><p>0.26</p></td><td class="cell"><p>0.24</p></td><td class="cell"><p>0.13</p></td><td class="cell"><p>0.06</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><i>genia-google</i></p></td><td class="cell"><p>0.28</p></td><td class="cell"><p>0.24</p></td><td class="cell"><p>0.18</p></td><td class="cell"><p>0.09</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><i>genia-yahoo</i></p></td><td class="cell"><p>0.27</p></td><td class="cell"><p>0.22</p></td><td class="cell"><p>0.17</p></td><td class="cell"><p>0.09</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><i>ep-google</i></p></td><td class="cell"><p>0.57</p></td><td class="cell"><p>0.68</p></td><td class="cell"><p>0.53</p></td><td class="cell"><p>0.49</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><i>ep-yahoo</i></p></td><td class="cell"><p>0.57</p></td><td class="cell"><p>0.68</p></td><td class="cell"><p>0.53</p></td><td class="cell"><p>0.49</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><i>google-yahoo</i></p></td><td class="cell"><p>0.90</p></td><td class="cell"><p>0.90</p></td><td class="cell"><p>0.89</p></td><td class="cell"><p>0.89</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Table 3: Kendall's <b>t </b>for count sources in <i>Vgenia.</i></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p><i>V</i><i>ep</i></p></td><td class="cell"><p><i>V</i><i>ep</i></p><p><i>top</i></p></td><td class="cell"><p><i>V</i><i>ep</i></p><p><i>middle</i></p></td><td class="cell"><p><i>V</i><i>ep</i></p><p><i>bottom</i></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><i>genia-ep</i></p></td><td class="cell"><p>0.26</p></td><td class="cell"><p>0.36</p></td><td class="cell"><p>0.07</p></td><td class="cell"><p>0.04</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><i>genia-google</i></p></td><td class="cell"><p>0.27</p></td><td class="cell"><p>0.39</p></td><td class="cell"><p>0.15</p></td><td class="cell"><p>0.12</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><i>genia-yahoo</i></p></td><td class="cell"><p>0.24</p></td><td class="cell"><p>0.35</p></td><td class="cell"><p>0.12</p></td><td class="cell"><p>0.10</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><i>ep-google</i></p></td><td class="cell"><p>0.40</p></td><td class="cell"><p>0.45</p></td><td class="cell"><p>0.22</p></td><td class="cell"><p>0.09</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><i>ep-yahoo</i></p></td><td class="cell"><p>0.38</p></td><td class="cell"><p>0.44</p></td><td class="cell"><p>0.20</p></td><td class="cell"><p>0.08</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><i>google-yahoo</i></p></td><td class="cell"><p>0.86</p></td><td class="cell"><p>0.89</p></td><td class="cell"><p>0.84</p></td><td class="cell"><p>0.83</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr></table><p>The log-likelihood association measure (LL, al­ternatively called <i>expected mutual information), </i>estimates the difference between the observed ta­ble and the expected table under the assumption of independent events, where <i>E (a1.</i><i>.. an) = </i>n<i>-</i>1is calculated using maximum likelihood:</p><doubt alpha="100.0" length="1" tooSmall="False" monospace="0.0">n</doubt><doubt alpha="66.7" length="6" tooSmall="False" monospace="0.0">nc(ai)</doubt><doubt alpha="50.0" length="22" tooSmall="False" monospace="0.0">LL(v1v2)= Yc(a^)xlog2^</doubt><doubt alpha="45.5" length="11" tooSmall="False" monospace="0.0">a1a2E(a1a2)</doubt><p>The evaluation of the <i>NN </i>lists is performed au­tomatically with the help of existing noun com­pound dictionaries. The general-purpose gold standard, used to evaluate <i>NN</i><i>ep, </i>is composed of bigram noun compounds extracted from several resources: 6,212 entries from the Cambridge In­ternational Dictionary of English, 22,981 from Wordnet and 2,849 from the data sets of MWE 2008<footnote anchor="10"/>. Those were merged into a single general­purpose gold standard that contains 28,622 bi­gram noun compounds. The specialised gold stan­dard, used to evaluate <i>NN</i><i>genia, </i>is composed of 7,441 bigrams extracted from constituent annota­tion of the <i>genia </i>corpus with respect to concepts in the Genia ontology (Kim et al., 2006).</p><p>True positives (TPs) are the <i>n</i>-grams of <i>NN </i>that are contained in the respective gold standard, while <i>n</i>-grams that do not appear in the gold stan­dard are considered false positives<footnote anchor="11"/>. While this is a simplification that underestimates the perfor­mance of the method, it is appropriate for the pur­pose of this evaluation because we compare only the <i>mean average precision </i>(MAP) between two <i>NN </i>ranks, in order to verify whether improve­ments obtained by the combined frequencies are significant. Additionaly, MWEs are complex lin­guistic phenomena, and their annotation, specially in a domain corpus, is a difficult task that reaches low agreement rates, sometimes even for expert native speakers. Therefore, not only for theo­retical reasons but also for practical reasons, we adopted an automatic evaluation procedure rath­ern than annotating the top candidates in the lists by hand.</p><footnote label="10">420 entries provided by Timothy Baldwin, 2,169 en­tries provided by Su Nam Kim and 250 entries provided by Preslav Nakov, freely available at http://multiword . sf.net/</footnote><footnote label="11">In fact, nothing can be said about an n-gram that is not in a (limited-coverage) dictionary, further manual annotation would be necessary to asses its relevance.</footnote><p>Since the log-likelihood measure is a function that assigns a real value to each <i>n</i>-gram, there is a rank relation <i>&lt;r </i>that will be used to calculate MAP as follows:</p><doubt alpha="38.1" length="21" tooSmall="False" monospace="0.0">YP(v1...n) Xp(v1...n)</doubt><doubt alpha="41.2" length="17" tooSmall="False" monospace="0.0">MAP(NN,&lt;r)=v^-:-,</doubt><doubt alpha="61.5" length="13" tooSmall="False" monospace="0.0">v|TPsin NN| '</doubt><p>where <i>p = </i>1 if 1... <i>n </i>is a TP, 0 else, and the preci­sion <i>P( </i>1...<i>n)</i><i> </i>ofagiven <i>n</i>-gram corresponds to the number of TPs before <i>v\^,n </i>in <i>(NN,</i><i> </i><i>&lt;r) </i>over the total number of n-grams before <i>v\^,n </i>in <i>(NN,</i><i> </i><i>&lt;r</i>).</p></subsection><subsection number="5.2" title="Combination heuristics"><p>From the initial list of 176,552 lemmatised <i>n-</i>grams in <i>NNep </i>and 14,594 in <i>NNgenia, </i>we fil­tered out all hapax legomena in order to remove noise and avoid useless computations. Then, we counted the occurrences of v1, v2 and v1v2 in our four sources, and those were used to calculate the four <i>LL </i>values of <i>n</i>-grams in both lists. We also propose three heuristics to combine a set of <i>m </i>count sources <i>c</i>1 through <i>c</i><i>m </i>into a single count source <i>ccomb:</i></p><doubt alpha="100.0" length="1" tooSmall="False" monospace="0.0">m</doubt><doubt alpha="44.7" length="38" tooSmall="False" monospace="0.0">Ccomb(v1...n)=YWi(v1...n) XCi(v1...n),</doubt><doubt alpha="33.3" length="3" tooSmall="False" monospace="0.0">i=1</doubt><p>where <i>w(v</i>1...<i>n)</i><i> </i>is a function that assigns a weight between 0 and 1 for each count source accord­ing to the <i>n</i>-gram <i>v</i>1...<i>n. </i>Three different func­tions were used in our experiments: <i>uniform </i>linear interpolation assumes a constant and uni­form weight w(v1...n) = 1/m for all n-grams; <i>pro­portional </i>linear interpolation assumes a constant weight Wi(v1...n) = ((Ym=1 <i>N</i><i>j</i>) - <i>N</i><i>i)/</i><i>Y</i><i>m=1</i><i> </i><i>N</i><i>j</i><i> </i>that is proportional to the inverse size of the corpus; and <i>back-off </i>uses the uniform interpolation of <i>web </i>frequencies whenever the <i>n</i>-gram count in the original corpus falls below a threshold (empiri­cally defined as log2(N/100,000)).</p><page local="8" global="1048"/><p>Table 5 shows that the performance of <i>back­off </i>is below all other techniques for both vocab­ularies, thus excluding it as a successful combina­tion heuristic. The large difference between MAP scores for <i>NNep </i>and for <i>NNgenia </i>is explained by the relative size of the gold standards: while the general-purpose reference accounts for 16% ofthe size of the <i>NN</i><i>ep </i>set, the specialised reference has as many entries as 50% of <i>NN</i><i>genia. </i>Moreover, the former was created by joining heterogeneous re­sources while the latter was compiled by human annotators from the Genia corpus itself. The goal of our evaluation, however, is not to compare the difficulty of each task, but to compare the com­bination heuristics presented in each row of the table.</p><p>The best MAP for <i>NN</i><i>genia </i>was obtained with <i>genia, </i>that significantly outperforms all other sources except <i>ep<footnote anchor="12"/>. </i>On the other hand, the use of web-based or interpolated counts in extracting specialised noun-noun compounds does not im­prove the performance of results based on sparse but reliable counts drawn from well-formed cor­pora. Nonetheless, the performance of <i>ep </i>in spe­cialised extraction is surprising and could only be explained by some overlap between the corpora. Moreover, the interpolated counts are not signif­icantly different from <i>google </i>counts, even if this corpus should have the weakest weight in <i>propor­tional </i>interpolation.</p><p>General-purpose compound extraction, how­ever, benefits from the counts drawn from large corpora as <i>google </i>and <i>yahoo. </i>Indeed, the former significantly outperforms all other count sources, closely followed by <i>proportional </i>counts. In both vocabularies, <i>proportional </i>interpolation per­forms very similar to the best count source, but, strangely enough, it still does not outperform <i>google. </i>Further data inspection would be needed to explain these results for the interpolated combi­nation and to try to shed some light on the reason why the <i>backoff </i>method performs so poorly.</p><footnote label="12">Significance was assessed through a standard one-tailed t test for equal sample sizes and variances, a = 0.005.</footnote></subsection></section><section number="6" title="Future perspectives"><p>In this work, we presented a detailed evalua­tion of the use of <i>web </i>frequencies as estima­tors of corpus frequencies in general-purpose and specialised tasks, discussing some important as­pects of corpus-based versus <i>web</i>-based <i>n</i>-gram frequencies. The results indicate that they are not only very distinct but they are so in different ways. The importance of domain-specific data for modelling a specialised vocabulary is discussed in terms of using <i>ep </i>to get <i>Vgenia </i>counts. Further­more, the <i>web </i>corpora were more similar to <i>genia </i>than to <i>ep, </i>which can be explained by the fact that "similar" is different from "good", i.e. they might be equally bad in modelling <i>genia </i>while they are distinctly better for <i>ep.</i></p><p>We also proposed heuristics to combine count sources inspired by standard interpolation and back-off techniques. Results show that we can­not use <i>web</i>-based or combined counts to identify specialised noun compounds, since they do not help minimise data sparseness. However, general­purpose extraction is improved with the use of <i>web </i>counts instead of counts drawn from standard corpora.</p><p>Future work includes extending this research to other languages and domains in order to es­timate how much of these results depend on the corpora sizes. Moreover, as current interpolation techniques usually combine two corpora, weights are estimated in a more or less ad hoc proce­dure (Lapata and Keller, 2005). Interpolating sev­eral corpora would need a more controlled learn­ing technique to obtain optimal weights for each frequency function. Additionally, the evaluation shows that corpora perform differently according to the frequency range. This insight could be used to define weight functions for interpolation.</p><table caption="Table 5: Performance of compound extraction." class="main" frame="box" rules="all" border="0" regular="False"><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>MAP of rank</b></p></td><td class="cell"><p><i>NN</i><i>genia</i></p></td><td class="cell"><p><i>NN</i><i>ep</i></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><i>LLgenia</i></p></td><td class="cell"><p>0.4400</p></td><td class="cell"><p>0.0462</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><i>LLep</i></p></td><td class="cell"><p>0.4351</p></td><td class="cell"><p>0.0371</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><i>LLgoogle</i></p></td><td class="cell"><p>0.4297</p></td><td class="cell"><p>0.0532</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><i>LLyahoo</i></p></td><td class="cell"><p>0.4209</p></td><td class="cell"><p>0.0508</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><i>LL</i><i>Uniform</i></p></td><td class="cell"><p>0.4254</p></td><td class="cell"><p>0.0508</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><i>LLproportional</i></p></td><td class="cell"><p>0.4262</p></td><td class="cell"><p>0.0520</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><i>LLbackoff</i></p></td><td class="cell"><p>0.3719</p></td><td class="cell"><p>0.0370</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr></table><page local="9" global="1049"/></section><section title="Acknowledgements"><p>This research was partly supported by CNPq (Projects 479824/2009-6 and 309569/2009-5), FINEP and SEBRAE (COMUNICA project FINEP/SEBRAE 1194/07). Special thanks to Flâvio Brun for his thorough work as volunteer proofreader.</p></section><references><p>Baayen, R. Harald. 2001. <i>Word Frequency Distri­butions, </i>volume 18 of <i>Text, Speech and Language Technology. </i>Springer.</p><p>Bergsma, Shane, Dekang Lin, and Randy Goebel. 2009. Web-scale N-gram models for lexical disam­biguation. In Boutilier, Craig, editor, <i>Proceedings ofthe 21st International Joint Conference on Arti­ficial Intelligence (IJCAI2009), </i>pages 1507-1512, Pasadena, CA, USA, July.</p><p>Evert, Stefan and Brigitte Krenn. 2005. Using small random samples for the manual evaluation of sta­tistical association measures. <i>Computer Speech &amp; Language Special issue on Multiword Expression, </i>19(4):450-466.</p><p>Grefenstette, Gregory. 1999. The World Wide Web as a resource for example-based machine translation tasks. In <i>Proceedings ofthe Twenty-First Interna­tional Conference on Translating and the Computer, </i>London, UK, November. ASLIB.</p><p>Keller, Frank and Mirella Lapata. 2003. Using the web to obtain frequencies for unseen bigrams. <i>Computational Linguistics Special Issue on the Web</i> <i>as Corpus, </i>29(3):459-484.</p><p>Kilgarriff, Adam and Gregory Grefenstette. 2003. In­troduction to the special issue on the web as corpus.</p><p><i>Computational Linguistics Special Issue on the Web as Corpus, </i>29(3):333-347.</p><p>Kilgarriff, Adam. 2007. Googleology is bad science. <i>Computational Linguistics, </i>33(1):147-151.</p><p>Kim, Jin-Dong, Tomoko Ohta, Yuka Teteisi, and Jun'ichi Tsujii. 2006. GENIA ontology. Techni­cal report, Tsujii Laboratory, University of Tokyo.</p><p>Koehn, Philipp. 2005. Europarl: A parallel corpus for statistical machine translation. In <i>Proceedings of the Tenth Machine Translation Summit(MT Summit 2005), </i>Phuket, Thailand, September. Asian-Pacific Association for Machine Translation.</p><p>Lapata, Mirella and Frank Keller. 2005. Web-based models for natural language processing. <i>ACM</i> <i>Transactions on Speech and Language Processing (TSLP), </i>2(1):1-31.</p><p>Nakov, Preslav. 2007. <i>Using the Web as an Implicit Training Set: Application to Noun Compound Syn­tax and Semantics. </i>Ph.D. thesis, EECS Department, University of California, Berkeley, CA, USA.</p><p>Nicholson, Jeremy and Timothy Baldwin. 2006. Inter­pretation of compound nominalisations using cor­pus and web statistics. In Moirön, Begona Villada, Aline Villavicencio, Diana McCarthy, Stefan Ev­ert, and Suzanne Stevenson, editors, <i>Proceedings of the COLING/ACL Workshop on Multiword Expres­sions: Identifying and Exploiting Underlying Prop­erties (MWE2006), </i>pages 54-61, Sidney, Australia, July. Association for Computational Linguistics.</p><p>Ohta, Tomoko, Yuka Tateishi, and Jin-Dong Kim. 2002. The GENIA corpus: an annotated research abstract corpus in molecular biology domain. In <i>Proceedings ofthe Second Human Language Tech­nology Conference (HLT 2002), </i>pages 82-86, San Diego, CA, USA, March. Morgan Kaufmann Pub­lishers.</p><p>Pecina, Pavel. 2008. Reference data for czech collo­cation extraction. In Gregoire, Nicole, Stefan Ev­ert, and Brigitte Krenn, editors, <i>Proceedings ofthe LREC Workshop Towards a Shared Task for Multi­word Expressions (MWE 2008), </i>pages 11-14, Mar­rakech, Morocco, June.</p><p>Ramisch, Carlos, Aline Villavicencio, and Christian Boitet. 2010. mwetoolkit: a framework for mul­tiword expression identification. In Calzolari, Nico-letta, Khalid Choukri, Bente Maegaard, Joseph Mar-iani, Jan Odjik, Stelios Piperidis, Mike Rosner, and Daniel Tapias, editors, <i>Proceedings ofthe Seventh International Conference on Language Resources and Evaluation (LREC 2010), </i>Valetta, Malta, May. European Language Resources Association.</p><p>Villavicencio, Aline, Valia Kordoni, Yi Zhang, Marco Idiart, and Carlos Ramisch. 2007. Validation and evaluation of automatically acquired multi­word expressions for grammar engineering. In Eisner, Jason, editor, <i>Proceedings of the 2007 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning (EMNLP-CoNLL 2007), </i>pages 1034-1043, Prague, Czech Republic, June. Associ­ation for Computational Linguistics.</p><p>Yamamoto, Mikio and Kenneth W. Church. 2001. Us­ing suffix arrays to compute term frequency and document frequency for all substrings in a corpus. <i>Computational Linguistics, </i>27(1):1-30.</p></references></body></article>