Conference proceeding
Using negative voting to diversify answers in non-factoid question answering
Proceedings of the 18th ACM conference on information and knowledge management, pp 1681-1684
02 Nov 2009
Abstract
We propose a ranking model to diversify answers of non-factoid questions based on an inverse notion of graph connectivity. By representing a collection of candidate answers as a graph, we posit that novelty, a measure of diversity, is inversely proportional to answer vertices' connectivity. Hence, unlike the typical graph ranking models, which score vertices based on the degree of connectedness, our method assigns a penalty score for a candidate answer if it is strongly connected to other answers. That is, any redundant answers, indicated by a higher inter-sentence similarity, will be ranked lower than those with lower inter-sentence similarity. At the end of the ranking iterations, many redundant answers will be moved toward the bottom on the ranked list. The experimental results show that our method helps diversify answer coverage of non-factoid questions according to F-scores from nugget pyramid evaluation.
Metrics
20 Record Views
7 citations in Scopus
Details
- Title
- Using negative voting to diversify answers in non-factoid question answering
- Creators
- Palakorn Achananuparp - Drexel UniversityChristopher Yang - Drexel UniversityXin Chen - Drexel UniversityXiaoli Chen - Pathology (and Laboratory Medicine)
- Publication Details
- Proceedings of the 18th ACM conference on information and knowledge management, pp 1681-1684
- Conference
- 18th ACM conference on information and knowledge management, 18th
- Series
- CIKM '09
- Publisher
- Association for Computing Machinery (ACM)
- Number of pages
- 1
- Resource Type
- Conference proceeding
- Language
- English
- Academic Unit
- Information Science; Radiation Oncology (and Nuclear Medicine); Pathology (and Laboratory Medicine)
- Scopus ID
- 2-s2.0-74549175160
- Other Identifier
- 991019173808404721