Award Date

12-2010

Degree Type

Thesis

Degree Name

Master of Science in Computer Science

Department

Computer Science

First Committee Member

Kazem Taghva, Chair

Second Committee Member

Ajoy K.Datta

Third Committee Member

Laxmi Gewali

Graduate Faculty Representative

Venkatesan Mutukumar

Number of Pages

48

Abstract

Automated stemming is the process of reducing words to their roots. The stemmed words are typically used to overcome the mismatch problems associated with text searching.


In this thesis, we report on the various methods developed for stemming. In particular, we show the effectiveness of n-gram stemming methods on a collection of documents.

Keywords

Computational linguistics; English language — Data processing; English language — Roots; Natural language processing (Computer science)

Disciplines

Computational Linguistics | Computer Engineering | Library and Information Science

Language

English


Share

COinS