Abstract
The selection of the most descriptive terms or passages from text is crucial for several tasks, such as feature extraction and summarization. In the majority of the cases, research works propose the ranking of all candidate keywords or sentences and then select the top-ranked items as features, or as a text summary respectively. Ranking is usually performed using statistical information from text (i.e., frequency of occurrence, inverse document frequency, co-occurrence information). In this paper we present Semant- icRank, a graph-based ranking algorithm for keyword and sentence extraction from text. The algorithm constructs a semantic graph using implicit links, which are based on semantic relatedness between text nodes and consequently ranks nodes using different ranking algorithms. Comparative evaluation against related state of the art methods for keyword and sentence extraction shows that Semanti- cRank performs favorably in previously used data sets.
Original language | English |
---|---|
Pages | 1074-1082 |
Number of pages | 9 |
State | Published - 2010 |
Externally published | Yes |
Event | 23rd International Conference on Computational Linguistics, Coling 2010 - Beijing, China Duration: Aug 23 2010 → Aug 27 2010 |
Conference
Conference | 23rd International Conference on Computational Linguistics, Coling 2010 |
---|---|
Country/Territory | China |
City | Beijing |
Period | 08/23/10 → 08/27/10 |