Name
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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1145/1645953.1646203 | CIKM |
Keywords | Field | DocType |
non-factoid question answering,redundant answer,negative voting,ranking iteration,answer coverage,typical graph,graph connectivity,non-factoid question,lower inter-sentence similarity,ranking model,candidate answer,higher inter-sentence similarity,question answering | Data mining,Social connectedness,Question answering,Ranking,Information retrieval,Voting,Computer science,Novelty,Strongly connected component,Connectivity,Factoid | Conference |
Citations | PageRank | References |
4 | 0.40 | 15 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Palakorn Achananuparp | 1 | 302 | 23.16 |
| Christopher C. Yang | 2 | 1590 | 138.09 |
| Xin Chen | 3 | 58 | 3.36 |