Dataset Open Access

# Dataset for training classifiers of comparative sentences

Alexander Panchenko; Mirco Franzek; Chris Biemann

### JSON Export

{
"files": [
{
"self": "https://zenodo.org/api/files/4d433f67-914c-4bb2-8a6c-5d68ca78df3a/ACQuA%20-%20CompArg%20-%20release%20v1%20-%20dataset%20of%20comparative%20sentences%20-%20all-data.csv"
},
"checksum": "md5:2ac337c1677ca94de4200f5357a43eb3",
"bucket": "4d433f67-914c-4bb2-8a6c-5d68ca78df3a",
"key": "ACQuA - CompArg - release v1 - dataset of comparative sentences - all-data.csv",
"type": "csv",
"size": 3231554
}
],
"owners": [
25332
],
"doi": "10.5281/zenodo.3237552",
"stats": {
"unique_views": 747.0,
"views": 793.0,
"version_views": 793.0,
"version_unique_views": 747.0,
"volume": 18959527318.0,
"version_volume": 18959527318.0
},
"doi": "https://doi.org/10.5281/zenodo.3237552",
"conceptdoi": "https://doi.org/10.5281/zenodo.3237551",
"bucket": "https://zenodo.org/api/files/4d433f67-914c-4bb2-8a6c-5d68ca78df3a",
"html": "https://zenodo.org/record/3237552",
"latest_html": "https://zenodo.org/record/3237552",
"latest": "https://zenodo.org/api/records/3237552"
},
"conceptdoi": "10.5281/zenodo.3237551",
"created": "2019-06-03T12:36:13.745626+00:00",
"updated": "2020-01-24T19:25:11.979523+00:00",
"conceptrecid": "3237551",
"revision": 5,
"id": 3237552,
"access_right_category": "success",
"doi": "10.5281/zenodo.3237552",
"description": "<p><br>\nAs there was no large publicly available cross-domain dataset for comparative argument mining, we create one composed of sentences, potentially annotated with BETTER&nbsp;/ WORSE&nbsp;markers (the first object is better / worse than the second object) or NONE&nbsp;(the sentence does not contain a comparison of the target objects). The BETTER sentences stand for a pro-argument in favor of the first compared object and WORSE-sentences represent a con-argument and favor the second object.&nbsp;</p>\n\n<p>We aim for minimizing dataset domain-specific biases in order to capture the nature of comparison and not the nature of the particular domains, thus decided to control the specificity of domains by the selection of comparison targets. We hypothesized and could confirm in preliminary experiments that comparison targets usually have a common hypernym (i.e., are instances of the same class), which we utilized for selection of the compared objects pairs.&nbsp;</p>\n\n<p>The most specific domain we choose, is computer science&nbsp;with comparison targets like programming languages, database products and technology standards such as Bluetooth or Ethernet. Many computer science concepts can be compared objectively (e.g., on transmission speed or suitability for certain applications). The objects for this domain were manually extracted from List of-articles at Wikipedia. In the annotation process, annotators were asked to only label sentences from this domain if they had some basic knowledge in computer science.&nbsp;</p>\n\n<p>The second, broader domain is brands. It contains objects of different types (e.g., cars, electronics, and food). As brands are present in everyday life, anyone should be able to label the majority of sentences containing well-known brands such as Coca-Cola or Mercedes. Again, targets for this domain were manually extracted from List of&#39;&#39;-articles at Wikipedia.</p>\n\n<p>The third domain is not restricted to any topic: random. For each of 24~randomly selected seed words 10 similar words were collected based on the distributional similarity API of JoBimText (http://www.jobimtext.org). Seed words created using randomlists.com: book, car, carpenter, cellphone, Christmas, coffee, cork, Florida, hamster, hiking, Hoover, Metallica, NBC, Netflix, ninja, pencil, salad, soccer, Starbucks, sword, Tolkien, wine, wood, XBox, Yale.</p>\n\n<p>Especially for brands and computer science, the resulting object lists were large (4493 in brands and 1339 in computer science). In a manual inspection, low-frequency and ambiguous objects were removed from all object lists (e.g., RAID&nbsp;(a hardware concept) and Unity&nbsp;(a game engine) are also regularly used nouns). The remaining objects were combined to pairs. For each object type (seed Wikipedia list page or the seed word), all possible combinations were created. These pairs were then used to find sentences containing both objects. The aforementioned approaches to selecting compared objects pairs tend minimize inclusion of the domain specific data, but do not solve the problem fully though. We keep open a question of extending dataset with diverse object pairs including abstract concepts for future work. &nbsp; &nbsp;</p>\n\n<p>As for the sentence mining, we used the publicly available index of dependency-parsed sentences from the Common Crawl corpus&nbsp;containing over 14 billion English sentences filtered for duplicates. This index was queried for sentences containing both objects of each pair. For 90% of the pairs, we also added comparative cue words (better, easier, faster, nicer, wiser, cooler, decent, safer, superior, solid, terrific, worse, harder, slower, poorly, uglier, poorer, lousy, nastier, inferior, mediocre) to the query in order to bias the selection towards comparisons but at the same time admit comparisons that do not contain any of the anticipated cues. This was necessary as a random sampling would have resulted in only a very tiny fraction of comparisons. Note that even sentences containing a cue word do not necessarily express a comparison between the desired targets (dog vs. cat: He&#39;s the best pet that you can get, better&nbsp;than a dog or cat.). It is thus especially crucial to enable a classifier to learn not to rely on the existence of clue words only (very likely in a random sample of sentences with very few comparisons). For our corpus, we keep pairs with at least 100&nbsp;retrieved sentences.</p>\n\n<p>From all sentences of those pairs, 2500 for each category were randomly sampled as candidates for a crowdsourced annotation that we conducted on figure-eight.com&nbsp;in several small batches. Each sentence was annotated by at least five trusted workers. We ranked annotations by confidence, which is the figure-eight internal measure of combining annotator trust and voting, and discarded annotations with a confidence below 50%. Of all annotated items, 71% received unanimous votes and for over 85% at least 4 out of 5 workers agreed -- rendering the collection procedure aimed at ease of annotation successful.</p>\n\n<p>The final dataset contains 7199 sentences with 271 distinct object pairs. The majority of sentences (over 72%) are non-comparative despite biasing the selection with cue words; in 70% of the comparative sentences, the favored target is named first.</p>\n\n<p>You can browse though the data here:&nbsp;https://docs.google.com/spreadsheets/d/1U8i6EU9GUKmHdPnfwXEuBxi0h3aiRCLPRC-3c9ROiOE/edit?usp=sharing&nbsp;</p>\n\n<p>Full description of the dataset is available in the <a href=\"https://arxiv.org/abs/1809.06152\">workshop paper at ACL 2019 conference</a>.&nbsp;Please cite this paper if you use the data:&nbsp;Franzek, Mirco, Alexander Panchenko, and Chris Biemann. &quot;Categorization of Comparative Sentences for Argument Mining.&quot;&nbsp;<em>arXiv preprint arXiv:1809.06152</em>&nbsp;(2018).</p>\n\n<pre>@inproceedings{franzek2018categorization,\n  title={Categorization of Comparative Sentences for Argument Mining},\n  author={Panchenko, Alexander and Bondarenko, and Franzek, Mirco and Hagen, Matthias and Biemann, Chris},\n  booktitle={Proceedings of the 6th Workshop on Argument Mining at ACL&#39;2019},\n  year={2019},\n  address={Florence, Italy}\n}</pre>\n\n<p>&nbsp;</p>\n\n<p>&nbsp;</p>",
"id": "CC-BY-4.0"
},
"title": "Dataset for training classifiers of comparative sentences",
"relations": {
"version": [
{
"count": 1,
"index": 0,
"parent": {
"pid_type": "recid",
"pid_value": "3237551"
},
"is_last": true,
"last_child": {
"pid_type": "recid",
"pid_value": "3237552"
}
}
]
},
"keywords": [
"Comparative sentences",
"Argument mining",
"CAM"
],
"publication_date": "2019-06-03",
"creators": [
{
"affiliation": "University of Hamburg",
"name": "Alexander Panchenko"
},
{
"affiliation": "University of Hamburg",
"name": "Mirco Franzek"
},
{
"affiliation": "University of Hamburg",
"name": "Chris Biemann"
}
],
"access_right": "open",
"resource_type": {
"type": "dataset",
"title": "Dataset"
},
"related_identifiers": [
{
"scheme": "doi",
"identifier": "10.5281/zenodo.3237551",
"relation": "isVersionOf"
}
]
}
}`
793
5,867
views