C# 클래스 Lucene.Net.Analysis.Fr.FrenchStemmer

Stems the given term to a unique discriminator.

Delete a suffix searched in zone "source" if preceded by the prefix

Delete a suffix searched in zone "source" if preceded by prefix
or replace it with the replace string if preceded by the prefix in the zone "from"
or delete the suffix if specified

Delete a search string within the source zone

Delete a suffix searched in zone "source" if zone "from" contains prefix + search string

Delete a suffix searched in zone "source" if the preceding letter is (or isn't) a vowel

Checks a term if it can be processed correctly.

Test if a char is a french vowel, including accentuated ones

Replace a search string with another within the source zone

Retrieve the "R zone" (1 or 2 depending on the buffer) and return the corresponding string
"R is the region after the first non-vowel following a vowel or is the null region at the end of the word if there is no such non-vowel"

Retrieve the "RV zone" from a buffer an return the corresponding string
"If the word begins with two vowels, RV is the region after the third letter, otherwise the region after the first vowel not at the beginning of the word, or the end of the word if these positions cannot be found."

Sets the search region Strings
it needs to be done each time the buffer was modified

First step of the Porter Algorithm
refer to http://snowball.sourceforge.net/french/stemmer.html for an explanation

Second step (A) of the Porter Algorithm
Will be performed if nothing changed from the first step or changed were done in the amment, emment, ments or ment suffixes
refer to http://snowball.sourceforge.net/french/stemmer.html for an explanation

Second step (B) of the Porter Algorithm
Will be performed if step 2 A was performed unsuccessfully
refer to http://snowball.sourceforge.net/french/stemmer.html for an explanation

Third step of the Porter Algorithm
refer to http://snowball.sourceforge.net/french/stemmer.html for an explanation

Fourth step of the Porter Algorithm
refer to http://snowball.sourceforge.net/french/stemmer.html for an explanation

Fifth step of the Porter Algorithm
refer to http://snowball.sourceforge.net/french/stemmer.html for an explanation

Sixth (and last!) step of the Porter Algorithm
refer to http://snowball.sourceforge.net/french/stemmer.html for an explanation

Turns u and i preceded AND followed by a vowel to UpperCase
Turns y preceded OR followed by a vowel to UpperCase
Turns u preceded by q to UpperCase