STOP WORD DETECTION AS A BINARY CLASSIFICATION PROBLEM

Volume: 18 Number: 2 June 30, 2017
EN

STOP WORD DETECTION AS A BINARY CLASSIFICATION PROBLEM

Abstract

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.

Keywords

Details

Primary Language

English

Subjects

Engineering

Journal Section

-

Publication Date

June 30, 2017

Submission Date

October 12, 2016

Acceptance Date

-

Published in Issue

Year 2017 Volume: 18 Number: 2

APA
Kumova Metin, S., & Karaoğlan, B. (2017). STOP WORD DETECTION AS A BINARY CLASSIFICATION PROBLEM. Anadolu University Journal of Science and Technology A - Applied Sciences and Engineering, 18(2), 346-359. https://doi.org/10.18038/aubtda.322136
AMA
1.Kumova Metin S, Karaoğlan B. STOP WORD DETECTION AS A BINARY CLASSIFICATION PROBLEM. AUJST-A. 2017;18(2):346-359. doi:10.18038/aubtda.322136
Chicago
Kumova Metin, Senem, and Bahar Karaoğlan. 2017. “STOP WORD DETECTION AS A BINARY CLASSIFICATION PROBLEM”. Anadolu University Journal of Science and Technology A - Applied Sciences and Engineering 18 (2): 346-59. https://doi.org/10.18038/aubtda.322136.
EndNote
Kumova Metin S, Karaoğlan B (June 1, 2017) STOP WORD DETECTION AS A BINARY CLASSIFICATION PROBLEM. Anadolu University Journal of Science and Technology A - Applied Sciences and Engineering 18 2 346–359.
IEEE
[1]S. Kumova Metin and B. Karaoğlan, “STOP WORD DETECTION AS A BINARY CLASSIFICATION PROBLEM”, AUJST-A, vol. 18, no. 2, pp. 346–359, June 2017, doi: 10.18038/aubtda.322136.
ISNAD
Kumova Metin, Senem - Karaoğlan, Bahar. “STOP WORD DETECTION AS A BINARY CLASSIFICATION PROBLEM”. Anadolu University Journal of Science and Technology A - Applied Sciences and Engineering 18/2 (June 1, 2017): 346-359. https://doi.org/10.18038/aubtda.322136.
JAMA
1.Kumova Metin S, Karaoğlan B. STOP WORD DETECTION AS A BINARY CLASSIFICATION PROBLEM. AUJST-A. 2017;18:346–359.
MLA
Kumova Metin, Senem, and Bahar Karaoğlan. “STOP WORD DETECTION AS A BINARY CLASSIFICATION PROBLEM”. Anadolu University Journal of Science and Technology A - Applied Sciences and Engineering, vol. 18, no. 2, June 2017, pp. 346-59, doi:10.18038/aubtda.322136.
Vancouver
1.Senem Kumova Metin, Bahar Karaoğlan. STOP WORD DETECTION AS A BINARY CLASSIFICATION PROBLEM. AUJST-A. 2017 Jun. 1;18(2):346-59. doi:10.18038/aubtda.322136

Cited By