Search Results for "c# porter stemming algorithm"

"Natural" is a general natural language facility for nodejs. It offers a broad range of functionalities for natural language processing. Tokenizing, stemming, classification, phonetics, tf-idf, WordNet, string similarity, and some inflections are currently supported. It’s still in the early stages, so we’re very interested in bug reports, contributions and the like. Note that many algorithms from Rob Ellis’s node-nltools are being merged into this project and will be maintained from here onward...

This is an ooRexx line-by-line port from Ansi-C to ooRexx of the stemming routine published by Martin Porter 1980. The original source code from Porter has been commented out and emulated by the corresponding (oo)Rexx code as far as possible. This is not an example of good or fast (oo)Rexx programming, it is merely a demonstration of the Porter stemming routine ported to ooRexx, use and modify as necessary. Input to the program is a textfile with words to be stemmed, one per line. Output...

Word stemming library (Porter algorithms). Stemming refers to stripping a word down to a simpler prefix. This is useful for "fuzzy" word matching by finding common prefixes between similar words.

A collection of implementations of the Lovins stemmer as described in "Development of a Stemming Algorithm" by Julie Beth Lovins (published in "Mechanical translation and computational linguistics", 11:22-31, 1968).

The Stemmer class transforms a word into its root form. The input word is provided from the add() methods. The stem() method will return the stem as will toString() after stem() has been called). The clear() method will wipe the Stemmer buffer and allow a new word to be input. This version extends Martin Porter's original stemming algorithm by allowing capital letters to exist in words. This version should also be plugged in wherever the old algorithm is used with few accommodations...