# 1 Debates

Note: The authors did not respond to requests to make this dataset available. While the debate transcripts are publicly available, the entity relationship data generated in “https://doi.org/10.1111/cgf.13181” is not. Origin Notes: Created by researchers at the University of Konstanz for the LingVis framework (https://lingvis.io/) and VisArgue project (http://www.visargue.uni-konstanz.de/en/). First appeared in “https://doi.org/10.1111/cgf.13181”. graph features handled: Categorical nodes, Directed edges, Labeled nodes, Multigraph, Weighted edges Graph features in papers: categorical nodes,directed edges,labeled nodes,weighted edges Origin Paper: NEREx: Named-Entity Relationship Exploration in Multi-Party Conversations (https://www.notion.so/NEREx-Named-Entity-Relationship-Exploration-in-Multi-Party-Conversations-12a40012aece4cec81a8a2714c38d6cf?pvs=21) Appeared in years: 2017 Type of Collection: Lost/Unavailable is it stored properly?: No must be analyzed: No In repo?: No cleaned format?: No duplicate?: No link works?: No Added in paper: No Origin paper plaintext: NEREx: Named-Entity Relationship Exploration in Multi-Party Conversations Page id: 54eb2cd4ba2c48eb945bd49e5f4bbf4f unavailable/skip: Yes Cleaned ALL data: No first look: Yes Related to Literature - Algorithm (Dataset tag relations) 1: NEREx: Named-Entity Relationship Exploration in Multi-Party Conversations (../Benchmark%20sets%200cc6b5e454304aec98f3b59b1a720476/Literature%20ad87f14e7097454fb2f784e2c8a2797a/Literature%20-%20Algorithm%2012e01bfc60a84007aa7d2d34293e123d/NEREx%20Named-Entity%20Relationship%20Exploration%20in%20Mul%200c839bcf912a474595a556b7791ff4c2.md)

# 2 Body

### Description from Literature

From “NEREx: Named-Entity Relationship Exploration in Multi-Party Conversations”:

> In order to explore the relations between entities, we use a distance-restricted model for creating entity-pairs. As described in Section 2, prior work considers relations between entities either as semantic relations based on linguistic knowledge or regards two entities as related due to their presence in the same document. The often ungrammatical structure of utterances in verbatim text transcripts (including non-standard lexical items, syntactic patterns, interruptions, repetitions, and crosstalk) requires a simple extralinguistic model. To overcome these limitations, we introduce a model that bounds the scope in which we consider two entities to be related, using a distance threshold (maxDist). Our method creates a pair of entities if the entities appear in the same sentences within maxDist words of one another.

> However, not only are frequent entity-pairs important, but also pairs that are semantically similar (e.g., cut $5 trillion, cut $4 trillion). These often present opposing speaker opinions about a given topic. To maximize the chance that entity-pairs represent true semantic relations, we set the default value of maxDist to a low value (5 words). To vary the granularity of the analysis, the parameter can be changed interactively depending on the analysis task and data. Nevertheless, some infrequent longer-distance entity-pairs are discovered which do not represent salient relations. To reduce their impact, we calculate the average observed distance (in words) for each entity pair. We use both frequency and average distance in the visualization to reflect the strength of the entity-pair.

### Example Figures

From “NEREx: Named-Entity Relationship Exploration in Multi-Party Conversations”:

cgf13181-fig-0004-m.jpg

Entity graph of the first first presidential debate between Trump and Clinton

cgf13181-fig-0006-m.jpg

Entity graph of the same debate, focusing on the concept of taxes