Datasets:
Tasks:
Text Classification
Modalities:
Text
Formats:
csv
Languages:
Romanian
Size:
10K - 100K
License:
Update README.md
Browse files
README.md
CHANGED
@@ -1,3 +1,33 @@
|
|
1 |
-
---
|
2 |
-
license: cc-by-sa-4.0
|
3 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
---
|
2 |
+
license: cc-by-sa-4.0
|
3 |
+
task_categories:
|
4 |
+
- text-classification
|
5 |
+
language:
|
6 |
+
- ro
|
7 |
+
---
|
8 |
+
|
9 |
+
## Sentiment Analysis Data for the Romanian Language
|
10 |
+
|
11 |
+
**Dataset Description:**
|
12 |
+
This dataset contains a sentiment analysis dataset from Tache et al. (2021).
|
13 |
+
|
14 |
+
**Data Structure:**
|
15 |
+
The data was used for the project on [improving word embeddings with graph knowledge for Low Resource Languages](https://github.com/pyRis/retrofitting-embeddings-lrls?tab=readme-ov-file).
|
16 |
+
|
17 |
+
**Citation:**
|
18 |
+
```bibtex
|
19 |
+
@inproceedings{tache-etal-2021-clustering,
|
20 |
+
title = "Clustering Word Embeddings with Self-Organizing Maps. Application on {L}a{R}o{S}e{D}a - A Large {R}omanian Sentiment Data Set",
|
21 |
+
author = "Tache, Anca and
|
22 |
+
Mihaela, Gaman and
|
23 |
+
Ionescu, Radu Tudor",
|
24 |
+
booktitle = "Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume",
|
25 |
+
month = apr,
|
26 |
+
year = "2021",
|
27 |
+
address = "Online",
|
28 |
+
publisher = "Association for Computational Linguistics",
|
29 |
+
url = "https://www.aclweb.org/anthology/2021.eacl-main.81",
|
30 |
+
pages = "949--956",
|
31 |
+
abstract = "Romanian is one of the understudied languages in computational linguistics, with few resources available for the development of natural language processing tools. In this paper, we introduce LaRoSeDa, a Large Romanian Sentiment Data Set, which is composed of 15,000 positive and negative reviews collected from the largest Romanian e-commerce platform. We employ two sentiment classification methods as baselines for our new data set, one based on low-level features (character n-grams) and one based on high-level features (bag-of-word-embeddings generated by clustering word embeddings with k-means). As an additional contribution, we replace the k-means clustering algorithm with self-organizing maps (SOMs), obtaining better results because the generated clusters of word embeddings are closer to the Zipf{'}s law distribution, which is known to govern natural language. We also demonstrate the generalization capacity of using SOMs for the clustering of word embeddings on another recently-introduced Romanian data set, for text categorization by topic.",
|
32 |
+
}
|
33 |
+
```
|