<?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="186"/><title>SZTERGAK : Feature Engineering for Keyphrase Extraction</title><pubinfo>Proceedings of the 5th International Workshop on Semantic Evaluation, ACL 2010,pages 186-189, Uppsala, Sweden, 15-16 July 2010. ©2010 Association for Computational Linguistics</pubinfo><author surname="Berend" givenname="Gábor"><org  name="Hungarian Academy of Sciences" country="Hungary" city="Budapest"/></author><author surname="Farkas" givenname="Richárd"><org  name="University of Szeged" country="Hungary" city="Szeged"/></author></firstpageheader><frontmatter><p><b>SZTERGAK : Feature Engineering for Keyphrase Extraction</b></p><p><b>Gabor Berend Richard Farkas</b></p><p>Department of Informatics Hungarian Academy of Sciences University of Szeged 103. Tisza Lajos körnt</p><p>2. Ârpâd tér Szeged, H-6720, Hungary Szeged, H-6720, Hungary</p><p>berendg@inf.u-szeged.hu rfarkas@inf.u-szeged.hu</p></frontmatter><abstract>Automatically assigning keyphrases to documents has a great variety of applica­tions. Here we focus on the keyphrase extraction of scientific publications and present a novel set of features for the su­pervised learning of keyphraseness. Al­though these features are intended for ex­tracting keyphrases from scientific papers, because of their generality and robust­ness, they should have uses in other do­mains as well. With the help of these fea­tures SZTERGAK achieved top results on the <i>SemEval-2 shared task on Automatic Keyphrase Extraction from Scientific Arti­cles </i>and exceeded its baseline by 10%. </abstract></header><body><section number="1" title="Introduction"><p>Keyphrases summarize the content of documents with the most important phrases. They can be valuable in many application areas, ranging from information retrieval to topic detection. However, since manually assigned keyphrases are rarely pro­vided and creating them by hand would be costly and time-consuming, their automatic generation is of great interest nowadays. Recent state-of-the-art systems treat this kind of task as a super­vised learning task, in which phrases of a docu­ment should be classified with respect to their key phrase characteristics based on manually labeled corpora and various feature values.</p><p>This paper focuses on the task of keyphrase ex­traction from scientific papers and we shall intro­duce new features that can significantly improve the overall performance. Although the experimen­tal results presented here are solely based on sci­entific articles, due to the robustness and univer­sality of the features, our approach is expected to achieve good results when applied on other do­mains as well.</p></section><section number="2" title="Related work"><p>In <b>keyphrase extraction </b>tasks, phrases are ex­tracted from one document that are the most char­acteristic of its content (Liu et al., 2009; Wit­ten et al., 1999). In these approaches keyphrase extraction is treated as a classification task, in which certain n-grams of a specific document act as keyphrase candidates, and the task is to classify them as proper keyphrases or not.</p><p>While Frank et al. (1999) exploited domain spe­cific knowledge to improve the quality of auto­matic tagging, others like Liu et al. (2009) analyze term co-occurence graphs. It was Nguyen and Kan (2007) who dealt with the special characteristics of scientific papers and introduced the state-of-the-art feature set to keyphrase extraction tasks. Here we will follow a similar approach and make sig­nificant improvements by the introduction of novel features.</p></section><section number="3" title="The SZTERGAK system"><p>The SZTERGAK framework treats the reproduc­tion of reader-assigned keyphrases as a supervised learning task. In our setting a restricted set of to­ken sequences extracted from the documents was used as classification instances. These instances were ranked regarding to their posteriori proba­bilities of the keyphrase class, estimated by a Naïve Bayes classifier. Finally, we chose the top-15 candidates as keyphrases.</p><p>Our features can be grouped into four main cat­egories: those that were calculated solely from the surface characteristics of phrases, those that took into account the document that contained a keyphrase, those that were obtained from the given document set and those that were based on exter­nal sources of information.</p><page local="2" global="187"/><subsection number="3.1" title="Preprocessing"><p>Since there are parts of a document (e.g. tables or author affiliations) that can not really contribute to the keyphrase extractor, several preprocessing steps were carried out. Preprocessing included the elimination of author affiliations and messy lines.</p><p>The determination of the full title of an article would be useful, however, it is not straightforward because of multi-line titles. To solve this prob­lem, a web query was sent with the first line of a document and its most likely title was chosen by simply selecting the most frequently occurring one among the top 10 responses provided by the Google API. This title was added to the document, and all the lines before the first occurrence of the line Abstract were omitted.</p><p>Lines unlikely to contain valuable information were also excluded from the documents. These lines were identified according to statistical data of their surface forms (e.g. the average and the deviation of line lengths) and regular expres­sions. Lastly, section and sentence boundaries were found in a rule-based way, and the POS and syntactic tagging (using the Stanford parser (Klein and Manning, 2003)) of each sentence were car­ried out.</p><p>When syntactically parsed sentences were ob­tained, keyphrase aspirants were extracted. The 1 to 4-long token sequences that did not start or end with a stopword and consisted only of POS-codes of an adjective, a noun or a verb were de­fined to be possible keyphrases (resulting in classi­fication instances). Tokens of key phrase aspirants were stemmed to store them in a uniform way, but they were also appended by the POS-code of the derived form, so that the same root forms were dis­tinguished if they came from tokens having differ­ent POS-codes, like there shown in Table 1.</p></subsection><subsection number="3.2" title="The extended feature set"><p>The features characterizing the extracted keyphrase aspirants can be grouped into four main types, namely phrase-, document-, corpuslevel and external knowledge-based features. Below we will describe the different types of features as well as those of KEA (Witten et al., 1999) which are cited as default features by most of the literature dealing with keyphrase extraction.</p><subsubsection number="3.2.1" title="Standard features"><p>Features belonging to this set contain those of KEA, namely Tf-idf and the first occurrence.</p><p>The <b>Tf-idf feature </b>assigns the tf-idf metric to each keyphrase aspirant.</p><p>The <b>first occurrence feature </b>contains the rela­tive first position for each keyphrase aspirant. The feature value was obtained by dividing the abso­lute first token position of a phrase by the number of tokens of the document in question.</p></subsubsection><subsubsection number="3.2.2" title="Phrase-level features"><p>Features belonging to this group were calcu­lated solely based on the keyphrase aspirants themselves. Such features are able to get the general characteristics of phrases functioning as keyphrases.</p><p><b>Phrase length feature </b>contains the number of tokens a keyphrase aspirant consists of.</p><p><b>POS feature </b>is a nominal one that stores the POS-code sequence of each keyphrase aspi­rant. (For example, for the phrase full_JJ space_NN its value was JJ NN.)</p><p><b>Suffix feature </b>is a binary feature that stores information about whether the original form of a keyphrase aspirant finished with some specific ending according to a subset of the Michigan Suf­ficiency Exams' Suffix List. <footnote anchor="1"/></p></subsubsection><subsubsection number="3.2.3" title="Document-level features"><p>Since keyphrases should summarize the particular document they represent, and phrase-level features introduced above were independent of their con­text, document-level features were also invented.</p><p><b>Acronymity feature </b>functions as a binary fea­ture that is assigned a true value iff a phrase is likely to be an extended form of an acronym in the same document. A phrase is treated as an extended form of an acronym if it starts with the same letter as the acronym present in its document and it also contains all the letters of the acronym in the very same order as they occur in the acronym.</p><p><b>PMI feature </b>provides a measure of the mul­tiword expression nature of multi-token phrases, and it is defined in Eq.<page local="3" global="188"/> (1), where <i>p(ti) </i>is the document-level probability of the occurrence of <i>ith</i><i> </i>token in the phrase. This feature value is a gen­eralized form of pointwise mutual information for phrases with an arbitrary number of tokens.</p><footnote label="1"> http://www.michigan-proficiency-exams.com/suffix- listhtml</footnote><table caption="Table 1: Standardization of document terms." class="main" frame="box" rules="all" border="1" regular="True"><tr class="row"><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>Textual Appearance</b></p></td><td class="cell"><p><b>Canonical form</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>regulations Regulation regulates regulated</p></td><td class="cell"><p>regul_nns regul_nn reguLvbz reguLvbn</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></tr></table><p><i>pmi(ti,t2, </i><i>...,tr.</i></p><doubt alpha="75.0" length="4" tooSmall="False" monospace="0.0">log{</doubt><doubt alpha="32.4" length="37" tooSmall="False" monospace="0.0">P(tl,t2,...,t„)p(t1)-p{t2)-...-p(tn)'</doubt><doubt alpha="47.6" length="21" tooSmall="False" monospace="0.0">log(p(ti,t2,...,tn))T</doubt><doubt alpha="0.0" length="3" tooSmall="False" monospace="0.0">(1)</doubt><p><b>Syntactic feature </b>values refer to the average minimal normalized depth of the NP-rooted parse subtrees that contain a given keyphrase aspirant at the leaf nodes in a given document.</p></subsubsection><subsubsection number="3.2.4" title="Corpus-level features"><p>Corpus-level features are used to determine the relative importance of keyphrase aspirants based on a comparison of corpus-level and document-level frequencies.</p><p>The <b>sf-isf feature </b>was created to deal with logi­cal positions of keyphrases and the formula shown in Eq. (2) resembles that of tf-idf scores (hence its name, i.e. Section Frequency-Inverted Section Frequency). This feature value favors keyphrase aspirants <i>k </i>that are included in several sections of document <i>d (sf), </i>but are present in a relatively small number of sections in the overall corpus <i>(isf). </i>Phrases with higher sf-isf scores for a given document are those that are more relevant with re­spect to that document.</p><doubt alpha="50.0" length="30" tooSmall="False" monospace="0.0">sfisf(k,d) = sf(k,d)*isf(k)(2)</doubt><p><b>Keyphraseness feature </b>is a binary one which has a true value iff a phrase is one of the 785 dif­ferent author-assigned keyphrases provided in the training and test corpora.</p></subsubsection><subsubsection number="3.2.5" title="External knowledge-based features"><p>Apart from relying on the given corpus, further en­hancements in performance can be obtained by re­lying on external knowledge sources.</p><p><b>Wikipedia-feature </b>is assigned a true value for keyphrase aspirants for which there exists a Wikipedia article with the same title. Preliminary experiments showed that this feature is noisy, thus we also investigated a relaxed version of it, where occurrences of Wikipedia article titles were looked for only in the title and abstract of a paper.</p><p>Besides using Wikipedia for feature calculation, it was also utilized to retrieve semantic orienta­tions of phrases. Making use of <b>redirect links of Wikipedia, </b>the semantic relation of synonymity can be exploited. For example, as there exists a redirection between Wikipedia articles XML and Extensible Markup Language, it may be assumed that these phrases mean the same. For this reason during the training phase we treated a phrase equivalent to its redirected version, i.e. if there is a keyphrase aspirant that is not as­signed in the gold-standard reader annotation but the Wikipedia article with the same title has a redi­rection to such a phrase that is present among pos­itive keyphrase instances of a particular document, the original phrase can be treated as a positive in­stance as well. In this way the ratio of positive ex­amples could be increased from 0.99% to 1.14%.</p></subsubsection></subsection></section><section number="4" title="Results and discussion"><p>The training and test sets of the shared task (Kim et al., 2010) consisted of 144 and 100 scien­tific publications from the ACL repository, respec­tively. Since the primary evaluation of the shared task was based on the top-15 ranked automatic keyphrases compared to the keyphrases assigned by the readers of the articles, these results are re­ported here. The evaluation results can be seen in Table 2 where the individual effect of each feature is given in combination with the standard features.</p><p>It is interesting to note the improvement ob­tained by extending standard features with the simple feature of phrase length. This indicates that though the basic features were quite good, they did not take into account the point that reader keyphrases are likely to consist of several words.<page local="4" global="189"/></p><table caption="Table 2: Results obtained with different features." 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></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>Feature combinations</b></p></td><td class="cell"><p><b>F-score</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Standard features (SF)</p></td><td class="cell"><p>14.57</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>SF + phrase length feature</p></td><td class="cell"><p>20.93</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>SF + POS feature</p></td><td class="cell"><p>19.60</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>SF + suffix feature</p></td><td class="cell"><p>16.35</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>SF + acronymity feature</p></td><td class="cell"><p>16.87</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>SF + PMI feature</p></td><td class="cell"><p>15.68</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>SF + syntactic feature</p></td><td class="cell"><p>14.20</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>SF + sf-isf feature</p></td><td class="cell"><p>14.79</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>SF + keyphraseness feature</p></td><td class="cell"><p>15.17</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>SF + Wikipedia feature - full paper</p></td><td class="cell"><p>14.37</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>SF + Wikipedia feature - abstract</p></td><td class="cell"><p>16.50</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>SF + Wikipedia redirect</p></td><td class="cell"><p>14.50</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Shared Task best baseline</p></td><td class="cell"><p>12.87</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>All features</p></td><td class="cell"><p>23.82</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>All features - keyphraseness excluded</p></td><td class="cell"><p>22.11</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></tr></table><p>Morphological features, such as POS or suffix features were also among the top-performing ones, which seems to show that most of the keyphrases tend to have some common structure. In contrast, the syntactic feature made some decrease in the performance when it was combined just with the standard ones. This can be due to the fact that the input data were quite noisy, i.e. some inconsisten­cies arose in the data during the pdf to text con­version of articles, which made it difficult to parse some sentences correctly.</p><p>It was also interesting to see that Wikipedia fea­ture did not improve the result when it was applied to the whole document. However, our previous ex­periences on keyphrase extraction from scientific abstracts showed that this feature can be very use­ful. Hence, we relaxed the feature to handle occur­rences just from the abstract. This modification of the feature yielded a 14.8% improvement in the F-measure. A possible explanation for this is that Wikipedia has articles of very common phrases (such as Calculation or Result) and the dis­tribution of such non-keyphrase terms is higher in the body of the articles than in abstracts.</p><p>The last row of Table 2 contains the result achieved by the complete feature set excluding <i>keyphraseness. </i>As keyphraseness exploits author-assigned keyphrases and - to the best of our knowledge - other participants of the shared task did not utilize author-assigned keyphrases, this re­sult is present in the final ranking of the shared task systems. However, we believe that if the task is to extract keyphrases from an article to gain se­mantic meta-data for an NLP application (e.g. for information retrieval or summarization), author-assigned keyphrases are often present and can be very useful. This latter statement was proved by one of our experiments where we used the au­thor keyphrases assigned to the document itself as a binary feature (instead of using the pool of all keyphrases). This feature set could achieve an F-score of 27.44 on the evaluation set and we believe that this should be the complete feature set in a real-world semantic indexing application.</p></section><section number="5" title="Conclusions"><p>In this paper we introduced a wide set of new fea­tures that are able to enhance the overall perfor­mance of supervised keyphrase extraction applica­tions. Our features include those calculated simply on surface forms of keyphrase aspirants, those that make use of the document- and corpus-level envi­ronment of phrases and those that rely on exter­nal knowledge. Although features were designed to the specific task of extracting keyphrases from scientific papers, due to their generality it is highly assumable that they can be successfully utilized on different domains as well.</p><p>The features we selected in SZTERGAK per­formed well enough to actually achieve the third place on the shared task by excluding the keyphraseness feature and would be the first by using any author-assigned keyphrase-based fea­ture. It is also worth emphasizing that we think that there are many possibilities to further extend the feature set (e.g. with features that take the semantic relatedness among keyphrase aspirants into account) and significant improvement could be achievable.</p><p><b>Acknowledgement</b></p><p>The authors would like to thank the annotators of the shared task for the datasets used in the shared task. This work was supported in part by the NKTH grant (project codename TEXTREND).</p></section><references><p>Eibe Frank, Gordon W. Paynter, Ian H. Witten, Carl Gutwin, and Craig G. Nevill-Manning. 1999. Domain-specific keyphrase extraction. In <i>Proceed­ing of 16th IJCAI, </i>pages 668-673.</p><p>Su Nam Kim, Olena Medelyan, Min-Yen Kan, and Timothy Baldwin. 2010. Semeval-2010task5 : Au­tomatic keyphrase extraction from scientific articles. In <i>Proc. of the 5th SIGLEX Workshop on Semantic Evaluation.</i></p><p>Dan Klein and Christopher D. Manning. 2003. Ac­curate unlexicalized parsing. In <i>Proceedings of the 41st Meeting of the Association for Computational Linguistics, </i>pages 423^130.</p><p>Zhiyuan Liu, Peng Li, Yabin Zheng, and Maosong Sun. 2009. Clustering to find exemplar terms for keyphrase extraction. In <i>Proceedings of the 2009 Conference on EMNLP.</i></p><p>Thuy Dung Nguyen and Minyen Kan. 2007. Keyphrase extraction in scientific publications. In <i>Proc. of International Conference on Asian Digital Libraries (ICADL 07), </i>pages 317-326.</p><p>Ian H. Witten, Gordon W. Paynter, Eibe Frank, Carl Gutwin, and Craig G. Nevill-Manning. 1999. Kea: Practical automatic keyphrase extraction. In <i>ACM DL, </i>pages 254-255.</p></references></body></article>