Details
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics, Long Papers |
| Editors | Phil Blunsom, Alexander Koller, Mirella Lapata |
| Pages | 1117-1127 |
| Number of pages | 11 |
| Publication status | Published - Apr 2017 |
| Externally published | Yes |
| Event | 15th Conference of the European Chapter of the Association for Computational Linguistics, EACL 2017 - Valencia, Spain Duration: 3 Apr 2017 → 7 Apr 2017 |
Abstract
Future search engines are expected to deliver pro and con arguments in response to queries on controversial topics. While argument mining is now in the focus of research, the question of how to retrieve the relevant arguments remains open. This paper proposes a radical model to assess relevance objectively at web scale: The relevance of an argument's conclusion is decided by what other arguments reuse it as a premise. We build an argument graph for this model that we analyze with a recursive weighting scheme, adapting key ideas of PageRank. In experiments on a large ground-truth argument graph, the resulting relevance scores correlate with human average judgments. We outline what natural language challenges must be faced at web scale in order to stepwise bring argument relevance to web search engines.
ASJC Scopus subject areas
- Social Sciences(all)
- Linguistics and Language
- Arts and Humanities(all)
- Language and Linguistics
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics, Long Papers. ed. / Phil Blunsom; Alexander Koller; Mirella Lapata. 2017. p. 1117-1127.
Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
}
TY - GEN
T1 - “PageRank” for Argument Relevance
AU - Wachsmuth, Henning
AU - Stein, Benno
AU - Ajjour, Yamen
PY - 2017/4
Y1 - 2017/4
N2 - Future search engines are expected to deliver pro and con arguments in response to queries on controversial topics. While argument mining is now in the focus of research, the question of how to retrieve the relevant arguments remains open. This paper proposes a radical model to assess relevance objectively at web scale: The relevance of an argument's conclusion is decided by what other arguments reuse it as a premise. We build an argument graph for this model that we analyze with a recursive weighting scheme, adapting key ideas of PageRank. In experiments on a large ground-truth argument graph, the resulting relevance scores correlate with human average judgments. We outline what natural language challenges must be faced at web scale in order to stepwise bring argument relevance to web search engines.
AB - Future search engines are expected to deliver pro and con arguments in response to queries on controversial topics. While argument mining is now in the focus of research, the question of how to retrieve the relevant arguments remains open. This paper proposes a radical model to assess relevance objectively at web scale: The relevance of an argument's conclusion is decided by what other arguments reuse it as a premise. We build an argument graph for this model that we analyze with a recursive weighting scheme, adapting key ideas of PageRank. In experiments on a large ground-truth argument graph, the resulting relevance scores correlate with human average judgments. We outline what natural language challenges must be faced at web scale in order to stepwise bring argument relevance to web search engines.
UR - http://www.scopus.com/inward/record.url?scp=85021652808&partnerID=8YFLogxK
U2 - 10.18653/v1/e17-1105
DO - 10.18653/v1/e17-1105
M3 - Conference contribution
AN - SCOPUS:85021652808
SN - 9781510838604
SP - 1117
EP - 1127
BT - Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics, Long Papers
A2 - Blunsom, Phil
A2 - Koller, Alexander
A2 - Lapata, Mirella
T2 - 15th Conference of the European Chapter of the Association for Computational Linguistics, EACL 2017
Y2 - 3 April 2017 through 7 April 2017
ER -