160 likes | 352 Views
Biased LexRank : Passage Retrieval using Random Walks with Question-Based Priors. Presenter : JHOU, YU-LIANG Authors : Jahna Otterbacher a , Gunes Erkan b , Dragomir R. Radev 2009, IPM. Outlines. Motivation Objectives Methodology Experimental Result Conclusions Comments.
E N D
Biased LexRank: Passage Retrieval using Random Walks with Question-Based Priors Presenter : JHOU, YU-LIANGAuthors : JahnaOtterbacher a , GunesErkan b , Dragomir R. Radev2009, IPM
Outlines • Motivation • Objectives • Methodology • Experimental Result • Conclusions • Comments
Motivation • Text summarization is one of the hardest problems in information retrieval, because it is not very well-defined. • There are various definitions of text summarization resulting from different approaches to solving the problem. • There is often no agreement as to what a good summary is even when we are dealing with a particular definition of the problem.
Objectives Using biased LexRankon achieving text summarization and retrieval QA more effect.
Biased LexRank-application-QA QA systems is to retrieve the sentences that potentially contain the answer to the question .
Passage retrieval-summarization Computing link weights
Experimental-result biased LexRankv.s human summarizers
Experimental-QA corpus
Experimental Result effect of similarity for QA
Experimental Result LexRank Versus the Baseline Approach
Experimental Result LexRank Versus the Baseline Approach
Conclusions In the paper, we have also demonstrated the effectiveness of our method as applied to two classical IR problems, extractive text summarization and passage retrieval for question answering.
Comments I think the method improved retrieval performance and comparable to human summarizers. Applications - Text summarization - Information retrieval