Lexical classification is one of the most widely investigated fields in (computational) linguistic and Natural language Processing. Adjectives play a significant role both in classification tasks and in applications as sentiment analysis. In this paper we propose MORE (coMparable fORm dEtector), a simple algorithm for lexical classification of comparable adjectives. The algorithm is ecient in time. The method is a specific unsupervised learning technique. We verify results against a reference standard built from 80 manually annotated lists of adjective. The algorithm exhibits an accuracy of 76%.
A simple algorithm for the lexical classification of comparable adjectives
Claudio Tomazzoli;
2018-01-01
Abstract
Lexical classification is one of the most widely investigated fields in (computational) linguistic and Natural language Processing. Adjectives play a significant role both in classification tasks and in applications as sentiment analysis. In this paper we propose MORE (coMparable fORm dEtector), a simple algorithm for lexical classification of comparable adjectives. The algorithm is ecient in time. The method is a specific unsupervised learning technique. We verify results against a reference standard built from 80 manually annotated lists of adjective. The algorithm exhibits an accuracy of 76%.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
