1 package org.apache.lucene.analysis.fr;
4 * Licensed to the Apache Software Foundation (ASF) under one or more
5 * contributor license agreements. See the NOTICE file distributed with
6 * this work for additional information regarding copyright ownership.
7 * The ASF licenses this file to You under the Apache License, Version 2.0
8 * (the "License"); you may not use this file except in compliance with
9 * the License. You may obtain a copy of the License at
11 * http://www.apache.org/licenses/LICENSE-2.0
13 * Unless required by applicable law or agreed to in writing, software
14 * distributed under the License is distributed on an "AS IS" BASIS,
15 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
16 * See the License for the specific language governing permissions and
17 * limitations under the License.
21 * This algorithm is updated based on code located at:
22 * http://members.unine.ch/jacques.savoy/clef/
24 * Full copyright for that code follows:
28 * Copyright (c) 2005, Jacques Savoy
29 * All rights reserved.
31 * Redistribution and use in source and binary forms, with or without
32 * modification, are permitted provided that the following conditions are met:
34 * Redistributions of source code must retain the above copyright notice, this
35 * list of conditions and the following disclaimer. Redistributions in binary
36 * form must reproduce the above copyright notice, this list of conditions and
37 * the following disclaimer in the documentation and/or other materials
38 * provided with the distribution. Neither the name of the author nor the names
39 * of its contributors may be used to endorse or promote products derived from
40 * this software without specific prior written permission.
42 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
43 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
44 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
45 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
46 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
47 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
48 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
49 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
50 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
51 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
52 * POSSIBILITY OF SUCH DAMAGE.
55 import static org.apache.lucene.analysis.util.StemmerUtil.*;
58 * Light Stemmer for French.
60 * This stemmer implements the "UniNE" algorithm in:
61 * <i>Light Stemming Approaches for the French, Portuguese, German and Hungarian Languages</i>
64 public class FrenchLightStemmer {
66 public int stem(char s[], int len) {
67 if (len > 5 && s[len-1] == 'x') {
68 if (s[len-3] == 'a' && s[len-2] == 'u' && s[len-4] != 'e')
73 if (len > 3 && s[len-1] == 'x')
76 if (len > 3 && s[len-1] == 's')
79 if (len > 9 && endsWith(s, len, "issement")) {
85 if (len > 8 && endsWith(s, len, "issant")) {
91 if (len > 6 && endsWith(s, len, "ement")) {
93 if (len > 3 && endsWith(s, len, "ive")) {
100 if (len > 11 && endsWith(s, len, "ficatrice")) {
107 if (len > 10 && endsWith(s, len, "ficateur")) {
114 if (len > 9 && endsWith(s, len, "catrice")) {
119 //s[len-1] = 'r' <-- unnecessary, already 'r'.
123 if (len > 8 && endsWith(s, len, "cateur")) {
132 if (len > 8 && endsWith(s, len, "atrice")) {
139 if (len > 7 && endsWith(s, len, "ateur")) {
146 if (len > 6 && endsWith(s, len, "trice")) {
153 if (len > 5 && endsWith(s, len, "ième"))
154 return norm(s, len-4);
156 if (len > 7 && endsWith(s, len, "teuse")) {
162 if (len > 6 && endsWith(s, len, "teur")) {
168 if (len > 5 && endsWith(s, len, "euse"))
169 return norm(s, len-2);
171 if (len > 8 && endsWith(s, len, "ère")) {
177 if (len > 7 && endsWith(s, len, "ive")) {
184 (endsWith(s, len, "folle") ||
185 endsWith(s, len, "molle"))) {
191 if (len > 9 && endsWith(s, len, "nnelle"))
192 return norm(s, len-5);
194 if (len > 9 && endsWith(s, len, "nnel"))
195 return norm(s, len-3);
197 if (len > 4 && endsWith(s, len, "ète")) {
202 if (len > 8 && endsWith(s, len, "ique"))
205 if (len > 8 && endsWith(s, len, "esse"))
206 return norm(s, len-3);
208 if (len > 7 && endsWith(s, len, "inage"))
209 return norm(s, len-3);
211 if (len > 9 && endsWith(s, len, "isation")) {
213 if (len > 5 && endsWith(s, len, "ual"))
218 if (len > 9 && endsWith(s, len, "isateur"))
219 return norm(s, len-7);
221 if (len > 8 && endsWith(s, len, "ation"))
222 return norm(s, len-5);
224 if (len > 8 && endsWith(s, len, "ition"))
225 return norm(s, len-5);
230 private int norm(char s[], int len) {
232 for (int i = 0; i < len; i++)
236 case 'â': s[i] = 'a'; break;
237 case 'ô': s[i] = 'o'; break;
240 case 'ê': s[i] = 'e'; break;
242 case 'û': s[i] = 'u'; break;
243 case 'î': s[i] = 'i'; break;
244 case 'ç': s[i] = 'c'; break;
248 for (int i = 1; i < len; i++) {
250 len = delete(s, i--, len);
256 if (len > 4 && endsWith(s, len, "ie"))
260 if (s[len-1] == 'r') len--;
261 if (s[len-1] == 'e') len--;
262 if (s[len-1] == 'e') len--;
263 if (s[len-1] == s[len-2]) len--;