An implementation of the Porter2 stemming algorithm in C#
Switch branches/tags
Nothing to show
Clone or download
nemec Merge pull request #1 from urzi/master
Fixed test Stem_WithBatchData_StemsAllWordsCorrectly to iterate only once through the data source provided
Latest commit 1107a58 Oct 13, 2015
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
Porter2Stemmer.UnitTest Fixed test Stem_WithBatchData_StemsAllWordsCorrectly to iterate only … Oct 12, 2015
Porter2Stemmer First commit May 26, 2013
.gitignore Initial commit May 26, 2013
LICENSE.txt Adding license. Nov 12, 2013
Porter2Stemmer.sln First commit May 26, 2013
README.md Update README.md May 26, 2013

README.md

porter2-stemmer

An implementation of the Porter2 stemming algorithm in C#

http://snowball.tartarus.org/algorithms/english/stemmer.html

A stemmer helps convert similar words into a common form so that they can be accurately compared, regardless of tense/part of speec/etc.

For example:

friend -> friend  
friendly -> friend  
friends -> friend  
friend's -> friend