Lexical cohesion based topic modeling for summarization
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
582 - 592
MetadataShow full item record
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/26880
In this paper, we attack the problem of forming extracts for text summarization. Forming extracts involves selecting the most representative and significant sentences from the text. Our method takes advantage of the lexical cohesion structure in the text in order to evaluate significance of sentences. Lexical chains have been used in summarization research to analyze the lexical cohesion structure and represent topics in a text. Our algorithm represents topics by sets of co-located lexical chains to take advantage of more lexical cohesion clues. Our algorithm segments the text with respect to each topic and finds the most important topic segments. Our summarization algorithm has achieved better results, compared to some other lexical chain based algorithms. © 2008 Springer-Verlag Berlin Heidelberg.
Showing items related by title, author, creator and subject.
Güngördü, Z.; Oflazer, K. (Kluwer Academic Publishers, 1995)This paper describes our work on parsing Turkish using the lexical-functional grammar formalism . This work represents the first effort for wide-coverage syntactic parsing of Turkish. Our implementation is based on ...
Vechtomova O.; Karamuftuoglu, M.; Robertson, S.E. (2006)Lexical cohesion is a property of text, achieved through lexical-semantic relations between words in text. Most information retrieval systems make use of lexical relations in text only to a limited extent. In this paper ...
Oflazer, K. (1997)We present an efficient algorithm for retrieving from a database of trees, all trees that differ from a given query tree by a small number additional or missing leaves, or leaf label changes. It has natural language ...