Перейти к основному содержанию
AkademIndex

Продукты

Для разработчиков

AkademBaseОткрытый API экосистемы
Статья

STOP WORD DETECTION AS A BINARY CLASSIFICATION PROBLEM

Senem Kumova MetınDepartment of Software Engineering, Faculty of Engineering, zmir University of Economics, No.156, 35330, Balova-zmir, TurkeyBahar KaraoğlanEge University, International Computer Institute (ICI), 35100 Bornova-İzmir, Turkey
2017en
ABI

Аннотация

In a wide group of languages, the stop words, which have only grammatical roles and not contributing to information content, may be simply exposed by their relatively higher occurrence frequencies. But, in agglutinative or inflectional languages, a stop word may be observed in several different surface forms due to the inflection producing noise. In this study, some of the well-known binary classification methods are employed to overcome the inflectional noise problem in stop word detection. The experiments are conducted on corpora of an agglutinative language, Turkish, in which the amount of inflection is high and a non-agglutinative language, English, in which the inflection is lower for stop words. The evaluations demonstrated that in Turkish corpus, the classification methods improve stop word detection with respect to frequency-based method. On the other hand, the classification methods applied on English corpora showed no improvement in the performance of stop word detection.

Перевод пока недоступен

Идентификаторы

Цитирования и источники

Цитирований: 4Использованных источников: 0