“PageRank” for Argument Relevance

Publikation: Beitrag in Buch/Bericht/Sammelwerk/KonferenzbandAufsatz in KonferenzbandForschungPeer-Review

Autorschaft

Externe Organisationen

  • Bauhaus-Universität Weimar
Forschungs-netzwerk anzeigen

Details

OriginalspracheEnglisch
Titel des SammelwerksProceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics, Long Papers
Herausgeber/-innenPhil Blunsom, Alexander Koller, Mirella Lapata
Seiten1117-1127
Seitenumfang11
PublikationsstatusVeröffentlicht - Apr. 2017
Extern publiziertJa
Veranstaltung15th Conference of the European Chapter of the Association for Computational Linguistics, EACL 2017 - Valencia, Spanien
Dauer: 3 Apr. 20177 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 Sachgebiete

Zitieren

“PageRank” for Argument Relevance. / Wachsmuth, Henning; Stein, Benno; Ajjour, Yamen.
Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics, Long Papers. Hrsg. / Phil Blunsom; Alexander Koller; Mirella Lapata. 2017. S. 1117-1127.

Publikation: Beitrag in Buch/Bericht/Sammelwerk/KonferenzbandAufsatz in KonferenzbandForschungPeer-Review

Wachsmuth, H, Stein, B & Ajjour, Y 2017, “PageRank” for Argument Relevance. in P Blunsom, A Koller & M Lapata (Hrsg.), Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics, Long Papers. S. 1117-1127, 15th Conference of the European Chapter of the Association for Computational Linguistics, EACL 2017, Valencia, Spanien, 3 Apr. 2017. https://doi.org/10.18653/v1/e17-1105
Wachsmuth, H., Stein, B., & Ajjour, Y. (2017). “PageRank” for Argument Relevance. In P. Blunsom, A. Koller, & M. Lapata (Hrsg.), Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics, Long Papers (S. 1117-1127) https://doi.org/10.18653/v1/e17-1105
Wachsmuth H, Stein B, Ajjour Y. “PageRank” for Argument Relevance. in Blunsom P, Koller A, Lapata M, Hrsg., Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics, Long Papers. 2017. S. 1117-1127 doi: 10.18653/v1/e17-1105
Wachsmuth, Henning ; Stein, Benno ; Ajjour, Yamen. / “PageRank” for Argument Relevance. Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics, Long Papers. Hrsg. / Phil Blunsom ; Alexander Koller ; Mirella Lapata. 2017. S. 1117-1127
Download
@inproceedings{cbe470aaf52c46b9a36e2c9c89357d06,
title = "“PageRank” for Argument Relevance",
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.",
author = "Henning Wachsmuth and Benno Stein and Yamen Ajjour",
year = "2017",
month = apr,
doi = "10.18653/v1/e17-1105",
language = "English",
isbn = "9781510838604",
pages = "1117--1127",
editor = "Phil Blunsom and Alexander Koller and Mirella Lapata",
booktitle = "Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics, Long Papers",
note = "15th Conference of the European Chapter of the Association for Computational Linguistics, EACL 2017 ; Conference date: 03-04-2017 Through 07-04-2017",

}

Download

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 -

Von denselben Autoren