Lexic.us

Definition of Stemming algorithm

1. Noun. An algorithm for removing inflectional and derivational endings in order to reduce word forms to a common stem.

Lexicographical Neighbors of Stemming Algorithm

Literary usage of Stemming algorithm

Below you will find example usage of this term as found in modern and/or classical literature:

1. Overview of the Third Text Retrieval Conference (Trec-3) edited by D. K. Harmon (1996)
"Word-stemming algorithm — Since the weight of a token is directly proportional to the number of times it occurs in a sample, use of a word- stemming ..."

2. First Text Retrieval Conference (Trec-1): Proceedings by D. K. Harman (1995)
"The stopwords (total 2529 stopwords on the list) are deleted, and keywords are stemmed using the Porter stemming algorithm which was implemented by Fox ..."

3. First Text Retrieval Conference (Trec-1): Proceedings by D. K. Harman (1995)
"The stopwords (total 2529 stopwords on the list) are deleted, and keywords are stemmed using the Porter stemming algorithm which was implemented by Fox ..."

4. Text Retrieval Conference, 4thedited by D. K. Harman edited by D. K. Harman (1998)
"... Structures Methods Used to build Data Structures - Length (in words) of the stopword list: 571 - Controlled Vocabulary? : no - stemming algorithm: yes, ..."

5. The Information Universe: Issues in Informing Science and Information by Informing Science Institute, Eli Cohen, Ed. (2006)
"Suffix Tree Clustering is organized into three logical steps: • The first step is document cleaning, where a light stemming algorithm is used to reduce ..."

Other Resources: