Search Results for "ns2 code with algorithm"

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....

Use this class to achieve efficient and mostly exact word hyphenations. Currently the only language supported is German, but it can very easily be adapted to support other languages. This library spans ~370 lines of C++ code. At the moment there is no real documentation, pleas refer to the comments in the code, they should be quite helpful. A sample is also included. This library is not based on any algorithm published on the internet or elsewhere and it works without a dictionary. The Library is written in C++ and is tested under GCC 4.7, 4.8 and 4.9 [Use it in any way you want, including commercial work, but please include my name and a link to this page]

This tool is made to score machine translation performance with the TER metric. This code is based on Snover's algorithm.

...It relates morphological variant words to corresponding common root. For example "પ્રતિઉપયોગી" is word which has stem " ઉપયોગ". Stemmers are language specific tools. The design of a stemming algorithm requires a significant level of linguistic expertise. There has been lot of significant work in the development and evaluation of stemmer for non-Indian languages, but very less or no significant work has been done on Indian front especially for Gujarati language.The code of this stemmer is based on algorithm designed under guidance of Prof. ...

...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 necessary. The code in this version is more readable (in my opinion) than the old version. There is a main at the bottom that shows how to use the Stemmer.