index
int64 | repo_id
string | file_path
string | content
string |
|---|---|---|---|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/stemmer
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/stemmer/snowball/Among.java
|
// CHECKSTYLE:OFF
/*
Copyright (c) 2001, Dr Martin Porter
Copyright (c) 2002, Richard Boulton
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* Neither the name of the copyright holders nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
package opennlp.tools.stemmer.snowball;
import java.lang.reflect.Method;
class Among {
public Among (String s, int substring_i, int result,
String methodname, SnowballProgram methodobject) {
this.s_size = s.length();
this.s = s.toCharArray();
this.substring_i = substring_i;
this.result = result;
this.methodobject = methodobject;
if (methodname.length() == 0) {
this.method = null;
} else {
try {
this.method = methodobject.getClass().
getDeclaredMethod(methodname, new Class[0]);
} catch (NoSuchMethodException e) {
throw new RuntimeException(e);
}
}
}
public final int s_size; /* search string */
public final char[] s; /* search string */
public final int substring_i; /* index to longest matching substring */
public final int result; /* result of the lookup */
public final Method method; /* method to use if substring matches */
public final SnowballProgram methodobject; /* object to invoke method on */
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/stemmer
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/stemmer/snowball/SnowballProgram.java
|
// CHECKSTYLE:OFF
/*
Copyright (c) 2001, Dr Martin Porter
Copyright (c) 2002, Richard Boulton
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* Neither the name of the copyright holders nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
package opennlp.tools.stemmer.snowball;
import java.lang.reflect.InvocationTargetException;
class SnowballProgram {
protected SnowballProgram()
{
current = new StringBuffer();
setCurrent("");
}
/**
* Set the current string.
*/
public void setCurrent(String value)
{
current.replace(0, current.length(), value);
cursor = 0;
limit = current.length();
limit_backward = 0;
bra = cursor;
ket = limit;
}
/**
* Get the current string.
*/
public String getCurrent()
{
String result = current.toString();
// Make a new StringBuffer. If we reuse the old one, and a user of
// the library keeps a reference to the buffer returned (for example,
// by converting it to a String in a way which doesn't force a copy),
// the buffer size will not decrease, and we will risk wasting a large
// amount of memory.
// Thanks to Wolfram Esser for spotting this problem.
current = new StringBuffer();
return result;
}
// current string
protected StringBuffer current;
protected int cursor;
protected int limit;
protected int limit_backward;
protected int bra;
protected int ket;
protected void copy_from(SnowballProgram other)
{
current = other.current;
cursor = other.cursor;
limit = other.limit;
limit_backward = other.limit_backward;
bra = other.bra;
ket = other.ket;
}
protected boolean in_grouping(char [] s, int min, int max)
{
if (cursor >= limit) return false;
char ch = current.charAt(cursor);
if (ch > max || ch < min) return false;
ch -= min;
if ((s[ch >> 3] & (0X1 << (ch & 0X7))) == 0) return false;
cursor++;
return true;
}
protected boolean in_grouping_b(char [] s, int min, int max)
{
if (cursor <= limit_backward) return false;
char ch = current.charAt(cursor - 1);
if (ch > max || ch < min) return false;
ch -= min;
if ((s[ch >> 3] & (0X1 << (ch & 0X7))) == 0) return false;
cursor--;
return true;
}
protected boolean out_grouping(char [] s, int min, int max)
{
if (cursor >= limit) return false;
char ch = current.charAt(cursor);
if (ch > max || ch < min) {
cursor++;
return true;
}
ch -= min;
if ((s[ch >> 3] & (0X1 << (ch & 0X7))) == 0) {
cursor ++;
return true;
}
return false;
}
protected boolean out_grouping_b(char [] s, int min, int max)
{
if (cursor <= limit_backward) return false;
char ch = current.charAt(cursor - 1);
if (ch > max || ch < min) {
cursor--;
return true;
}
ch -= min;
if ((s[ch >> 3] & (0X1 << (ch & 0X7))) == 0) {
cursor--;
return true;
}
return false;
}
protected boolean in_range(int min, int max)
{
if (cursor >= limit) return false;
char ch = current.charAt(cursor);
if (ch > max || ch < min) return false;
cursor++;
return true;
}
protected boolean in_range_b(int min, int max)
{
if (cursor <= limit_backward) return false;
char ch = current.charAt(cursor - 1);
if (ch > max || ch < min) return false;
cursor--;
return true;
}
protected boolean out_range(int min, int max)
{
if (cursor >= limit) return false;
char ch = current.charAt(cursor);
if (!(ch > max || ch < min)) return false;
cursor++;
return true;
}
protected boolean out_range_b(int min, int max)
{
if (cursor <= limit_backward) return false;
char ch = current.charAt(cursor - 1);
if(!(ch > max || ch < min)) return false;
cursor--;
return true;
}
protected boolean eq_s(int s_size, String s)
{
if (limit - cursor < s_size) return false;
int i;
for (i = 0; i != s_size; i++) {
if (current.charAt(cursor + i) != s.charAt(i)) return false;
}
cursor += s_size;
return true;
}
protected boolean eq_s_b(int s_size, String s)
{
if (cursor - limit_backward < s_size) return false;
int i;
for (i = 0; i != s_size; i++) {
if (current.charAt(cursor - s_size + i) != s.charAt(i)) return false;
}
cursor -= s_size;
return true;
}
protected boolean eq_v(CharSequence s)
{
return eq_s(s.length(), s.toString());
}
protected boolean eq_v_b(CharSequence s)
{ return eq_s_b(s.length(), s.toString());
}
protected int find_among(Among v[], int v_size)
{
int i = 0;
int j = v_size;
int c = cursor;
int l = limit;
int common_i = 0;
int common_j = 0;
boolean first_key_inspected = false;
while(true) {
int k = i + ((j - i) >> 1);
int diff = 0;
int common = common_i < common_j ? common_i : common_j; // smaller
Among w = v[k];
int i2;
for (i2 = common; i2 < w.s_size; i2++) {
if (c + common == l) {
diff = -1;
break;
}
diff = current.charAt(c + common) - w.s[i2];
if (diff != 0) break;
common++;
}
if (diff < 0) {
j = k;
common_j = common;
} else {
i = k;
common_i = common;
}
if (j - i <= 1) {
if (i > 0) break; // v->s has been inspected
if (j == i) break; // only one item in v
// - but now we need to go round once more to get
// v->s inspected. This looks messy, but is actually
// the optimal approach.
if (first_key_inspected) break;
first_key_inspected = true;
}
}
while(true) {
Among w = v[i];
if (common_i >= w.s_size) {
cursor = c + w.s_size;
if (w.method == null) return w.result;
boolean res;
try {
Object resobj = w.method.invoke(w.methodobject,
new Object[0]);
res = resobj.toString().equals("true");
} catch (InvocationTargetException e) {
res = false;
// FIXME - debug message
} catch (IllegalAccessException e) {
res = false;
// FIXME - debug message
}
cursor = c + w.s_size;
if (res) return w.result;
}
i = w.substring_i;
if (i < 0) return 0;
}
}
// find_among_b is for backwards processing. Same comments apply
protected int find_among_b(Among v[], int v_size)
{
int i = 0;
int j = v_size;
int c = cursor;
int lb = limit_backward;
int common_i = 0;
int common_j = 0;
boolean first_key_inspected = false;
while(true) {
int k = i + ((j - i) >> 1);
int diff = 0;
int common = common_i < common_j ? common_i : common_j;
Among w = v[k];
int i2;
for (i2 = w.s_size - 1 - common; i2 >= 0; i2--) {
if (c - common == lb) {
diff = -1;
break;
}
diff = current.charAt(c - 1 - common) - w.s[i2];
if (diff != 0) break;
common++;
}
if (diff < 0) {
j = k;
common_j = common;
} else {
i = k;
common_i = common;
}
if (j - i <= 1) {
if (i > 0) break;
if (j == i) break;
if (first_key_inspected) break;
first_key_inspected = true;
}
}
while(true) {
Among w = v[i];
if (common_i >= w.s_size) {
cursor = c - w.s_size;
if (w.method == null) return w.result;
boolean res;
try {
Object resobj = w.method.invoke(w.methodobject,
new Object[0]);
res = resobj.toString().equals("true");
} catch (InvocationTargetException e) {
res = false;
// FIXME - debug message
} catch (IllegalAccessException e) {
res = false;
// FIXME - debug message
}
cursor = c - w.s_size;
if (res) return w.result;
}
i = w.substring_i;
if (i < 0) return 0;
}
}
/* to replace chars between c_bra and c_ket in current by the
* chars in s.
*/
protected int replace_s(int c_bra, int c_ket, String s)
{
int adjustment = s.length() - (c_ket - c_bra);
current.replace(c_bra, c_ket, s);
limit += adjustment;
if (cursor >= c_ket) cursor += adjustment;
else if (cursor > c_bra) cursor = c_bra;
return adjustment;
}
protected void slice_check()
{
if (bra < 0 ||
bra > ket ||
ket > limit ||
limit > current.length()) // this line could be removed
{
System.err.println("faulty slice operation");
// FIXME: report error somehow.
/*
fprintf(stderr, "faulty slice operation:\n");
debug(z, -1, 0);
exit(1);
*/
}
}
protected void slice_from(String s)
{
slice_check();
replace_s(bra, ket, s);
}
protected void slice_from(CharSequence s)
{
slice_from(s.toString());
}
protected void slice_del()
{
slice_from("");
}
protected void insert(int c_bra, int c_ket, String s)
{
int adjustment = replace_s(c_bra, c_ket, s);
if (c_bra <= bra) bra += adjustment;
if (c_bra <= ket) ket += adjustment;
}
protected void insert(int c_bra, int c_ket, CharSequence s)
{
insert(c_bra, c_ket, s.toString());
}
/* Copy the slice into the supplied StringBuffer */
protected StringBuffer slice_to(StringBuffer s)
{
slice_check();
int len = ket - bra;
s.replace(0, s.length(), current.substring(bra, ket));
return s;
}
/* Copy the slice into the supplied StringBuilder */
protected StringBuilder slice_to(StringBuilder s)
{
slice_check();
int len = ket - bra;
s.replace(0, s.length(), current.substring(bra, ket));
return s;
}
protected StringBuffer assign_to(StringBuffer s)
{
s.replace(0, s.length(), current.substring(0, limit));
return s;
}
protected StringBuilder assign_to(StringBuilder s)
{
s.replace(0, s.length(), current.substring(0, limit));
return s;
}
/*
extern void debug(struct SN_env * z, int number, int line_count)
{ int i;
int limit = SIZE(z->p);
//if (number >= 0) printf("%3d (line %4d): '", number, line_count);
if (number >= 0) printf("%3d (line %4d): [%d]'", number, line_count,limit);
for (i = 0; i <= limit; i++)
{ if (z->lb == i) printf("{");
if (z->bra == i) printf("[");
if (z->c == i) printf("|");
if (z->ket == i) printf("]");
if (z->l == i) printf("}");
if (i < limit)
{ int ch = z->p[i];
if (ch == 0) ch = '#';
printf("%c", ch);
}
}
printf("'\n");
}
*/
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/stemmer
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/stemmer/snowball/SnowballStemmer.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.stemmer.snowball;
import opennlp.tools.stemmer.Stemmer;
public class SnowballStemmer implements Stemmer {
public enum ALGORITHM {
DANISH("dan"),
DUTCH("nld"),
ENGLISH("eng"),
FINNISH("fin"),
FRENCH("fra"),
GERMAN("deu"),
HUNGARIAN("hun"),
IRISH("gle"),
ITALIAN("ita"),
NORWEGIAN("nor"),
PORTER("porter"),
PORTUGUESE("por"),
ROMANIAN("ron"),
RUSSIAN("rus"),
SPANISH("spa"),
SWEDISH("swe"),
TURKISH("tur");
private String languageCode;
private ALGORITHM(String languageCode) {
this.languageCode = languageCode;
}
public String getLanguageCode() {
return languageCode;
}
public static ALGORITHM getByLanguageCode(String languageCode) {
for (ALGORITHM algorithm : ALGORITHM.values()) {
if (languageCode.equalsIgnoreCase(algorithm.getLanguageCode())) {
return algorithm;
}
}
throw new IllegalArgumentException("No stemmer for language code " + languageCode);
}
}
private final AbstractSnowballStemmer stemmer;
private final int repeat;
public SnowballStemmer(ALGORITHM algorithm, int repeat) {
this.repeat = repeat;
if (ALGORITHM.DANISH.equals(algorithm)) {
stemmer = new danishStemmer();
}
else if (ALGORITHM.DUTCH.equals(algorithm)) {
stemmer = new dutchStemmer();
}
else if (ALGORITHM.ENGLISH.equals(algorithm)) {
stemmer = new englishStemmer();
}
else if (ALGORITHM.FINNISH.equals(algorithm)) {
stemmer = new finnishStemmer();
}
else if (ALGORITHM.FRENCH.equals(algorithm)) {
stemmer = new frenchStemmer();
}
else if (ALGORITHM.GERMAN.equals(algorithm)) {
stemmer = new germanStemmer();
}
else if (ALGORITHM.HUNGARIAN.equals(algorithm)) {
stemmer = new hungarianStemmer();
}
else if (ALGORITHM.IRISH.equals(algorithm)) {
stemmer = new irishStemmer();
}
else if (ALGORITHM.ITALIAN.equals(algorithm)) {
stemmer = new italianStemmer();
}
else if (ALGORITHM.NORWEGIAN.equals(algorithm)) {
stemmer = new norwegianStemmer();
}
else if (ALGORITHM.PORTER.equals(algorithm)) {
stemmer = new porterStemmer();
}
else if (ALGORITHM.PORTUGUESE.equals(algorithm)) {
stemmer = new portugueseStemmer();
}
else if (ALGORITHM.ROMANIAN.equals(algorithm)) {
stemmer = new romanianStemmer();
}
else if (ALGORITHM.RUSSIAN.equals(algorithm)) {
stemmer = new russianStemmer();
}
else if (ALGORITHM.SPANISH.equals(algorithm)) {
stemmer = new spanishStemmer();
}
else if (ALGORITHM.SWEDISH.equals(algorithm)) {
stemmer = new swedishStemmer();
}
else if (ALGORITHM.TURKISH.equals(algorithm)) {
stemmer = new turkishStemmer();
}
else {
throw new IllegalStateException("Unexpected stemmer algorithm: " + algorithm.toString());
}
}
public SnowballStemmer(ALGORITHM algorithm) {
this(algorithm, 1);
}
public CharSequence stem(CharSequence word) {
stemmer.setCurrent(word.toString());
for (int i = 0; i < repeat; i++) {
stemmer.stem();
}
return stemmer.getCurrent();
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/stemmer
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/stemmer/snowball/danishStemmer.java
|
// CHECKSTYLE:OFF
/*
Copyright (c) 2001, Dr Martin Porter
Copyright (c) 2002, Richard Boulton
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* Neither the name of the copyright holders nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
// This file was generated automatically by the Snowball to Java compiler
package opennlp.tools.stemmer.snowball;
/**
* This class was automatically generated by a Snowball to Java compiler
* It implements the stemming algorithm defined by a snowball script.
*/
class danishStemmer extends opennlp.tools.stemmer.snowball.AbstractSnowballStemmer {
private final static danishStemmer methodObject = new danishStemmer ();
private final static Among a_0[] = {
new Among ( "hed", -1, 1, "", methodObject ),
new Among ( "ethed", 0, 1, "", methodObject ),
new Among ( "ered", -1, 1, "", methodObject ),
new Among ( "e", -1, 1, "", methodObject ),
new Among ( "erede", 3, 1, "", methodObject ),
new Among ( "ende", 3, 1, "", methodObject ),
new Among ( "erende", 5, 1, "", methodObject ),
new Among ( "ene", 3, 1, "", methodObject ),
new Among ( "erne", 3, 1, "", methodObject ),
new Among ( "ere", 3, 1, "", methodObject ),
new Among ( "en", -1, 1, "", methodObject ),
new Among ( "heden", 10, 1, "", methodObject ),
new Among ( "eren", 10, 1, "", methodObject ),
new Among ( "er", -1, 1, "", methodObject ),
new Among ( "heder", 13, 1, "", methodObject ),
new Among ( "erer", 13, 1, "", methodObject ),
new Among ( "s", -1, 2, "", methodObject ),
new Among ( "heds", 16, 1, "", methodObject ),
new Among ( "es", 16, 1, "", methodObject ),
new Among ( "endes", 18, 1, "", methodObject ),
new Among ( "erendes", 19, 1, "", methodObject ),
new Among ( "enes", 18, 1, "", methodObject ),
new Among ( "ernes", 18, 1, "", methodObject ),
new Among ( "eres", 18, 1, "", methodObject ),
new Among ( "ens", 16, 1, "", methodObject ),
new Among ( "hedens", 24, 1, "", methodObject ),
new Among ( "erens", 24, 1, "", methodObject ),
new Among ( "ers", 16, 1, "", methodObject ),
new Among ( "ets", 16, 1, "", methodObject ),
new Among ( "erets", 28, 1, "", methodObject ),
new Among ( "et", -1, 1, "", methodObject ),
new Among ( "eret", 30, 1, "", methodObject )
};
private final static Among a_1[] = {
new Among ( "gd", -1, -1, "", methodObject ),
new Among ( "dt", -1, -1, "", methodObject ),
new Among ( "gt", -1, -1, "", methodObject ),
new Among ( "kt", -1, -1, "", methodObject )
};
private final static Among a_2[] = {
new Among ( "ig", -1, 1, "", methodObject ),
new Among ( "lig", 0, 1, "", methodObject ),
new Among ( "elig", 1, 1, "", methodObject ),
new Among ( "els", -1, 1, "", methodObject ),
new Among ( "l\u00F8st", -1, 2, "", methodObject )
};
private static final char g_v[] = {17, 65, 16, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 48, 0, 128 };
private static final char g_s_ending[] = {239, 254, 42, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16 };
private int I_x;
private int I_p1;
private java.lang.StringBuilder S_ch = new java.lang.StringBuilder();
private void copy_from(danishStemmer other) {
I_x = other.I_x;
I_p1 = other.I_p1;
S_ch = other.S_ch;
super.copy_from(other);
}
private boolean r_mark_regions() {
int v_1;
int v_2;
// (, line 29
I_p1 = limit;
// test, line 33
v_1 = cursor;
// (, line 33
// hop, line 33
{
int c = cursor + 3;
if (0 > c || c > limit)
{
return false;
}
cursor = c;
}
// setmark x, line 33
I_x = cursor;
cursor = v_1;
// goto, line 34
golab0: while(true)
{
v_2 = cursor;
lab1: do {
if (!(in_grouping(g_v, 97, 248)))
{
break lab1;
}
cursor = v_2;
break golab0;
} while (false);
cursor = v_2;
if (cursor >= limit)
{
return false;
}
cursor++;
}
// gopast, line 34
golab2: while(true)
{
lab3: do {
if (!(out_grouping(g_v, 97, 248)))
{
break lab3;
}
break golab2;
} while (false);
if (cursor >= limit)
{
return false;
}
cursor++;
}
// setmark p1, line 34
I_p1 = cursor;
// try, line 35
lab4: do {
// (, line 35
if (!(I_p1 < I_x))
{
break lab4;
}
I_p1 = I_x;
} while (false);
return true;
}
private boolean r_main_suffix() {
int among_var;
int v_1;
int v_2;
// (, line 40
// setlimit, line 41
v_1 = limit - cursor;
// tomark, line 41
if (cursor < I_p1)
{
return false;
}
cursor = I_p1;
v_2 = limit_backward;
limit_backward = cursor;
cursor = limit - v_1;
// (, line 41
// [, line 41
ket = cursor;
// substring, line 41
among_var = find_among_b(a_0, 32);
if (among_var == 0)
{
limit_backward = v_2;
return false;
}
// ], line 41
bra = cursor;
limit_backward = v_2;
switch(among_var) {
case 0:
return false;
case 1:
// (, line 48
// delete, line 48
slice_del();
break;
case 2:
// (, line 50
if (!(in_grouping_b(g_s_ending, 97, 229)))
{
return false;
}
// delete, line 50
slice_del();
break;
}
return true;
}
private boolean r_consonant_pair() {
int v_1;
int v_2;
int v_3;
// (, line 54
// test, line 55
v_1 = limit - cursor;
// (, line 55
// setlimit, line 56
v_2 = limit - cursor;
// tomark, line 56
if (cursor < I_p1)
{
return false;
}
cursor = I_p1;
v_3 = limit_backward;
limit_backward = cursor;
cursor = limit - v_2;
// (, line 56
// [, line 56
ket = cursor;
// substring, line 56
if (find_among_b(a_1, 4) == 0)
{
limit_backward = v_3;
return false;
}
// ], line 56
bra = cursor;
limit_backward = v_3;
cursor = limit - v_1;
// next, line 62
if (cursor <= limit_backward)
{
return false;
}
cursor--;
// ], line 62
bra = cursor;
// delete, line 62
slice_del();
return true;
}
private boolean r_other_suffix() {
int among_var;
int v_1;
int v_2;
int v_3;
int v_4;
// (, line 65
// do, line 66
v_1 = limit - cursor;
lab0: do {
// (, line 66
// [, line 66
ket = cursor;
// literal, line 66
if (!(eq_s_b(2, "st")))
{
break lab0;
}
// ], line 66
bra = cursor;
// literal, line 66
if (!(eq_s_b(2, "ig")))
{
break lab0;
}
// delete, line 66
slice_del();
} while (false);
cursor = limit - v_1;
// setlimit, line 67
v_2 = limit - cursor;
// tomark, line 67
if (cursor < I_p1)
{
return false;
}
cursor = I_p1;
v_3 = limit_backward;
limit_backward = cursor;
cursor = limit - v_2;
// (, line 67
// [, line 67
ket = cursor;
// substring, line 67
among_var = find_among_b(a_2, 5);
if (among_var == 0)
{
limit_backward = v_3;
return false;
}
// ], line 67
bra = cursor;
limit_backward = v_3;
switch(among_var) {
case 0:
return false;
case 1:
// (, line 70
// delete, line 70
slice_del();
// do, line 70
v_4 = limit - cursor;
lab1: do {
// call consonant_pair, line 70
if (!r_consonant_pair())
{
break lab1;
}
} while (false);
cursor = limit - v_4;
break;
case 2:
// (, line 72
// <-, line 72
slice_from("l\u00F8s");
break;
}
return true;
}
private boolean r_undouble() {
int v_1;
int v_2;
// (, line 75
// setlimit, line 76
v_1 = limit - cursor;
// tomark, line 76
if (cursor < I_p1)
{
return false;
}
cursor = I_p1;
v_2 = limit_backward;
limit_backward = cursor;
cursor = limit - v_1;
// (, line 76
// [, line 76
ket = cursor;
if (!(out_grouping_b(g_v, 97, 248)))
{
limit_backward = v_2;
return false;
}
// ], line 76
bra = cursor;
// -> ch, line 76
S_ch = slice_to(S_ch);
limit_backward = v_2;
// name ch, line 77
if (!(eq_v_b(S_ch)))
{
return false;
}
// delete, line 78
slice_del();
return true;
}
public boolean stem() {
int v_1;
int v_2;
int v_3;
int v_4;
int v_5;
// (, line 82
// do, line 84
v_1 = cursor;
lab0: do {
// call mark_regions, line 84
if (!r_mark_regions())
{
break lab0;
}
} while (false);
cursor = v_1;
// backwards, line 85
limit_backward = cursor; cursor = limit;
// (, line 85
// do, line 86
v_2 = limit - cursor;
lab1: do {
// call main_suffix, line 86
if (!r_main_suffix())
{
break lab1;
}
} while (false);
cursor = limit - v_2;
// do, line 87
v_3 = limit - cursor;
lab2: do {
// call consonant_pair, line 87
if (!r_consonant_pair())
{
break lab2;
}
} while (false);
cursor = limit - v_3;
// do, line 88
v_4 = limit - cursor;
lab3: do {
// call other_suffix, line 88
if (!r_other_suffix())
{
break lab3;
}
} while (false);
cursor = limit - v_4;
// do, line 89
v_5 = limit - cursor;
lab4: do {
// call undouble, line 89
if (!r_undouble())
{
break lab4;
}
} while (false);
cursor = limit - v_5;
cursor = limit_backward; return true;
}
public boolean equals( Object o ) {
return o instanceof danishStemmer;
}
public int hashCode() {
return danishStemmer.class.getName().hashCode();
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/stemmer
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/stemmer/snowball/dutchStemmer.java
|
// CHECKSTYLE:OFF
/*
Copyright (c) 2001, Dr Martin Porter
Copyright (c) 2002, Richard Boulton
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* Neither the name of the copyright holders nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
// This file was generated automatically by the Snowball to Java compiler
package opennlp.tools.stemmer.snowball;
/**
* This class was automatically generated by a Snowball to Java compiler
* It implements the stemming algorithm defined by a snowball script.
*/
class dutchStemmer extends opennlp.tools.stemmer.snowball.AbstractSnowballStemmer {
private final static dutchStemmer methodObject = new dutchStemmer ();
private final static Among a_0[] = {
new Among ( "", -1, 6, "", methodObject ),
new Among ( "\u00E1", 0, 1, "", methodObject ),
new Among ( "\u00E4", 0, 1, "", methodObject ),
new Among ( "\u00E9", 0, 2, "", methodObject ),
new Among ( "\u00EB", 0, 2, "", methodObject ),
new Among ( "\u00ED", 0, 3, "", methodObject ),
new Among ( "\u00EF", 0, 3, "", methodObject ),
new Among ( "\u00F3", 0, 4, "", methodObject ),
new Among ( "\u00F6", 0, 4, "", methodObject ),
new Among ( "\u00FA", 0, 5, "", methodObject ),
new Among ( "\u00FC", 0, 5, "", methodObject )
};
private final static Among a_1[] = {
new Among ( "", -1, 3, "", methodObject ),
new Among ( "I", 0, 2, "", methodObject ),
new Among ( "Y", 0, 1, "", methodObject )
};
private final static Among a_2[] = {
new Among ( "dd", -1, -1, "", methodObject ),
new Among ( "kk", -1, -1, "", methodObject ),
new Among ( "tt", -1, -1, "", methodObject )
};
private final static Among a_3[] = {
new Among ( "ene", -1, 2, "", methodObject ),
new Among ( "se", -1, 3, "", methodObject ),
new Among ( "en", -1, 2, "", methodObject ),
new Among ( "heden", 2, 1, "", methodObject ),
new Among ( "s", -1, 3, "", methodObject )
};
private final static Among a_4[] = {
new Among ( "end", -1, 1, "", methodObject ),
new Among ( "ig", -1, 2, "", methodObject ),
new Among ( "ing", -1, 1, "", methodObject ),
new Among ( "lijk", -1, 3, "", methodObject ),
new Among ( "baar", -1, 4, "", methodObject ),
new Among ( "bar", -1, 5, "", methodObject )
};
private final static Among a_5[] = {
new Among ( "aa", -1, -1, "", methodObject ),
new Among ( "ee", -1, -1, "", methodObject ),
new Among ( "oo", -1, -1, "", methodObject ),
new Among ( "uu", -1, -1, "", methodObject )
};
private static final char g_v[] = {17, 65, 16, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 128 };
private static final char g_v_I[] = {1, 0, 0, 17, 65, 16, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 128 };
private static final char g_v_j[] = {17, 67, 16, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 128 };
private int I_p2;
private int I_p1;
private boolean B_e_found;
private void copy_from(dutchStemmer other) {
I_p2 = other.I_p2;
I_p1 = other.I_p1;
B_e_found = other.B_e_found;
super.copy_from(other);
}
private boolean r_prelude() {
int among_var;
int v_1;
int v_2;
int v_3;
int v_4;
int v_5;
int v_6;
// (, line 41
// test, line 42
v_1 = cursor;
// repeat, line 42
replab0: while(true)
{
v_2 = cursor;
lab1: do {
// (, line 42
// [, line 43
bra = cursor;
// substring, line 43
among_var = find_among(a_0, 11);
if (among_var == 0)
{
break lab1;
}
// ], line 43
ket = cursor;
switch(among_var) {
case 0:
break lab1;
case 1:
// (, line 45
// <-, line 45
slice_from("a");
break;
case 2:
// (, line 47
// <-, line 47
slice_from("e");
break;
case 3:
// (, line 49
// <-, line 49
slice_from("i");
break;
case 4:
// (, line 51
// <-, line 51
slice_from("o");
break;
case 5:
// (, line 53
// <-, line 53
slice_from("u");
break;
case 6:
// (, line 54
// next, line 54
if (cursor >= limit)
{
break lab1;
}
cursor++;
break;
}
continue replab0;
} while (false);
cursor = v_2;
break replab0;
}
cursor = v_1;
// try, line 57
v_3 = cursor;
lab2: do {
// (, line 57
// [, line 57
bra = cursor;
// literal, line 57
if (!(eq_s(1, "y")))
{
cursor = v_3;
break lab2;
}
// ], line 57
ket = cursor;
// <-, line 57
slice_from("Y");
} while (false);
// repeat, line 58
replab3: while(true)
{
v_4 = cursor;
lab4: do {
// goto, line 58
golab5: while(true)
{
v_5 = cursor;
lab6: do {
// (, line 58
if (!(in_grouping(g_v, 97, 232)))
{
break lab6;
}
// [, line 59
bra = cursor;
// or, line 59
lab7: do {
v_6 = cursor;
lab8: do {
// (, line 59
// literal, line 59
if (!(eq_s(1, "i")))
{
break lab8;
}
// ], line 59
ket = cursor;
if (!(in_grouping(g_v, 97, 232)))
{
break lab8;
}
// <-, line 59
slice_from("I");
break lab7;
} while (false);
cursor = v_6;
// (, line 60
// literal, line 60
if (!(eq_s(1, "y")))
{
break lab6;
}
// ], line 60
ket = cursor;
// <-, line 60
slice_from("Y");
} while (false);
cursor = v_5;
break golab5;
} while (false);
cursor = v_5;
if (cursor >= limit)
{
break lab4;
}
cursor++;
}
continue replab3;
} while (false);
cursor = v_4;
break replab3;
}
return true;
}
private boolean r_mark_regions() {
// (, line 64
I_p1 = limit;
I_p2 = limit;
// gopast, line 69
golab0: while(true)
{
lab1: do {
if (!(in_grouping(g_v, 97, 232)))
{
break lab1;
}
break golab0;
} while (false);
if (cursor >= limit)
{
return false;
}
cursor++;
}
// gopast, line 69
golab2: while(true)
{
lab3: do {
if (!(out_grouping(g_v, 97, 232)))
{
break lab3;
}
break golab2;
} while (false);
if (cursor >= limit)
{
return false;
}
cursor++;
}
// setmark p1, line 69
I_p1 = cursor;
// try, line 70
lab4: do {
// (, line 70
if (!(I_p1 < 3))
{
break lab4;
}
I_p1 = 3;
} while (false);
// gopast, line 71
golab5: while(true)
{
lab6: do {
if (!(in_grouping(g_v, 97, 232)))
{
break lab6;
}
break golab5;
} while (false);
if (cursor >= limit)
{
return false;
}
cursor++;
}
// gopast, line 71
golab7: while(true)
{
lab8: do {
if (!(out_grouping(g_v, 97, 232)))
{
break lab8;
}
break golab7;
} while (false);
if (cursor >= limit)
{
return false;
}
cursor++;
}
// setmark p2, line 71
I_p2 = cursor;
return true;
}
private boolean r_postlude() {
int among_var;
int v_1;
// repeat, line 75
replab0: while(true)
{
v_1 = cursor;
lab1: do {
// (, line 75
// [, line 77
bra = cursor;
// substring, line 77
among_var = find_among(a_1, 3);
if (among_var == 0)
{
break lab1;
}
// ], line 77
ket = cursor;
switch(among_var) {
case 0:
break lab1;
case 1:
// (, line 78
// <-, line 78
slice_from("y");
break;
case 2:
// (, line 79
// <-, line 79
slice_from("i");
break;
case 3:
// (, line 80
// next, line 80
if (cursor >= limit)
{
break lab1;
}
cursor++;
break;
}
continue replab0;
} while (false);
cursor = v_1;
break replab0;
}
return true;
}
private boolean r_R1() {
if (!(I_p1 <= cursor))
{
return false;
}
return true;
}
private boolean r_R2() {
if (!(I_p2 <= cursor))
{
return false;
}
return true;
}
private boolean r_undouble() {
int v_1;
// (, line 90
// test, line 91
v_1 = limit - cursor;
// among, line 91
if (find_among_b(a_2, 3) == 0)
{
return false;
}
cursor = limit - v_1;
// [, line 91
ket = cursor;
// next, line 91
if (cursor <= limit_backward)
{
return false;
}
cursor--;
// ], line 91
bra = cursor;
// delete, line 91
slice_del();
return true;
}
private boolean r_e_ending() {
int v_1;
// (, line 94
// unset e_found, line 95
B_e_found = false;
// [, line 96
ket = cursor;
// literal, line 96
if (!(eq_s_b(1, "e")))
{
return false;
}
// ], line 96
bra = cursor;
// call R1, line 96
if (!r_R1())
{
return false;
}
// test, line 96
v_1 = limit - cursor;
if (!(out_grouping_b(g_v, 97, 232)))
{
return false;
}
cursor = limit - v_1;
// delete, line 96
slice_del();
// set e_found, line 97
B_e_found = true;
// call undouble, line 98
if (!r_undouble())
{
return false;
}
return true;
}
private boolean r_en_ending() {
int v_1;
int v_2;
// (, line 101
// call R1, line 102
if (!r_R1())
{
return false;
}
// and, line 102
v_1 = limit - cursor;
if (!(out_grouping_b(g_v, 97, 232)))
{
return false;
}
cursor = limit - v_1;
// not, line 102
{
v_2 = limit - cursor;
lab0: do {
// literal, line 102
if (!(eq_s_b(3, "gem")))
{
break lab0;
}
return false;
} while (false);
cursor = limit - v_2;
}
// delete, line 102
slice_del();
// call undouble, line 103
if (!r_undouble())
{
return false;
}
return true;
}
private boolean r_standard_suffix() {
int among_var;
int v_1;
int v_2;
int v_3;
int v_4;
int v_5;
int v_6;
int v_7;
int v_8;
int v_9;
int v_10;
// (, line 106
// do, line 107
v_1 = limit - cursor;
lab0: do {
// (, line 107
// [, line 108
ket = cursor;
// substring, line 108
among_var = find_among_b(a_3, 5);
if (among_var == 0)
{
break lab0;
}
// ], line 108
bra = cursor;
switch(among_var) {
case 0:
break lab0;
case 1:
// (, line 110
// call R1, line 110
if (!r_R1())
{
break lab0;
}
// <-, line 110
slice_from("heid");
break;
case 2:
// (, line 113
// call en_ending, line 113
if (!r_en_ending())
{
break lab0;
}
break;
case 3:
// (, line 116
// call R1, line 116
if (!r_R1())
{
break lab0;
}
if (!(out_grouping_b(g_v_j, 97, 232)))
{
break lab0;
}
// delete, line 116
slice_del();
break;
}
} while (false);
cursor = limit - v_1;
// do, line 120
v_2 = limit - cursor;
lab1: do {
// call e_ending, line 120
if (!r_e_ending())
{
break lab1;
}
} while (false);
cursor = limit - v_2;
// do, line 122
v_3 = limit - cursor;
lab2: do {
// (, line 122
// [, line 122
ket = cursor;
// literal, line 122
if (!(eq_s_b(4, "heid")))
{
break lab2;
}
// ], line 122
bra = cursor;
// call R2, line 122
if (!r_R2())
{
break lab2;
}
// not, line 122
{
v_4 = limit - cursor;
lab3: do {
// literal, line 122
if (!(eq_s_b(1, "c")))
{
break lab3;
}
break lab2;
} while (false);
cursor = limit - v_4;
}
// delete, line 122
slice_del();
// [, line 123
ket = cursor;
// literal, line 123
if (!(eq_s_b(2, "en")))
{
break lab2;
}
// ], line 123
bra = cursor;
// call en_ending, line 123
if (!r_en_ending())
{
break lab2;
}
} while (false);
cursor = limit - v_3;
// do, line 126
v_5 = limit - cursor;
lab4: do {
// (, line 126
// [, line 127
ket = cursor;
// substring, line 127
among_var = find_among_b(a_4, 6);
if (among_var == 0)
{
break lab4;
}
// ], line 127
bra = cursor;
switch(among_var) {
case 0:
break lab4;
case 1:
// (, line 129
// call R2, line 129
if (!r_R2())
{
break lab4;
}
// delete, line 129
slice_del();
// or, line 130
lab5: do {
v_6 = limit - cursor;
lab6: do {
// (, line 130
// [, line 130
ket = cursor;
// literal, line 130
if (!(eq_s_b(2, "ig")))
{
break lab6;
}
// ], line 130
bra = cursor;
// call R2, line 130
if (!r_R2())
{
break lab6;
}
// not, line 130
{
v_7 = limit - cursor;
lab7: do {
// literal, line 130
if (!(eq_s_b(1, "e")))
{
break lab7;
}
break lab6;
} while (false);
cursor = limit - v_7;
}
// delete, line 130
slice_del();
break lab5;
} while (false);
cursor = limit - v_6;
// call undouble, line 130
if (!r_undouble())
{
break lab4;
}
} while (false);
break;
case 2:
// (, line 133
// call R2, line 133
if (!r_R2())
{
break lab4;
}
// not, line 133
{
v_8 = limit - cursor;
lab8: do {
// literal, line 133
if (!(eq_s_b(1, "e")))
{
break lab8;
}
break lab4;
} while (false);
cursor = limit - v_8;
}
// delete, line 133
slice_del();
break;
case 3:
// (, line 136
// call R2, line 136
if (!r_R2())
{
break lab4;
}
// delete, line 136
slice_del();
// call e_ending, line 136
if (!r_e_ending())
{
break lab4;
}
break;
case 4:
// (, line 139
// call R2, line 139
if (!r_R2())
{
break lab4;
}
// delete, line 139
slice_del();
break;
case 5:
// (, line 142
// call R2, line 142
if (!r_R2())
{
break lab4;
}
// Boolean test e_found, line 142
if (!(B_e_found))
{
break lab4;
}
// delete, line 142
slice_del();
break;
}
} while (false);
cursor = limit - v_5;
// do, line 146
v_9 = limit - cursor;
lab9: do {
// (, line 146
if (!(out_grouping_b(g_v_I, 73, 232)))
{
break lab9;
}
// test, line 148
v_10 = limit - cursor;
// (, line 148
// among, line 149
if (find_among_b(a_5, 4) == 0)
{
break lab9;
}
if (!(out_grouping_b(g_v, 97, 232)))
{
break lab9;
}
cursor = limit - v_10;
// [, line 152
ket = cursor;
// next, line 152
if (cursor <= limit_backward)
{
break lab9;
}
cursor--;
// ], line 152
bra = cursor;
// delete, line 152
slice_del();
} while (false);
cursor = limit - v_9;
return true;
}
public boolean stem() {
int v_1;
int v_2;
int v_3;
int v_4;
// (, line 157
// do, line 159
v_1 = cursor;
lab0: do {
// call prelude, line 159
if (!r_prelude())
{
break lab0;
}
} while (false);
cursor = v_1;
// do, line 160
v_2 = cursor;
lab1: do {
// call mark_regions, line 160
if (!r_mark_regions())
{
break lab1;
}
} while (false);
cursor = v_2;
// backwards, line 161
limit_backward = cursor; cursor = limit;
// do, line 162
v_3 = limit - cursor;
lab2: do {
// call standard_suffix, line 162
if (!r_standard_suffix())
{
break lab2;
}
} while (false);
cursor = limit - v_3;
cursor = limit_backward; // do, line 163
v_4 = cursor;
lab3: do {
// call postlude, line 163
if (!r_postlude())
{
break lab3;
}
} while (false);
cursor = v_4;
return true;
}
public boolean equals( Object o ) {
return o instanceof dutchStemmer;
}
public int hashCode() {
return dutchStemmer.class.getName().hashCode();
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/stemmer
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/stemmer/snowball/englishStemmer.java
|
// CHECKSTYLE:OFF
/*
Copyright (c) 2001, Dr Martin Porter
Copyright (c) 2002, Richard Boulton
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* Neither the name of the copyright holders nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
// This file was generated automatically by the Snowball to Java compiler
package opennlp.tools.stemmer.snowball;
/**
* This class was automatically generated by a Snowball to Java compiler
* It implements the stemming algorithm defined by a snowball script.
*/
class englishStemmer extends opennlp.tools.stemmer.snowball.AbstractSnowballStemmer {
private final static englishStemmer methodObject = new englishStemmer ();
private final static Among a_0[] = {
new Among ( "arsen", -1, -1, "", methodObject ),
new Among ( "commun", -1, -1, "", methodObject ),
new Among ( "gener", -1, -1, "", methodObject )
};
private final static Among a_1[] = {
new Among ( "'", -1, 1, "", methodObject ),
new Among ( "'s'", 0, 1, "", methodObject ),
new Among ( "'s", -1, 1, "", methodObject )
};
private final static Among a_2[] = {
new Among ( "ied", -1, 2, "", methodObject ),
new Among ( "s", -1, 3, "", methodObject ),
new Among ( "ies", 1, 2, "", methodObject ),
new Among ( "sses", 1, 1, "", methodObject ),
new Among ( "ss", 1, -1, "", methodObject ),
new Among ( "us", 1, -1, "", methodObject )
};
private final static Among a_3[] = {
new Among ( "", -1, 3, "", methodObject ),
new Among ( "bb", 0, 2, "", methodObject ),
new Among ( "dd", 0, 2, "", methodObject ),
new Among ( "ff", 0, 2, "", methodObject ),
new Among ( "gg", 0, 2, "", methodObject ),
new Among ( "bl", 0, 1, "", methodObject ),
new Among ( "mm", 0, 2, "", methodObject ),
new Among ( "nn", 0, 2, "", methodObject ),
new Among ( "pp", 0, 2, "", methodObject ),
new Among ( "rr", 0, 2, "", methodObject ),
new Among ( "at", 0, 1, "", methodObject ),
new Among ( "tt", 0, 2, "", methodObject ),
new Among ( "iz", 0, 1, "", methodObject )
};
private final static Among a_4[] = {
new Among ( "ed", -1, 2, "", methodObject ),
new Among ( "eed", 0, 1, "", methodObject ),
new Among ( "ing", -1, 2, "", methodObject ),
new Among ( "edly", -1, 2, "", methodObject ),
new Among ( "eedly", 3, 1, "", methodObject ),
new Among ( "ingly", -1, 2, "", methodObject )
};
private final static Among a_5[] = {
new Among ( "anci", -1, 3, "", methodObject ),
new Among ( "enci", -1, 2, "", methodObject ),
new Among ( "ogi", -1, 13, "", methodObject ),
new Among ( "li", -1, 16, "", methodObject ),
new Among ( "bli", 3, 12, "", methodObject ),
new Among ( "abli", 4, 4, "", methodObject ),
new Among ( "alli", 3, 8, "", methodObject ),
new Among ( "fulli", 3, 14, "", methodObject ),
new Among ( "lessli", 3, 15, "", methodObject ),
new Among ( "ousli", 3, 10, "", methodObject ),
new Among ( "entli", 3, 5, "", methodObject ),
new Among ( "aliti", -1, 8, "", methodObject ),
new Among ( "biliti", -1, 12, "", methodObject ),
new Among ( "iviti", -1, 11, "", methodObject ),
new Among ( "tional", -1, 1, "", methodObject ),
new Among ( "ational", 14, 7, "", methodObject ),
new Among ( "alism", -1, 8, "", methodObject ),
new Among ( "ation", -1, 7, "", methodObject ),
new Among ( "ization", 17, 6, "", methodObject ),
new Among ( "izer", -1, 6, "", methodObject ),
new Among ( "ator", -1, 7, "", methodObject ),
new Among ( "iveness", -1, 11, "", methodObject ),
new Among ( "fulness", -1, 9, "", methodObject ),
new Among ( "ousness", -1, 10, "", methodObject )
};
private final static Among a_6[] = {
new Among ( "icate", -1, 4, "", methodObject ),
new Among ( "ative", -1, 6, "", methodObject ),
new Among ( "alize", -1, 3, "", methodObject ),
new Among ( "iciti", -1, 4, "", methodObject ),
new Among ( "ical", -1, 4, "", methodObject ),
new Among ( "tional", -1, 1, "", methodObject ),
new Among ( "ational", 5, 2, "", methodObject ),
new Among ( "ful", -1, 5, "", methodObject ),
new Among ( "ness", -1, 5, "", methodObject )
};
private final static Among a_7[] = {
new Among ( "ic", -1, 1, "", methodObject ),
new Among ( "ance", -1, 1, "", methodObject ),
new Among ( "ence", -1, 1, "", methodObject ),
new Among ( "able", -1, 1, "", methodObject ),
new Among ( "ible", -1, 1, "", methodObject ),
new Among ( "ate", -1, 1, "", methodObject ),
new Among ( "ive", -1, 1, "", methodObject ),
new Among ( "ize", -1, 1, "", methodObject ),
new Among ( "iti", -1, 1, "", methodObject ),
new Among ( "al", -1, 1, "", methodObject ),
new Among ( "ism", -1, 1, "", methodObject ),
new Among ( "ion", -1, 2, "", methodObject ),
new Among ( "er", -1, 1, "", methodObject ),
new Among ( "ous", -1, 1, "", methodObject ),
new Among ( "ant", -1, 1, "", methodObject ),
new Among ( "ent", -1, 1, "", methodObject ),
new Among ( "ment", 15, 1, "", methodObject ),
new Among ( "ement", 16, 1, "", methodObject )
};
private final static Among a_8[] = {
new Among ( "e", -1, 1, "", methodObject ),
new Among ( "l", -1, 2, "", methodObject )
};
private final static Among a_9[] = {
new Among ( "succeed", -1, -1, "", methodObject ),
new Among ( "proceed", -1, -1, "", methodObject ),
new Among ( "exceed", -1, -1, "", methodObject ),
new Among ( "canning", -1, -1, "", methodObject ),
new Among ( "inning", -1, -1, "", methodObject ),
new Among ( "earring", -1, -1, "", methodObject ),
new Among ( "herring", -1, -1, "", methodObject ),
new Among ( "outing", -1, -1, "", methodObject )
};
private final static Among a_10[] = {
new Among ( "andes", -1, -1, "", methodObject ),
new Among ( "atlas", -1, -1, "", methodObject ),
new Among ( "bias", -1, -1, "", methodObject ),
new Among ( "cosmos", -1, -1, "", methodObject ),
new Among ( "dying", -1, 3, "", methodObject ),
new Among ( "early", -1, 9, "", methodObject ),
new Among ( "gently", -1, 7, "", methodObject ),
new Among ( "howe", -1, -1, "", methodObject ),
new Among ( "idly", -1, 6, "", methodObject ),
new Among ( "lying", -1, 4, "", methodObject ),
new Among ( "news", -1, -1, "", methodObject ),
new Among ( "only", -1, 10, "", methodObject ),
new Among ( "singly", -1, 11, "", methodObject ),
new Among ( "skies", -1, 2, "", methodObject ),
new Among ( "skis", -1, 1, "", methodObject ),
new Among ( "sky", -1, -1, "", methodObject ),
new Among ( "tying", -1, 5, "", methodObject ),
new Among ( "ugly", -1, 8, "", methodObject )
};
private static final char g_v[] = {17, 65, 16, 1 };
private static final char g_v_WXY[] = {1, 17, 65, 208, 1 };
private static final char g_valid_LI[] = {55, 141, 2 };
private boolean B_Y_found;
private int I_p2;
private int I_p1;
private void copy_from(englishStemmer other) {
B_Y_found = other.B_Y_found;
I_p2 = other.I_p2;
I_p1 = other.I_p1;
super.copy_from(other);
}
private boolean r_prelude() {
int v_1;
int v_2;
int v_3;
int v_4;
int v_5;
// (, line 25
// unset Y_found, line 26
B_Y_found = false;
// do, line 27
v_1 = cursor;
lab0: do {
// (, line 27
// [, line 27
bra = cursor;
// literal, line 27
if (!(eq_s(1, "'")))
{
break lab0;
}
// ], line 27
ket = cursor;
// delete, line 27
slice_del();
} while (false);
cursor = v_1;
// do, line 28
v_2 = cursor;
lab1: do {
// (, line 28
// [, line 28
bra = cursor;
// literal, line 28
if (!(eq_s(1, "y")))
{
break lab1;
}
// ], line 28
ket = cursor;
// <-, line 28
slice_from("Y");
// set Y_found, line 28
B_Y_found = true;
} while (false);
cursor = v_2;
// do, line 29
v_3 = cursor;
lab2: do {
// repeat, line 29
replab3: while(true)
{
v_4 = cursor;
lab4: do {
// (, line 29
// goto, line 29
golab5: while(true)
{
v_5 = cursor;
lab6: do {
// (, line 29
if (!(in_grouping(g_v, 97, 121)))
{
break lab6;
}
// [, line 29
bra = cursor;
// literal, line 29
if (!(eq_s(1, "y")))
{
break lab6;
}
// ], line 29
ket = cursor;
cursor = v_5;
break golab5;
} while (false);
cursor = v_5;
if (cursor >= limit)
{
break lab4;
}
cursor++;
}
// <-, line 29
slice_from("Y");
// set Y_found, line 29
B_Y_found = true;
continue replab3;
} while (false);
cursor = v_4;
break replab3;
}
} while (false);
cursor = v_3;
return true;
}
private boolean r_mark_regions() {
int v_1;
int v_2;
// (, line 32
I_p1 = limit;
I_p2 = limit;
// do, line 35
v_1 = cursor;
lab0: do {
// (, line 35
// or, line 41
lab1: do {
v_2 = cursor;
lab2: do {
// among, line 36
if (find_among(a_0, 3) == 0)
{
break lab2;
}
break lab1;
} while (false);
cursor = v_2;
// (, line 41
// gopast, line 41
golab3: while(true)
{
lab4: do {
if (!(in_grouping(g_v, 97, 121)))
{
break lab4;
}
break golab3;
} while (false);
if (cursor >= limit)
{
break lab0;
}
cursor++;
}
// gopast, line 41
golab5: while(true)
{
lab6: do {
if (!(out_grouping(g_v, 97, 121)))
{
break lab6;
}
break golab5;
} while (false);
if (cursor >= limit)
{
break lab0;
}
cursor++;
}
} while (false);
// setmark p1, line 42
I_p1 = cursor;
// gopast, line 43
golab7: while(true)
{
lab8: do {
if (!(in_grouping(g_v, 97, 121)))
{
break lab8;
}
break golab7;
} while (false);
if (cursor >= limit)
{
break lab0;
}
cursor++;
}
// gopast, line 43
golab9: while(true)
{
lab10: do {
if (!(out_grouping(g_v, 97, 121)))
{
break lab10;
}
break golab9;
} while (false);
if (cursor >= limit)
{
break lab0;
}
cursor++;
}
// setmark p2, line 43
I_p2 = cursor;
} while (false);
cursor = v_1;
return true;
}
private boolean r_shortv() {
int v_1;
// (, line 49
// or, line 51
lab0: do {
v_1 = limit - cursor;
lab1: do {
// (, line 50
if (!(out_grouping_b(g_v_WXY, 89, 121)))
{
break lab1;
}
if (!(in_grouping_b(g_v, 97, 121)))
{
break lab1;
}
if (!(out_grouping_b(g_v, 97, 121)))
{
break lab1;
}
break lab0;
} while (false);
cursor = limit - v_1;
// (, line 52
if (!(out_grouping_b(g_v, 97, 121)))
{
return false;
}
if (!(in_grouping_b(g_v, 97, 121)))
{
return false;
}
// atlimit, line 52
if (cursor > limit_backward)
{
return false;
}
} while (false);
return true;
}
private boolean r_R1() {
if (!(I_p1 <= cursor))
{
return false;
}
return true;
}
private boolean r_R2() {
if (!(I_p2 <= cursor))
{
return false;
}
return true;
}
private boolean r_Step_1a() {
int among_var;
int v_1;
int v_2;
// (, line 58
// try, line 59
v_1 = limit - cursor;
lab0: do {
// (, line 59
// [, line 60
ket = cursor;
// substring, line 60
among_var = find_among_b(a_1, 3);
if (among_var == 0)
{
cursor = limit - v_1;
break lab0;
}
// ], line 60
bra = cursor;
switch(among_var) {
case 0:
cursor = limit - v_1;
break lab0;
case 1:
// (, line 62
// delete, line 62
slice_del();
break;
}
} while (false);
// [, line 65
ket = cursor;
// substring, line 65
among_var = find_among_b(a_2, 6);
if (among_var == 0)
{
return false;
}
// ], line 65
bra = cursor;
switch(among_var) {
case 0:
return false;
case 1:
// (, line 66
// <-, line 66
slice_from("ss");
break;
case 2:
// (, line 68
// or, line 68
lab1: do {
v_2 = limit - cursor;
lab2: do {
// (, line 68
// hop, line 68
{
int c = cursor - 2;
if (limit_backward > c || c > limit)
{
break lab2;
}
cursor = c;
}
// <-, line 68
slice_from("i");
break lab1;
} while (false);
cursor = limit - v_2;
// <-, line 68
slice_from("ie");
} while (false);
break;
case 3:
// (, line 69
// next, line 69
if (cursor <= limit_backward)
{
return false;
}
cursor--;
// gopast, line 69
golab3: while(true)
{
lab4: do {
if (!(in_grouping_b(g_v, 97, 121)))
{
break lab4;
}
break golab3;
} while (false);
if (cursor <= limit_backward)
{
return false;
}
cursor--;
}
// delete, line 69
slice_del();
break;
}
return true;
}
private boolean r_Step_1b() {
int among_var;
int v_1;
int v_3;
int v_4;
// (, line 74
// [, line 75
ket = cursor;
// substring, line 75
among_var = find_among_b(a_4, 6);
if (among_var == 0)
{
return false;
}
// ], line 75
bra = cursor;
switch(among_var) {
case 0:
return false;
case 1:
// (, line 77
// call R1, line 77
if (!r_R1())
{
return false;
}
// <-, line 77
slice_from("ee");
break;
case 2:
// (, line 79
// test, line 80
v_1 = limit - cursor;
// gopast, line 80
golab0: while(true)
{
lab1: do {
if (!(in_grouping_b(g_v, 97, 121)))
{
break lab1;
}
break golab0;
} while (false);
if (cursor <= limit_backward)
{
return false;
}
cursor--;
}
cursor = limit - v_1;
// delete, line 80
slice_del();
// test, line 81
v_3 = limit - cursor;
// substring, line 81
among_var = find_among_b(a_3, 13);
if (among_var == 0)
{
return false;
}
cursor = limit - v_3;
switch(among_var) {
case 0:
return false;
case 1:
// (, line 83
// <+, line 83
{
int c = cursor;
insert(cursor, cursor, "e");
cursor = c;
}
break;
case 2:
// (, line 86
// [, line 86
ket = cursor;
// next, line 86
if (cursor <= limit_backward)
{
return false;
}
cursor--;
// ], line 86
bra = cursor;
// delete, line 86
slice_del();
break;
case 3:
// (, line 87
// atmark, line 87
if (cursor != I_p1)
{
return false;
}
// test, line 87
v_4 = limit - cursor;
// call shortv, line 87
if (!r_shortv())
{
return false;
}
cursor = limit - v_4;
// <+, line 87
{
int c = cursor;
insert(cursor, cursor, "e");
cursor = c;
}
break;
}
break;
}
return true;
}
private boolean r_Step_1c() {
int v_1;
int v_2;
// (, line 93
// [, line 94
ket = cursor;
// or, line 94
lab0: do {
v_1 = limit - cursor;
lab1: do {
// literal, line 94
if (!(eq_s_b(1, "y")))
{
break lab1;
}
break lab0;
} while (false);
cursor = limit - v_1;
// literal, line 94
if (!(eq_s_b(1, "Y")))
{
return false;
}
} while (false);
// ], line 94
bra = cursor;
if (!(out_grouping_b(g_v, 97, 121)))
{
return false;
}
// not, line 95
{
v_2 = limit - cursor;
lab2: do {
// atlimit, line 95
if (cursor > limit_backward)
{
break lab2;
}
return false;
} while (false);
cursor = limit - v_2;
}
// <-, line 96
slice_from("i");
return true;
}
private boolean r_Step_2() {
int among_var;
// (, line 99
// [, line 100
ket = cursor;
// substring, line 100
among_var = find_among_b(a_5, 24);
if (among_var == 0)
{
return false;
}
// ], line 100
bra = cursor;
// call R1, line 100
if (!r_R1())
{
return false;
}
switch(among_var) {
case 0:
return false;
case 1:
// (, line 101
// <-, line 101
slice_from("tion");
break;
case 2:
// (, line 102
// <-, line 102
slice_from("ence");
break;
case 3:
// (, line 103
// <-, line 103
slice_from("ance");
break;
case 4:
// (, line 104
// <-, line 104
slice_from("able");
break;
case 5:
// (, line 105
// <-, line 105
slice_from("ent");
break;
case 6:
// (, line 107
// <-, line 107
slice_from("ize");
break;
case 7:
// (, line 109
// <-, line 109
slice_from("ate");
break;
case 8:
// (, line 111
// <-, line 111
slice_from("al");
break;
case 9:
// (, line 112
// <-, line 112
slice_from("ful");
break;
case 10:
// (, line 114
// <-, line 114
slice_from("ous");
break;
case 11:
// (, line 116
// <-, line 116
slice_from("ive");
break;
case 12:
// (, line 118
// <-, line 118
slice_from("ble");
break;
case 13:
// (, line 119
// literal, line 119
if (!(eq_s_b(1, "l")))
{
return false;
}
// <-, line 119
slice_from("og");
break;
case 14:
// (, line 120
// <-, line 120
slice_from("ful");
break;
case 15:
// (, line 121
// <-, line 121
slice_from("less");
break;
case 16:
// (, line 122
if (!(in_grouping_b(g_valid_LI, 99, 116)))
{
return false;
}
// delete, line 122
slice_del();
break;
}
return true;
}
private boolean r_Step_3() {
int among_var;
// (, line 126
// [, line 127
ket = cursor;
// substring, line 127
among_var = find_among_b(a_6, 9);
if (among_var == 0)
{
return false;
}
// ], line 127
bra = cursor;
// call R1, line 127
if (!r_R1())
{
return false;
}
switch(among_var) {
case 0:
return false;
case 1:
// (, line 128
// <-, line 128
slice_from("tion");
break;
case 2:
// (, line 129
// <-, line 129
slice_from("ate");
break;
case 3:
// (, line 130
// <-, line 130
slice_from("al");
break;
case 4:
// (, line 132
// <-, line 132
slice_from("ic");
break;
case 5:
// (, line 134
// delete, line 134
slice_del();
break;
case 6:
// (, line 136
// call R2, line 136
if (!r_R2())
{
return false;
}
// delete, line 136
slice_del();
break;
}
return true;
}
private boolean r_Step_4() {
int among_var;
int v_1;
// (, line 140
// [, line 141
ket = cursor;
// substring, line 141
among_var = find_among_b(a_7, 18);
if (among_var == 0)
{
return false;
}
// ], line 141
bra = cursor;
// call R2, line 141
if (!r_R2())
{
return false;
}
switch(among_var) {
case 0:
return false;
case 1:
// (, line 144
// delete, line 144
slice_del();
break;
case 2:
// (, line 145
// or, line 145
lab0: do {
v_1 = limit - cursor;
lab1: do {
// literal, line 145
if (!(eq_s_b(1, "s")))
{
break lab1;
}
break lab0;
} while (false);
cursor = limit - v_1;
// literal, line 145
if (!(eq_s_b(1, "t")))
{
return false;
}
} while (false);
// delete, line 145
slice_del();
break;
}
return true;
}
private boolean r_Step_5() {
int among_var;
int v_1;
int v_2;
// (, line 149
// [, line 150
ket = cursor;
// substring, line 150
among_var = find_among_b(a_8, 2);
if (among_var == 0)
{
return false;
}
// ], line 150
bra = cursor;
switch(among_var) {
case 0:
return false;
case 1:
// (, line 151
// or, line 151
lab0: do {
v_1 = limit - cursor;
lab1: do {
// call R2, line 151
if (!r_R2())
{
break lab1;
}
break lab0;
} while (false);
cursor = limit - v_1;
// (, line 151
// call R1, line 151
if (!r_R1())
{
return false;
}
// not, line 151
{
v_2 = limit - cursor;
lab2: do {
// call shortv, line 151
if (!r_shortv())
{
break lab2;
}
return false;
} while (false);
cursor = limit - v_2;
}
} while (false);
// delete, line 151
slice_del();
break;
case 2:
// (, line 152
// call R2, line 152
if (!r_R2())
{
return false;
}
// literal, line 152
if (!(eq_s_b(1, "l")))
{
return false;
}
// delete, line 152
slice_del();
break;
}
return true;
}
private boolean r_exception2() {
// (, line 156
// [, line 158
ket = cursor;
// substring, line 158
if (find_among_b(a_9, 8) == 0)
{
return false;
}
// ], line 158
bra = cursor;
// atlimit, line 158
if (cursor > limit_backward)
{
return false;
}
return true;
}
private boolean r_exception1() {
int among_var;
// (, line 168
// [, line 170
bra = cursor;
// substring, line 170
among_var = find_among(a_10, 18);
if (among_var == 0)
{
return false;
}
// ], line 170
ket = cursor;
// atlimit, line 170
if (cursor < limit)
{
return false;
}
switch(among_var) {
case 0:
return false;
case 1:
// (, line 174
// <-, line 174
slice_from("ski");
break;
case 2:
// (, line 175
// <-, line 175
slice_from("sky");
break;
case 3:
// (, line 176
// <-, line 176
slice_from("die");
break;
case 4:
// (, line 177
// <-, line 177
slice_from("lie");
break;
case 5:
// (, line 178
// <-, line 178
slice_from("tie");
break;
case 6:
// (, line 182
// <-, line 182
slice_from("idl");
break;
case 7:
// (, line 183
// <-, line 183
slice_from("gentl");
break;
case 8:
// (, line 184
// <-, line 184
slice_from("ugli");
break;
case 9:
// (, line 185
// <-, line 185
slice_from("earli");
break;
case 10:
// (, line 186
// <-, line 186
slice_from("onli");
break;
case 11:
// (, line 187
// <-, line 187
slice_from("singl");
break;
}
return true;
}
private boolean r_postlude() {
int v_1;
int v_2;
// (, line 203
// Boolean test Y_found, line 203
if (!(B_Y_found))
{
return false;
}
// repeat, line 203
replab0: while(true)
{
v_1 = cursor;
lab1: do {
// (, line 203
// goto, line 203
golab2: while(true)
{
v_2 = cursor;
lab3: do {
// (, line 203
// [, line 203
bra = cursor;
// literal, line 203
if (!(eq_s(1, "Y")))
{
break lab3;
}
// ], line 203
ket = cursor;
cursor = v_2;
break golab2;
} while (false);
cursor = v_2;
if (cursor >= limit)
{
break lab1;
}
cursor++;
}
// <-, line 203
slice_from("y");
continue replab0;
} while (false);
cursor = v_1;
break replab0;
}
return true;
}
public boolean stem() {
int v_1;
int v_2;
int v_3;
int v_4;
int v_5;
int v_6;
int v_7;
int v_8;
int v_9;
int v_10;
int v_11;
int v_12;
int v_13;
// (, line 205
// or, line 207
lab0: do {
v_1 = cursor;
lab1: do {
// call exception1, line 207
if (!r_exception1())
{
break lab1;
}
break lab0;
} while (false);
cursor = v_1;
lab2: do {
// not, line 208
{
v_2 = cursor;
lab3: do {
// hop, line 208
{
int c = cursor + 3;
if (0 > c || c > limit)
{
break lab3;
}
cursor = c;
}
break lab2;
} while (false);
cursor = v_2;
}
break lab0;
} while (false);
cursor = v_1;
// (, line 208
// do, line 209
v_3 = cursor;
lab4: do {
// call prelude, line 209
if (!r_prelude())
{
break lab4;
}
} while (false);
cursor = v_3;
// do, line 210
v_4 = cursor;
lab5: do {
// call mark_regions, line 210
if (!r_mark_regions())
{
break lab5;
}
} while (false);
cursor = v_4;
// backwards, line 211
limit_backward = cursor; cursor = limit;
// (, line 211
// do, line 213
v_5 = limit - cursor;
lab6: do {
// call Step_1a, line 213
if (!r_Step_1a())
{
break lab6;
}
} while (false);
cursor = limit - v_5;
// or, line 215
lab7: do {
v_6 = limit - cursor;
lab8: do {
// call exception2, line 215
if (!r_exception2())
{
break lab8;
}
break lab7;
} while (false);
cursor = limit - v_6;
// (, line 215
// do, line 217
v_7 = limit - cursor;
lab9: do {
// call Step_1b, line 217
if (!r_Step_1b())
{
break lab9;
}
} while (false);
cursor = limit - v_7;
// do, line 218
v_8 = limit - cursor;
lab10: do {
// call Step_1c, line 218
if (!r_Step_1c())
{
break lab10;
}
} while (false);
cursor = limit - v_8;
// do, line 220
v_9 = limit - cursor;
lab11: do {
// call Step_2, line 220
if (!r_Step_2())
{
break lab11;
}
} while (false);
cursor = limit - v_9;
// do, line 221
v_10 = limit - cursor;
lab12: do {
// call Step_3, line 221
if (!r_Step_3())
{
break lab12;
}
} while (false);
cursor = limit - v_10;
// do, line 222
v_11 = limit - cursor;
lab13: do {
// call Step_4, line 222
if (!r_Step_4())
{
break lab13;
}
} while (false);
cursor = limit - v_11;
// do, line 224
v_12 = limit - cursor;
lab14: do {
// call Step_5, line 224
if (!r_Step_5())
{
break lab14;
}
} while (false);
cursor = limit - v_12;
} while (false);
cursor = limit_backward; // do, line 227
v_13 = cursor;
lab15: do {
// call postlude, line 227
if (!r_postlude())
{
break lab15;
}
} while (false);
cursor = v_13;
} while (false);
return true;
}
public boolean equals( Object o ) {
return o instanceof englishStemmer;
}
public int hashCode() {
return englishStemmer.class.getName().hashCode();
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/stemmer
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/stemmer/snowball/finnishStemmer.java
|
// CHECKSTYLE:OFF
/*
Copyright (c) 2001, Dr Martin Porter
Copyright (c) 2002, Richard Boulton
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* Neither the name of the copyright holders nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
// This file was generated automatically by the Snowball to Java compiler
package opennlp.tools.stemmer.snowball;
/**
* This class was automatically generated by a Snowball to Java compiler
* It implements the stemming algorithm defined by a snowball script.
*/
class finnishStemmer extends opennlp.tools.stemmer.snowball.AbstractSnowballStemmer {
private final static finnishStemmer methodObject = new finnishStemmer ();
private final static Among a_0[] = {
new Among ( "pa", -1, 1, "", methodObject ),
new Among ( "sti", -1, 2, "", methodObject ),
new Among ( "kaan", -1, 1, "", methodObject ),
new Among ( "han", -1, 1, "", methodObject ),
new Among ( "kin", -1, 1, "", methodObject ),
new Among ( "h\u00E4n", -1, 1, "", methodObject ),
new Among ( "k\u00E4\u00E4n", -1, 1, "", methodObject ),
new Among ( "ko", -1, 1, "", methodObject ),
new Among ( "p\u00E4", -1, 1, "", methodObject ),
new Among ( "k\u00F6", -1, 1, "", methodObject )
};
private final static Among a_1[] = {
new Among ( "lla", -1, -1, "", methodObject ),
new Among ( "na", -1, -1, "", methodObject ),
new Among ( "ssa", -1, -1, "", methodObject ),
new Among ( "ta", -1, -1, "", methodObject ),
new Among ( "lta", 3, -1, "", methodObject ),
new Among ( "sta", 3, -1, "", methodObject )
};
private final static Among a_2[] = {
new Among ( "ll\u00E4", -1, -1, "", methodObject ),
new Among ( "n\u00E4", -1, -1, "", methodObject ),
new Among ( "ss\u00E4", -1, -1, "", methodObject ),
new Among ( "t\u00E4", -1, -1, "", methodObject ),
new Among ( "lt\u00E4", 3, -1, "", methodObject ),
new Among ( "st\u00E4", 3, -1, "", methodObject )
};
private final static Among a_3[] = {
new Among ( "lle", -1, -1, "", methodObject ),
new Among ( "ine", -1, -1, "", methodObject )
};
private final static Among a_4[] = {
new Among ( "nsa", -1, 3, "", methodObject ),
new Among ( "mme", -1, 3, "", methodObject ),
new Among ( "nne", -1, 3, "", methodObject ),
new Among ( "ni", -1, 2, "", methodObject ),
new Among ( "si", -1, 1, "", methodObject ),
new Among ( "an", -1, 4, "", methodObject ),
new Among ( "en", -1, 6, "", methodObject ),
new Among ( "\u00E4n", -1, 5, "", methodObject ),
new Among ( "ns\u00E4", -1, 3, "", methodObject )
};
private final static Among a_5[] = {
new Among ( "aa", -1, -1, "", methodObject ),
new Among ( "ee", -1, -1, "", methodObject ),
new Among ( "ii", -1, -1, "", methodObject ),
new Among ( "oo", -1, -1, "", methodObject ),
new Among ( "uu", -1, -1, "", methodObject ),
new Among ( "\u00E4\u00E4", -1, -1, "", methodObject ),
new Among ( "\u00F6\u00F6", -1, -1, "", methodObject )
};
private final static Among a_6[] = {
new Among ( "a", -1, 8, "", methodObject ),
new Among ( "lla", 0, -1, "", methodObject ),
new Among ( "na", 0, -1, "", methodObject ),
new Among ( "ssa", 0, -1, "", methodObject ),
new Among ( "ta", 0, -1, "", methodObject ),
new Among ( "lta", 4, -1, "", methodObject ),
new Among ( "sta", 4, -1, "", methodObject ),
new Among ( "tta", 4, 9, "", methodObject ),
new Among ( "lle", -1, -1, "", methodObject ),
new Among ( "ine", -1, -1, "", methodObject ),
new Among ( "ksi", -1, -1, "", methodObject ),
new Among ( "n", -1, 7, "", methodObject ),
new Among ( "han", 11, 1, "", methodObject ),
new Among ( "den", 11, -1, "r_VI", methodObject ),
new Among ( "seen", 11, -1, "r_LONG", methodObject ),
new Among ( "hen", 11, 2, "", methodObject ),
new Among ( "tten", 11, -1, "r_VI", methodObject ),
new Among ( "hin", 11, 3, "", methodObject ),
new Among ( "siin", 11, -1, "r_VI", methodObject ),
new Among ( "hon", 11, 4, "", methodObject ),
new Among ( "h\u00E4n", 11, 5, "", methodObject ),
new Among ( "h\u00F6n", 11, 6, "", methodObject ),
new Among ( "\u00E4", -1, 8, "", methodObject ),
new Among ( "ll\u00E4", 22, -1, "", methodObject ),
new Among ( "n\u00E4", 22, -1, "", methodObject ),
new Among ( "ss\u00E4", 22, -1, "", methodObject ),
new Among ( "t\u00E4", 22, -1, "", methodObject ),
new Among ( "lt\u00E4", 26, -1, "", methodObject ),
new Among ( "st\u00E4", 26, -1, "", methodObject ),
new Among ( "tt\u00E4", 26, 9, "", methodObject )
};
private final static Among a_7[] = {
new Among ( "eja", -1, -1, "", methodObject ),
new Among ( "mma", -1, 1, "", methodObject ),
new Among ( "imma", 1, -1, "", methodObject ),
new Among ( "mpa", -1, 1, "", methodObject ),
new Among ( "impa", 3, -1, "", methodObject ),
new Among ( "mmi", -1, 1, "", methodObject ),
new Among ( "immi", 5, -1, "", methodObject ),
new Among ( "mpi", -1, 1, "", methodObject ),
new Among ( "impi", 7, -1, "", methodObject ),
new Among ( "ej\u00E4", -1, -1, "", methodObject ),
new Among ( "mm\u00E4", -1, 1, "", methodObject ),
new Among ( "imm\u00E4", 10, -1, "", methodObject ),
new Among ( "mp\u00E4", -1, 1, "", methodObject ),
new Among ( "imp\u00E4", 12, -1, "", methodObject )
};
private final static Among a_8[] = {
new Among ( "i", -1, -1, "", methodObject ),
new Among ( "j", -1, -1, "", methodObject )
};
private final static Among a_9[] = {
new Among ( "mma", -1, 1, "", methodObject ),
new Among ( "imma", 0, -1, "", methodObject )
};
private static final char g_AEI[] = {17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8 };
private static final char g_V1[] = {17, 65, 16, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 0, 32 };
private static final char g_V2[] = {17, 65, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 0, 32 };
private static final char g_particle_end[] = {17, 97, 24, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 0, 32 };
private boolean B_ending_removed;
private java.lang.StringBuilder S_x = new java.lang.StringBuilder();
private int I_p2;
private int I_p1;
private void copy_from(finnishStemmer other) {
B_ending_removed = other.B_ending_removed;
S_x = other.S_x;
I_p2 = other.I_p2;
I_p1 = other.I_p1;
super.copy_from(other);
}
private boolean r_mark_regions() {
int v_1;
int v_3;
// (, line 41
I_p1 = limit;
I_p2 = limit;
// goto, line 46
golab0: while(true)
{
v_1 = cursor;
lab1: do {
if (!(in_grouping(g_V1, 97, 246)))
{
break lab1;
}
cursor = v_1;
break golab0;
} while (false);
cursor = v_1;
if (cursor >= limit)
{
return false;
}
cursor++;
}
// gopast, line 46
golab2: while(true)
{
lab3: do {
if (!(out_grouping(g_V1, 97, 246)))
{
break lab3;
}
break golab2;
} while (false);
if (cursor >= limit)
{
return false;
}
cursor++;
}
// setmark p1, line 46
I_p1 = cursor;
// goto, line 47
golab4: while(true)
{
v_3 = cursor;
lab5: do {
if (!(in_grouping(g_V1, 97, 246)))
{
break lab5;
}
cursor = v_3;
break golab4;
} while (false);
cursor = v_3;
if (cursor >= limit)
{
return false;
}
cursor++;
}
// gopast, line 47
golab6: while(true)
{
lab7: do {
if (!(out_grouping(g_V1, 97, 246)))
{
break lab7;
}
break golab6;
} while (false);
if (cursor >= limit)
{
return false;
}
cursor++;
}
// setmark p2, line 47
I_p2 = cursor;
return true;
}
private boolean r_R2() {
if (!(I_p2 <= cursor))
{
return false;
}
return true;
}
private boolean r_particle_etc() {
int among_var;
int v_1;
int v_2;
// (, line 54
// setlimit, line 55
v_1 = limit - cursor;
// tomark, line 55
if (cursor < I_p1)
{
return false;
}
cursor = I_p1;
v_2 = limit_backward;
limit_backward = cursor;
cursor = limit - v_1;
// (, line 55
// [, line 55
ket = cursor;
// substring, line 55
among_var = find_among_b(a_0, 10);
if (among_var == 0)
{
limit_backward = v_2;
return false;
}
// ], line 55
bra = cursor;
limit_backward = v_2;
switch(among_var) {
case 0:
return false;
case 1:
// (, line 62
if (!(in_grouping_b(g_particle_end, 97, 246)))
{
return false;
}
break;
case 2:
// (, line 64
// call R2, line 64
if (!r_R2())
{
return false;
}
break;
}
// delete, line 66
slice_del();
return true;
}
private boolean r_possessive() {
int among_var;
int v_1;
int v_2;
int v_3;
// (, line 68
// setlimit, line 69
v_1 = limit - cursor;
// tomark, line 69
if (cursor < I_p1)
{
return false;
}
cursor = I_p1;
v_2 = limit_backward;
limit_backward = cursor;
cursor = limit - v_1;
// (, line 69
// [, line 69
ket = cursor;
// substring, line 69
among_var = find_among_b(a_4, 9);
if (among_var == 0)
{
limit_backward = v_2;
return false;
}
// ], line 69
bra = cursor;
limit_backward = v_2;
switch(among_var) {
case 0:
return false;
case 1:
// (, line 72
// not, line 72
{
v_3 = limit - cursor;
lab0: do {
// literal, line 72
if (!(eq_s_b(1, "k")))
{
break lab0;
}
return false;
} while (false);
cursor = limit - v_3;
}
// delete, line 72
slice_del();
break;
case 2:
// (, line 74
// delete, line 74
slice_del();
// [, line 74
ket = cursor;
// literal, line 74
if (!(eq_s_b(3, "kse")))
{
return false;
}
// ], line 74
bra = cursor;
// <-, line 74
slice_from("ksi");
break;
case 3:
// (, line 78
// delete, line 78
slice_del();
break;
case 4:
// (, line 81
// among, line 81
if (find_among_b(a_1, 6) == 0)
{
return false;
}
// delete, line 81
slice_del();
break;
case 5:
// (, line 83
// among, line 83
if (find_among_b(a_2, 6) == 0)
{
return false;
}
// delete, line 84
slice_del();
break;
case 6:
// (, line 86
// among, line 86
if (find_among_b(a_3, 2) == 0)
{
return false;
}
// delete, line 86
slice_del();
break;
}
return true;
}
private boolean r_LONG() {
// among, line 91
if (find_among_b(a_5, 7) == 0)
{
return false;
}
return true;
}
private boolean r_VI() {
// (, line 93
// literal, line 93
if (!(eq_s_b(1, "i")))
{
return false;
}
if (!(in_grouping_b(g_V2, 97, 246)))
{
return false;
}
return true;
}
private boolean r_case_ending() {
int among_var;
int v_1;
int v_2;
int v_3;
int v_4;
int v_5;
// (, line 95
// setlimit, line 96
v_1 = limit - cursor;
// tomark, line 96
if (cursor < I_p1)
{
return false;
}
cursor = I_p1;
v_2 = limit_backward;
limit_backward = cursor;
cursor = limit - v_1;
// (, line 96
// [, line 96
ket = cursor;
// substring, line 96
among_var = find_among_b(a_6, 30);
if (among_var == 0)
{
limit_backward = v_2;
return false;
}
// ], line 96
bra = cursor;
limit_backward = v_2;
switch(among_var) {
case 0:
return false;
case 1:
// (, line 98
// literal, line 98
if (!(eq_s_b(1, "a")))
{
return false;
}
break;
case 2:
// (, line 99
// literal, line 99
if (!(eq_s_b(1, "e")))
{
return false;
}
break;
case 3:
// (, line 100
// literal, line 100
if (!(eq_s_b(1, "i")))
{
return false;
}
break;
case 4:
// (, line 101
// literal, line 101
if (!(eq_s_b(1, "o")))
{
return false;
}
break;
case 5:
// (, line 102
// literal, line 102
if (!(eq_s_b(1, "\u00E4")))
{
return false;
}
break;
case 6:
// (, line 103
// literal, line 103
if (!(eq_s_b(1, "\u00F6")))
{
return false;
}
break;
case 7:
// (, line 111
// try, line 111
v_3 = limit - cursor;
lab0: do {
// (, line 111
// and, line 113
v_4 = limit - cursor;
// or, line 112
lab1: do {
v_5 = limit - cursor;
lab2: do {
// call LONG, line 111
if (!r_LONG())
{
break lab2;
}
break lab1;
} while (false);
cursor = limit - v_5;
// literal, line 112
if (!(eq_s_b(2, "ie")))
{
cursor = limit - v_3;
break lab0;
}
} while (false);
cursor = limit - v_4;
// next, line 113
if (cursor <= limit_backward)
{
cursor = limit - v_3;
break lab0;
}
cursor--;
// ], line 113
bra = cursor;
} while (false);
break;
case 8:
// (, line 119
if (!(in_grouping_b(g_V1, 97, 246)))
{
return false;
}
if (!(out_grouping_b(g_V1, 97, 246)))
{
return false;
}
break;
case 9:
// (, line 121
// literal, line 121
if (!(eq_s_b(1, "e")))
{
return false;
}
break;
}
// delete, line 138
slice_del();
// set ending_removed, line 139
B_ending_removed = true;
return true;
}
private boolean r_other_endings() {
int among_var;
int v_1;
int v_2;
int v_3;
// (, line 141
// setlimit, line 142
v_1 = limit - cursor;
// tomark, line 142
if (cursor < I_p2)
{
return false;
}
cursor = I_p2;
v_2 = limit_backward;
limit_backward = cursor;
cursor = limit - v_1;
// (, line 142
// [, line 142
ket = cursor;
// substring, line 142
among_var = find_among_b(a_7, 14);
if (among_var == 0)
{
limit_backward = v_2;
return false;
}
// ], line 142
bra = cursor;
limit_backward = v_2;
switch(among_var) {
case 0:
return false;
case 1:
// (, line 146
// not, line 146
{
v_3 = limit - cursor;
lab0: do {
// literal, line 146
if (!(eq_s_b(2, "po")))
{
break lab0;
}
return false;
} while (false);
cursor = limit - v_3;
}
break;
}
// delete, line 151
slice_del();
return true;
}
private boolean r_i_plural() {
int v_1;
int v_2;
// (, line 153
// setlimit, line 154
v_1 = limit - cursor;
// tomark, line 154
if (cursor < I_p1)
{
return false;
}
cursor = I_p1;
v_2 = limit_backward;
limit_backward = cursor;
cursor = limit - v_1;
// (, line 154
// [, line 154
ket = cursor;
// substring, line 154
if (find_among_b(a_8, 2) == 0)
{
limit_backward = v_2;
return false;
}
// ], line 154
bra = cursor;
limit_backward = v_2;
// delete, line 158
slice_del();
return true;
}
private boolean r_t_plural() {
int among_var;
int v_1;
int v_2;
int v_3;
int v_4;
int v_5;
int v_6;
// (, line 160
// setlimit, line 161
v_1 = limit - cursor;
// tomark, line 161
if (cursor < I_p1)
{
return false;
}
cursor = I_p1;
v_2 = limit_backward;
limit_backward = cursor;
cursor = limit - v_1;
// (, line 161
// [, line 162
ket = cursor;
// literal, line 162
if (!(eq_s_b(1, "t")))
{
limit_backward = v_2;
return false;
}
// ], line 162
bra = cursor;
// test, line 162
v_3 = limit - cursor;
if (!(in_grouping_b(g_V1, 97, 246)))
{
limit_backward = v_2;
return false;
}
cursor = limit - v_3;
// delete, line 163
slice_del();
limit_backward = v_2;
// setlimit, line 165
v_4 = limit - cursor;
// tomark, line 165
if (cursor < I_p2)
{
return false;
}
cursor = I_p2;
v_5 = limit_backward;
limit_backward = cursor;
cursor = limit - v_4;
// (, line 165
// [, line 165
ket = cursor;
// substring, line 165
among_var = find_among_b(a_9, 2);
if (among_var == 0)
{
limit_backward = v_5;
return false;
}
// ], line 165
bra = cursor;
limit_backward = v_5;
switch(among_var) {
case 0:
return false;
case 1:
// (, line 167
// not, line 167
{
v_6 = limit - cursor;
lab0: do {
// literal, line 167
if (!(eq_s_b(2, "po")))
{
break lab0;
}
return false;
} while (false);
cursor = limit - v_6;
}
break;
}
// delete, line 170
slice_del();
return true;
}
private boolean r_tidy() {
int v_1;
int v_2;
int v_3;
int v_4;
int v_5;
int v_6;
int v_7;
int v_8;
int v_9;
// (, line 172
// setlimit, line 173
v_1 = limit - cursor;
// tomark, line 173
if (cursor < I_p1)
{
return false;
}
cursor = I_p1;
v_2 = limit_backward;
limit_backward = cursor;
cursor = limit - v_1;
// (, line 173
// do, line 174
v_3 = limit - cursor;
lab0: do {
// (, line 174
// and, line 174
v_4 = limit - cursor;
// call LONG, line 174
if (!r_LONG())
{
break lab0;
}
cursor = limit - v_4;
// (, line 174
// [, line 174
ket = cursor;
// next, line 174
if (cursor <= limit_backward)
{
break lab0;
}
cursor--;
// ], line 174
bra = cursor;
// delete, line 174
slice_del();
} while (false);
cursor = limit - v_3;
// do, line 175
v_5 = limit - cursor;
lab1: do {
// (, line 175
// [, line 175
ket = cursor;
if (!(in_grouping_b(g_AEI, 97, 228)))
{
break lab1;
}
// ], line 175
bra = cursor;
if (!(out_grouping_b(g_V1, 97, 246)))
{
break lab1;
}
// delete, line 175
slice_del();
} while (false);
cursor = limit - v_5;
// do, line 176
v_6 = limit - cursor;
lab2: do {
// (, line 176
// [, line 176
ket = cursor;
// literal, line 176
if (!(eq_s_b(1, "j")))
{
break lab2;
}
// ], line 176
bra = cursor;
// or, line 176
lab3: do {
v_7 = limit - cursor;
lab4: do {
// literal, line 176
if (!(eq_s_b(1, "o")))
{
break lab4;
}
break lab3;
} while (false);
cursor = limit - v_7;
// literal, line 176
if (!(eq_s_b(1, "u")))
{
break lab2;
}
} while (false);
// delete, line 176
slice_del();
} while (false);
cursor = limit - v_6;
// do, line 177
v_8 = limit - cursor;
lab5: do {
// (, line 177
// [, line 177
ket = cursor;
// literal, line 177
if (!(eq_s_b(1, "o")))
{
break lab5;
}
// ], line 177
bra = cursor;
// literal, line 177
if (!(eq_s_b(1, "j")))
{
break lab5;
}
// delete, line 177
slice_del();
} while (false);
cursor = limit - v_8;
limit_backward = v_2;
// goto, line 179
golab6: while(true)
{
v_9 = limit - cursor;
lab7: do {
if (!(out_grouping_b(g_V1, 97, 246)))
{
break lab7;
}
cursor = limit - v_9;
break golab6;
} while (false);
cursor = limit - v_9;
if (cursor <= limit_backward)
{
return false;
}
cursor--;
}
// [, line 179
ket = cursor;
// next, line 179
if (cursor <= limit_backward)
{
return false;
}
cursor--;
// ], line 179
bra = cursor;
// -> x, line 179
S_x = slice_to(S_x);
// name x, line 179
if (!(eq_v_b(S_x)))
{
return false;
}
// delete, line 179
slice_del();
return true;
}
public boolean stem() {
int v_1;
int v_2;
int v_3;
int v_4;
int v_5;
int v_6;
int v_7;
int v_8;
int v_9;
// (, line 183
// do, line 185
v_1 = cursor;
lab0: do {
// call mark_regions, line 185
if (!r_mark_regions())
{
break lab0;
}
} while (false);
cursor = v_1;
// unset ending_removed, line 186
B_ending_removed = false;
// backwards, line 187
limit_backward = cursor; cursor = limit;
// (, line 187
// do, line 188
v_2 = limit - cursor;
lab1: do {
// call particle_etc, line 188
if (!r_particle_etc())
{
break lab1;
}
} while (false);
cursor = limit - v_2;
// do, line 189
v_3 = limit - cursor;
lab2: do {
// call possessive, line 189
if (!r_possessive())
{
break lab2;
}
} while (false);
cursor = limit - v_3;
// do, line 190
v_4 = limit - cursor;
lab3: do {
// call case_ending, line 190
if (!r_case_ending())
{
break lab3;
}
} while (false);
cursor = limit - v_4;
// do, line 191
v_5 = limit - cursor;
lab4: do {
// call other_endings, line 191
if (!r_other_endings())
{
break lab4;
}
} while (false);
cursor = limit - v_5;
// or, line 192
lab5: do {
v_6 = limit - cursor;
lab6: do {
// (, line 192
// Boolean test ending_removed, line 192
if (!(B_ending_removed))
{
break lab6;
}
// do, line 192
v_7 = limit - cursor;
lab7: do {
// call i_plural, line 192
if (!r_i_plural())
{
break lab7;
}
} while (false);
cursor = limit - v_7;
break lab5;
} while (false);
cursor = limit - v_6;
// do, line 192
v_8 = limit - cursor;
lab8: do {
// call t_plural, line 192
if (!r_t_plural())
{
break lab8;
}
} while (false);
cursor = limit - v_8;
} while (false);
// do, line 193
v_9 = limit - cursor;
lab9: do {
// call tidy, line 193
if (!r_tidy())
{
break lab9;
}
} while (false);
cursor = limit - v_9;
cursor = limit_backward; return true;
}
public boolean equals( Object o ) {
return o instanceof finnishStemmer;
}
public int hashCode() {
return finnishStemmer.class.getName().hashCode();
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/stemmer
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/stemmer/snowball/frenchStemmer.java
|
// CHECKSTYLE:OFF
/*
Copyright (c) 2001, Dr Martin Porter
Copyright (c) 2002, Richard Boulton
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* Neither the name of the copyright holders nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
// This file was generated automatically by the Snowball to Java compiler
package opennlp.tools.stemmer.snowball;
/**
* This class was automatically generated by a Snowball to Java compiler
* It implements the stemming algorithm defined by a snowball script.
*/
class frenchStemmer extends opennlp.tools.stemmer.snowball.AbstractSnowballStemmer {
private final static frenchStemmer methodObject = new frenchStemmer ();
private final static Among a_0[] = {
new Among ( "col", -1, -1, "", methodObject ),
new Among ( "par", -1, -1, "", methodObject ),
new Among ( "tap", -1, -1, "", methodObject )
};
private final static Among a_1[] = {
new Among ( "", -1, 4, "", methodObject ),
new Among ( "I", 0, 1, "", methodObject ),
new Among ( "U", 0, 2, "", methodObject ),
new Among ( "Y", 0, 3, "", methodObject )
};
private final static Among a_2[] = {
new Among ( "iqU", -1, 3, "", methodObject ),
new Among ( "abl", -1, 3, "", methodObject ),
new Among ( "I\u00E8r", -1, 4, "", methodObject ),
new Among ( "i\u00E8r", -1, 4, "", methodObject ),
new Among ( "eus", -1, 2, "", methodObject ),
new Among ( "iv", -1, 1, "", methodObject )
};
private final static Among a_3[] = {
new Among ( "ic", -1, 2, "", methodObject ),
new Among ( "abil", -1, 1, "", methodObject ),
new Among ( "iv", -1, 3, "", methodObject )
};
private final static Among a_4[] = {
new Among ( "iqUe", -1, 1, "", methodObject ),
new Among ( "atrice", -1, 2, "", methodObject ),
new Among ( "ance", -1, 1, "", methodObject ),
new Among ( "ence", -1, 5, "", methodObject ),
new Among ( "logie", -1, 3, "", methodObject ),
new Among ( "able", -1, 1, "", methodObject ),
new Among ( "isme", -1, 1, "", methodObject ),
new Among ( "euse", -1, 11, "", methodObject ),
new Among ( "iste", -1, 1, "", methodObject ),
new Among ( "ive", -1, 8, "", methodObject ),
new Among ( "if", -1, 8, "", methodObject ),
new Among ( "usion", -1, 4, "", methodObject ),
new Among ( "ation", -1, 2, "", methodObject ),
new Among ( "ution", -1, 4, "", methodObject ),
new Among ( "ateur", -1, 2, "", methodObject ),
new Among ( "iqUes", -1, 1, "", methodObject ),
new Among ( "atrices", -1, 2, "", methodObject ),
new Among ( "ances", -1, 1, "", methodObject ),
new Among ( "ences", -1, 5, "", methodObject ),
new Among ( "logies", -1, 3, "", methodObject ),
new Among ( "ables", -1, 1, "", methodObject ),
new Among ( "ismes", -1, 1, "", methodObject ),
new Among ( "euses", -1, 11, "", methodObject ),
new Among ( "istes", -1, 1, "", methodObject ),
new Among ( "ives", -1, 8, "", methodObject ),
new Among ( "ifs", -1, 8, "", methodObject ),
new Among ( "usions", -1, 4, "", methodObject ),
new Among ( "ations", -1, 2, "", methodObject ),
new Among ( "utions", -1, 4, "", methodObject ),
new Among ( "ateurs", -1, 2, "", methodObject ),
new Among ( "ments", -1, 15, "", methodObject ),
new Among ( "ements", 30, 6, "", methodObject ),
new Among ( "issements", 31, 12, "", methodObject ),
new Among ( "it\u00E9s", -1, 7, "", methodObject ),
new Among ( "ment", -1, 15, "", methodObject ),
new Among ( "ement", 34, 6, "", methodObject ),
new Among ( "issement", 35, 12, "", methodObject ),
new Among ( "amment", 34, 13, "", methodObject ),
new Among ( "emment", 34, 14, "", methodObject ),
new Among ( "aux", -1, 10, "", methodObject ),
new Among ( "eaux", 39, 9, "", methodObject ),
new Among ( "eux", -1, 1, "", methodObject ),
new Among ( "it\u00E9", -1, 7, "", methodObject )
};
private final static Among a_5[] = {
new Among ( "ira", -1, 1, "", methodObject ),
new Among ( "ie", -1, 1, "", methodObject ),
new Among ( "isse", -1, 1, "", methodObject ),
new Among ( "issante", -1, 1, "", methodObject ),
new Among ( "i", -1, 1, "", methodObject ),
new Among ( "irai", 4, 1, "", methodObject ),
new Among ( "ir", -1, 1, "", methodObject ),
new Among ( "iras", -1, 1, "", methodObject ),
new Among ( "ies", -1, 1, "", methodObject ),
new Among ( "\u00EEmes", -1, 1, "", methodObject ),
new Among ( "isses", -1, 1, "", methodObject ),
new Among ( "issantes", -1, 1, "", methodObject ),
new Among ( "\u00EEtes", -1, 1, "", methodObject ),
new Among ( "is", -1, 1, "", methodObject ),
new Among ( "irais", 13, 1, "", methodObject ),
new Among ( "issais", 13, 1, "", methodObject ),
new Among ( "irions", -1, 1, "", methodObject ),
new Among ( "issions", -1, 1, "", methodObject ),
new Among ( "irons", -1, 1, "", methodObject ),
new Among ( "issons", -1, 1, "", methodObject ),
new Among ( "issants", -1, 1, "", methodObject ),
new Among ( "it", -1, 1, "", methodObject ),
new Among ( "irait", 21, 1, "", methodObject ),
new Among ( "issait", 21, 1, "", methodObject ),
new Among ( "issant", -1, 1, "", methodObject ),
new Among ( "iraIent", -1, 1, "", methodObject ),
new Among ( "issaIent", -1, 1, "", methodObject ),
new Among ( "irent", -1, 1, "", methodObject ),
new Among ( "issent", -1, 1, "", methodObject ),
new Among ( "iront", -1, 1, "", methodObject ),
new Among ( "\u00EEt", -1, 1, "", methodObject ),
new Among ( "iriez", -1, 1, "", methodObject ),
new Among ( "issiez", -1, 1, "", methodObject ),
new Among ( "irez", -1, 1, "", methodObject ),
new Among ( "issez", -1, 1, "", methodObject )
};
private final static Among a_6[] = {
new Among ( "a", -1, 3, "", methodObject ),
new Among ( "era", 0, 2, "", methodObject ),
new Among ( "asse", -1, 3, "", methodObject ),
new Among ( "ante", -1, 3, "", methodObject ),
new Among ( "\u00E9e", -1, 2, "", methodObject ),
new Among ( "ai", -1, 3, "", methodObject ),
new Among ( "erai", 5, 2, "", methodObject ),
new Among ( "er", -1, 2, "", methodObject ),
new Among ( "as", -1, 3, "", methodObject ),
new Among ( "eras", 8, 2, "", methodObject ),
new Among ( "\u00E2mes", -1, 3, "", methodObject ),
new Among ( "asses", -1, 3, "", methodObject ),
new Among ( "antes", -1, 3, "", methodObject ),
new Among ( "\u00E2tes", -1, 3, "", methodObject ),
new Among ( "\u00E9es", -1, 2, "", methodObject ),
new Among ( "ais", -1, 3, "", methodObject ),
new Among ( "erais", 15, 2, "", methodObject ),
new Among ( "ions", -1, 1, "", methodObject ),
new Among ( "erions", 17, 2, "", methodObject ),
new Among ( "assions", 17, 3, "", methodObject ),
new Among ( "erons", -1, 2, "", methodObject ),
new Among ( "ants", -1, 3, "", methodObject ),
new Among ( "\u00E9s", -1, 2, "", methodObject ),
new Among ( "ait", -1, 3, "", methodObject ),
new Among ( "erait", 23, 2, "", methodObject ),
new Among ( "ant", -1, 3, "", methodObject ),
new Among ( "aIent", -1, 3, "", methodObject ),
new Among ( "eraIent", 26, 2, "", methodObject ),
new Among ( "\u00E8rent", -1, 2, "", methodObject ),
new Among ( "assent", -1, 3, "", methodObject ),
new Among ( "eront", -1, 2, "", methodObject ),
new Among ( "\u00E2t", -1, 3, "", methodObject ),
new Among ( "ez", -1, 2, "", methodObject ),
new Among ( "iez", 32, 2, "", methodObject ),
new Among ( "eriez", 33, 2, "", methodObject ),
new Among ( "assiez", 33, 3, "", methodObject ),
new Among ( "erez", 32, 2, "", methodObject ),
new Among ( "\u00E9", -1, 2, "", methodObject )
};
private final static Among a_7[] = {
new Among ( "e", -1, 3, "", methodObject ),
new Among ( "I\u00E8re", 0, 2, "", methodObject ),
new Among ( "i\u00E8re", 0, 2, "", methodObject ),
new Among ( "ion", -1, 1, "", methodObject ),
new Among ( "Ier", -1, 2, "", methodObject ),
new Among ( "ier", -1, 2, "", methodObject ),
new Among ( "\u00EB", -1, 4, "", methodObject )
};
private final static Among a_8[] = {
new Among ( "ell", -1, -1, "", methodObject ),
new Among ( "eill", -1, -1, "", methodObject ),
new Among ( "enn", -1, -1, "", methodObject ),
new Among ( "onn", -1, -1, "", methodObject ),
new Among ( "ett", -1, -1, "", methodObject )
};
private static final char g_v[] = {17, 65, 16, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 128, 130, 103, 8, 5 };
private static final char g_keep_with_s[] = {1, 65, 20, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 128 };
private int I_p2;
private int I_p1;
private int I_pV;
private void copy_from(frenchStemmer other) {
I_p2 = other.I_p2;
I_p1 = other.I_p1;
I_pV = other.I_pV;
super.copy_from(other);
}
private boolean r_prelude() {
int v_1;
int v_2;
int v_3;
int v_4;
// repeat, line 38
replab0: while(true)
{
v_1 = cursor;
lab1: do {
// goto, line 38
golab2: while(true)
{
v_2 = cursor;
lab3: do {
// (, line 38
// or, line 44
lab4: do {
v_3 = cursor;
lab5: do {
// (, line 40
if (!(in_grouping(g_v, 97, 251)))
{
break lab5;
}
// [, line 40
bra = cursor;
// or, line 40
lab6: do {
v_4 = cursor;
lab7: do {
// (, line 40
// literal, line 40
if (!(eq_s(1, "u")))
{
break lab7;
}
// ], line 40
ket = cursor;
if (!(in_grouping(g_v, 97, 251)))
{
break lab7;
}
// <-, line 40
slice_from("U");
break lab6;
} while (false);
cursor = v_4;
lab8: do {
// (, line 41
// literal, line 41
if (!(eq_s(1, "i")))
{
break lab8;
}
// ], line 41
ket = cursor;
if (!(in_grouping(g_v, 97, 251)))
{
break lab8;
}
// <-, line 41
slice_from("I");
break lab6;
} while (false);
cursor = v_4;
// (, line 42
// literal, line 42
if (!(eq_s(1, "y")))
{
break lab5;
}
// ], line 42
ket = cursor;
// <-, line 42
slice_from("Y");
} while (false);
break lab4;
} while (false);
cursor = v_3;
lab9: do {
// (, line 45
// [, line 45
bra = cursor;
// literal, line 45
if (!(eq_s(1, "y")))
{
break lab9;
}
// ], line 45
ket = cursor;
if (!(in_grouping(g_v, 97, 251)))
{
break lab9;
}
// <-, line 45
slice_from("Y");
break lab4;
} while (false);
cursor = v_3;
// (, line 47
// literal, line 47
if (!(eq_s(1, "q")))
{
break lab3;
}
// [, line 47
bra = cursor;
// literal, line 47
if (!(eq_s(1, "u")))
{
break lab3;
}
// ], line 47
ket = cursor;
// <-, line 47
slice_from("U");
} while (false);
cursor = v_2;
break golab2;
} while (false);
cursor = v_2;
if (cursor >= limit)
{
break lab1;
}
cursor++;
}
continue replab0;
} while (false);
cursor = v_1;
break replab0;
}
return true;
}
private boolean r_mark_regions() {
int v_1;
int v_2;
int v_4;
// (, line 50
I_pV = limit;
I_p1 = limit;
I_p2 = limit;
// do, line 56
v_1 = cursor;
lab0: do {
// (, line 56
// or, line 58
lab1: do {
v_2 = cursor;
lab2: do {
// (, line 57
if (!(in_grouping(g_v, 97, 251)))
{
break lab2;
}
if (!(in_grouping(g_v, 97, 251)))
{
break lab2;
}
// next, line 57
if (cursor >= limit)
{
break lab2;
}
cursor++;
break lab1;
} while (false);
cursor = v_2;
lab3: do {
// among, line 59
if (find_among(a_0, 3) == 0)
{
break lab3;
}
break lab1;
} while (false);
cursor = v_2;
// (, line 66
// next, line 66
if (cursor >= limit)
{
break lab0;
}
cursor++;
// gopast, line 66
golab4: while(true)
{
lab5: do {
if (!(in_grouping(g_v, 97, 251)))
{
break lab5;
}
break golab4;
} while (false);
if (cursor >= limit)
{
break lab0;
}
cursor++;
}
} while (false);
// setmark pV, line 67
I_pV = cursor;
} while (false);
cursor = v_1;
// do, line 69
v_4 = cursor;
lab6: do {
// (, line 69
// gopast, line 70
golab7: while(true)
{
lab8: do {
if (!(in_grouping(g_v, 97, 251)))
{
break lab8;
}
break golab7;
} while (false);
if (cursor >= limit)
{
break lab6;
}
cursor++;
}
// gopast, line 70
golab9: while(true)
{
lab10: do {
if (!(out_grouping(g_v, 97, 251)))
{
break lab10;
}
break golab9;
} while (false);
if (cursor >= limit)
{
break lab6;
}
cursor++;
}
// setmark p1, line 70
I_p1 = cursor;
// gopast, line 71
golab11: while(true)
{
lab12: do {
if (!(in_grouping(g_v, 97, 251)))
{
break lab12;
}
break golab11;
} while (false);
if (cursor >= limit)
{
break lab6;
}
cursor++;
}
// gopast, line 71
golab13: while(true)
{
lab14: do {
if (!(out_grouping(g_v, 97, 251)))
{
break lab14;
}
break golab13;
} while (false);
if (cursor >= limit)
{
break lab6;
}
cursor++;
}
// setmark p2, line 71
I_p2 = cursor;
} while (false);
cursor = v_4;
return true;
}
private boolean r_postlude() {
int among_var;
int v_1;
// repeat, line 75
replab0: while(true)
{
v_1 = cursor;
lab1: do {
// (, line 75
// [, line 77
bra = cursor;
// substring, line 77
among_var = find_among(a_1, 4);
if (among_var == 0)
{
break lab1;
}
// ], line 77
ket = cursor;
switch(among_var) {
case 0:
break lab1;
case 1:
// (, line 78
// <-, line 78
slice_from("i");
break;
case 2:
// (, line 79
// <-, line 79
slice_from("u");
break;
case 3:
// (, line 80
// <-, line 80
slice_from("y");
break;
case 4:
// (, line 81
// next, line 81
if (cursor >= limit)
{
break lab1;
}
cursor++;
break;
}
continue replab0;
} while (false);
cursor = v_1;
break replab0;
}
return true;
}
private boolean r_RV() {
if (!(I_pV <= cursor))
{
return false;
}
return true;
}
private boolean r_R1() {
if (!(I_p1 <= cursor))
{
return false;
}
return true;
}
private boolean r_R2() {
if (!(I_p2 <= cursor))
{
return false;
}
return true;
}
private boolean r_standard_suffix() {
int among_var;
int v_1;
int v_2;
int v_3;
int v_4;
int v_5;
int v_6;
int v_7;
int v_8;
int v_9;
int v_10;
int v_11;
// (, line 91
// [, line 92
ket = cursor;
// substring, line 92
among_var = find_among_b(a_4, 43);
if (among_var == 0)
{
return false;
}
// ], line 92
bra = cursor;
switch(among_var) {
case 0:
return false;
case 1:
// (, line 96
// call R2, line 96
if (!r_R2())
{
return false;
}
// delete, line 96
slice_del();
break;
case 2:
// (, line 99
// call R2, line 99
if (!r_R2())
{
return false;
}
// delete, line 99
slice_del();
// try, line 100
v_1 = limit - cursor;
lab0: do {
// (, line 100
// [, line 100
ket = cursor;
// literal, line 100
if (!(eq_s_b(2, "ic")))
{
cursor = limit - v_1;
break lab0;
}
// ], line 100
bra = cursor;
// or, line 100
lab1: do {
v_2 = limit - cursor;
lab2: do {
// (, line 100
// call R2, line 100
if (!r_R2())
{
break lab2;
}
// delete, line 100
slice_del();
break lab1;
} while (false);
cursor = limit - v_2;
// <-, line 100
slice_from("iqU");
} while (false);
} while (false);
break;
case 3:
// (, line 104
// call R2, line 104
if (!r_R2())
{
return false;
}
// <-, line 104
slice_from("log");
break;
case 4:
// (, line 107
// call R2, line 107
if (!r_R2())
{
return false;
}
// <-, line 107
slice_from("u");
break;
case 5:
// (, line 110
// call R2, line 110
if (!r_R2())
{
return false;
}
// <-, line 110
slice_from("ent");
break;
case 6:
// (, line 113
// call RV, line 114
if (!r_RV())
{
return false;
}
// delete, line 114
slice_del();
// try, line 115
v_3 = limit - cursor;
lab3: do {
// (, line 115
// [, line 116
ket = cursor;
// substring, line 116
among_var = find_among_b(a_2, 6);
if (among_var == 0)
{
cursor = limit - v_3;
break lab3;
}
// ], line 116
bra = cursor;
switch(among_var) {
case 0:
cursor = limit - v_3;
break lab3;
case 1:
// (, line 117
// call R2, line 117
if (!r_R2())
{
cursor = limit - v_3;
break lab3;
}
// delete, line 117
slice_del();
// [, line 117
ket = cursor;
// literal, line 117
if (!(eq_s_b(2, "at")))
{
cursor = limit - v_3;
break lab3;
}
// ], line 117
bra = cursor;
// call R2, line 117
if (!r_R2())
{
cursor = limit - v_3;
break lab3;
}
// delete, line 117
slice_del();
break;
case 2:
// (, line 118
// or, line 118
lab4: do {
v_4 = limit - cursor;
lab5: do {
// (, line 118
// call R2, line 118
if (!r_R2())
{
break lab5;
}
// delete, line 118
slice_del();
break lab4;
} while (false);
cursor = limit - v_4;
// (, line 118
// call R1, line 118
if (!r_R1())
{
cursor = limit - v_3;
break lab3;
}
// <-, line 118
slice_from("eux");
} while (false);
break;
case 3:
// (, line 120
// call R2, line 120
if (!r_R2())
{
cursor = limit - v_3;
break lab3;
}
// delete, line 120
slice_del();
break;
case 4:
// (, line 122
// call RV, line 122
if (!r_RV())
{
cursor = limit - v_3;
break lab3;
}
// <-, line 122
slice_from("i");
break;
}
} while (false);
break;
case 7:
// (, line 128
// call R2, line 129
if (!r_R2())
{
return false;
}
// delete, line 129
slice_del();
// try, line 130
v_5 = limit - cursor;
lab6: do {
// (, line 130
// [, line 131
ket = cursor;
// substring, line 131
among_var = find_among_b(a_3, 3);
if (among_var == 0)
{
cursor = limit - v_5;
break lab6;
}
// ], line 131
bra = cursor;
switch(among_var) {
case 0:
cursor = limit - v_5;
break lab6;
case 1:
// (, line 132
// or, line 132
lab7: do {
v_6 = limit - cursor;
lab8: do {
// (, line 132
// call R2, line 132
if (!r_R2())
{
break lab8;
}
// delete, line 132
slice_del();
break lab7;
} while (false);
cursor = limit - v_6;
// <-, line 132
slice_from("abl");
} while (false);
break;
case 2:
// (, line 133
// or, line 133
lab9: do {
v_7 = limit - cursor;
lab10: do {
// (, line 133
// call R2, line 133
if (!r_R2())
{
break lab10;
}
// delete, line 133
slice_del();
break lab9;
} while (false);
cursor = limit - v_7;
// <-, line 133
slice_from("iqU");
} while (false);
break;
case 3:
// (, line 134
// call R2, line 134
if (!r_R2())
{
cursor = limit - v_5;
break lab6;
}
// delete, line 134
slice_del();
break;
}
} while (false);
break;
case 8:
// (, line 140
// call R2, line 141
if (!r_R2())
{
return false;
}
// delete, line 141
slice_del();
// try, line 142
v_8 = limit - cursor;
lab11: do {
// (, line 142
// [, line 142
ket = cursor;
// literal, line 142
if (!(eq_s_b(2, "at")))
{
cursor = limit - v_8;
break lab11;
}
// ], line 142
bra = cursor;
// call R2, line 142
if (!r_R2())
{
cursor = limit - v_8;
break lab11;
}
// delete, line 142
slice_del();
// [, line 142
ket = cursor;
// literal, line 142
if (!(eq_s_b(2, "ic")))
{
cursor = limit - v_8;
break lab11;
}
// ], line 142
bra = cursor;
// or, line 142
lab12: do {
v_9 = limit - cursor;
lab13: do {
// (, line 142
// call R2, line 142
if (!r_R2())
{
break lab13;
}
// delete, line 142
slice_del();
break lab12;
} while (false);
cursor = limit - v_9;
// <-, line 142
slice_from("iqU");
} while (false);
} while (false);
break;
case 9:
// (, line 144
// <-, line 144
slice_from("eau");
break;
case 10:
// (, line 145
// call R1, line 145
if (!r_R1())
{
return false;
}
// <-, line 145
slice_from("al");
break;
case 11:
// (, line 147
// or, line 147
lab14: do {
v_10 = limit - cursor;
lab15: do {
// (, line 147
// call R2, line 147
if (!r_R2())
{
break lab15;
}
// delete, line 147
slice_del();
break lab14;
} while (false);
cursor = limit - v_10;
// (, line 147
// call R1, line 147
if (!r_R1())
{
return false;
}
// <-, line 147
slice_from("eux");
} while (false);
break;
case 12:
// (, line 150
// call R1, line 150
if (!r_R1())
{
return false;
}
if (!(out_grouping_b(g_v, 97, 251)))
{
return false;
}
// delete, line 150
slice_del();
break;
case 13:
// (, line 155
// call RV, line 155
if (!r_RV())
{
return false;
}
// fail, line 155
// (, line 155
// <-, line 155
slice_from("ant");
return false;
case 14:
// (, line 156
// call RV, line 156
if (!r_RV())
{
return false;
}
// fail, line 156
// (, line 156
// <-, line 156
slice_from("ent");
return false;
case 15:
// (, line 158
// test, line 158
v_11 = limit - cursor;
// (, line 158
if (!(in_grouping_b(g_v, 97, 251)))
{
return false;
}
// call RV, line 158
if (!r_RV())
{
return false;
}
cursor = limit - v_11;
// fail, line 158
// (, line 158
// delete, line 158
slice_del();
return false;
}
return true;
}
private boolean r_i_verb_suffix() {
int among_var;
int v_1;
int v_2;
// setlimit, line 163
v_1 = limit - cursor;
// tomark, line 163
if (cursor < I_pV)
{
return false;
}
cursor = I_pV;
v_2 = limit_backward;
limit_backward = cursor;
cursor = limit - v_1;
// (, line 163
// [, line 164
ket = cursor;
// substring, line 164
among_var = find_among_b(a_5, 35);
if (among_var == 0)
{
limit_backward = v_2;
return false;
}
// ], line 164
bra = cursor;
switch(among_var) {
case 0:
limit_backward = v_2;
return false;
case 1:
// (, line 170
if (!(out_grouping_b(g_v, 97, 251)))
{
limit_backward = v_2;
return false;
}
// delete, line 170
slice_del();
break;
}
limit_backward = v_2;
return true;
}
private boolean r_verb_suffix() {
int among_var;
int v_1;
int v_2;
int v_3;
// setlimit, line 174
v_1 = limit - cursor;
// tomark, line 174
if (cursor < I_pV)
{
return false;
}
cursor = I_pV;
v_2 = limit_backward;
limit_backward = cursor;
cursor = limit - v_1;
// (, line 174
// [, line 175
ket = cursor;
// substring, line 175
among_var = find_among_b(a_6, 38);
if (among_var == 0)
{
limit_backward = v_2;
return false;
}
// ], line 175
bra = cursor;
switch(among_var) {
case 0:
limit_backward = v_2;
return false;
case 1:
// (, line 177
// call R2, line 177
if (!r_R2())
{
limit_backward = v_2;
return false;
}
// delete, line 177
slice_del();
break;
case 2:
// (, line 185
// delete, line 185
slice_del();
break;
case 3:
// (, line 190
// delete, line 190
slice_del();
// try, line 191
v_3 = limit - cursor;
lab0: do {
// (, line 191
// [, line 191
ket = cursor;
// literal, line 191
if (!(eq_s_b(1, "e")))
{
cursor = limit - v_3;
break lab0;
}
// ], line 191
bra = cursor;
// delete, line 191
slice_del();
} while (false);
break;
}
limit_backward = v_2;
return true;
}
private boolean r_residual_suffix() {
int among_var;
int v_1;
int v_2;
int v_3;
int v_4;
int v_5;
// (, line 198
// try, line 199
v_1 = limit - cursor;
lab0: do {
// (, line 199
// [, line 199
ket = cursor;
// literal, line 199
if (!(eq_s_b(1, "s")))
{
cursor = limit - v_1;
break lab0;
}
// ], line 199
bra = cursor;
// test, line 199
v_2 = limit - cursor;
if (!(out_grouping_b(g_keep_with_s, 97, 232)))
{
cursor = limit - v_1;
break lab0;
}
cursor = limit - v_2;
// delete, line 199
slice_del();
} while (false);
// setlimit, line 200
v_3 = limit - cursor;
// tomark, line 200
if (cursor < I_pV)
{
return false;
}
cursor = I_pV;
v_4 = limit_backward;
limit_backward = cursor;
cursor = limit - v_3;
// (, line 200
// [, line 201
ket = cursor;
// substring, line 201
among_var = find_among_b(a_7, 7);
if (among_var == 0)
{
limit_backward = v_4;
return false;
}
// ], line 201
bra = cursor;
switch(among_var) {
case 0:
limit_backward = v_4;
return false;
case 1:
// (, line 202
// call R2, line 202
if (!r_R2())
{
limit_backward = v_4;
return false;
}
// or, line 202
lab1: do {
v_5 = limit - cursor;
lab2: do {
// literal, line 202
if (!(eq_s_b(1, "s")))
{
break lab2;
}
break lab1;
} while (false);
cursor = limit - v_5;
// literal, line 202
if (!(eq_s_b(1, "t")))
{
limit_backward = v_4;
return false;
}
} while (false);
// delete, line 202
slice_del();
break;
case 2:
// (, line 204
// <-, line 204
slice_from("i");
break;
case 3:
// (, line 205
// delete, line 205
slice_del();
break;
case 4:
// (, line 206
// literal, line 206
if (!(eq_s_b(2, "gu")))
{
limit_backward = v_4;
return false;
}
// delete, line 206
slice_del();
break;
}
limit_backward = v_4;
return true;
}
private boolean r_un_double() {
int v_1;
// (, line 211
// test, line 212
v_1 = limit - cursor;
// among, line 212
if (find_among_b(a_8, 5) == 0)
{
return false;
}
cursor = limit - v_1;
// [, line 212
ket = cursor;
// next, line 212
if (cursor <= limit_backward)
{
return false;
}
cursor--;
// ], line 212
bra = cursor;
// delete, line 212
slice_del();
return true;
}
private boolean r_un_accent() {
int v_3;
// (, line 215
// atleast, line 216
{
int v_1 = 1;
// atleast, line 216
replab0: while(true)
{
lab1: do {
if (!(out_grouping_b(g_v, 97, 251)))
{
break lab1;
}
v_1--;
continue replab0;
} while (false);
break replab0;
}
if (v_1 > 0)
{
return false;
}
}
// [, line 217
ket = cursor;
// or, line 217
lab2: do {
v_3 = limit - cursor;
lab3: do {
// literal, line 217
if (!(eq_s_b(1, "\u00E9")))
{
break lab3;
}
break lab2;
} while (false);
cursor = limit - v_3;
// literal, line 217
if (!(eq_s_b(1, "\u00E8")))
{
return false;
}
} while (false);
// ], line 217
bra = cursor;
// <-, line 217
slice_from("e");
return true;
}
public boolean stem() {
int v_1;
int v_2;
int v_3;
int v_4;
int v_5;
int v_6;
int v_7;
int v_8;
int v_9;
int v_10;
int v_11;
// (, line 221
// do, line 223
v_1 = cursor;
lab0: do {
// call prelude, line 223
if (!r_prelude())
{
break lab0;
}
} while (false);
cursor = v_1;
// do, line 224
v_2 = cursor;
lab1: do {
// call mark_regions, line 224
if (!r_mark_regions())
{
break lab1;
}
} while (false);
cursor = v_2;
// backwards, line 225
limit_backward = cursor; cursor = limit;
// (, line 225
// do, line 227
v_3 = limit - cursor;
lab2: do {
// (, line 227
// or, line 237
lab3: do {
v_4 = limit - cursor;
lab4: do {
// (, line 228
// and, line 233
v_5 = limit - cursor;
// (, line 229
// or, line 229
lab5: do {
v_6 = limit - cursor;
lab6: do {
// call standard_suffix, line 229
if (!r_standard_suffix())
{
break lab6;
}
break lab5;
} while (false);
cursor = limit - v_6;
lab7: do {
// call i_verb_suffix, line 230
if (!r_i_verb_suffix())
{
break lab7;
}
break lab5;
} while (false);
cursor = limit - v_6;
// call verb_suffix, line 231
if (!r_verb_suffix())
{
break lab4;
}
} while (false);
cursor = limit - v_5;
// try, line 234
v_7 = limit - cursor;
lab8: do {
// (, line 234
// [, line 234
ket = cursor;
// or, line 234
lab9: do {
v_8 = limit - cursor;
lab10: do {
// (, line 234
// literal, line 234
if (!(eq_s_b(1, "Y")))
{
break lab10;
}
// ], line 234
bra = cursor;
// <-, line 234
slice_from("i");
break lab9;
} while (false);
cursor = limit - v_8;
// (, line 235
// literal, line 235
if (!(eq_s_b(1, "\u00E7")))
{
cursor = limit - v_7;
break lab8;
}
// ], line 235
bra = cursor;
// <-, line 235
slice_from("c");
} while (false);
} while (false);
break lab3;
} while (false);
cursor = limit - v_4;
// call residual_suffix, line 238
if (!r_residual_suffix())
{
break lab2;
}
} while (false);
} while (false);
cursor = limit - v_3;
// do, line 243
v_9 = limit - cursor;
lab11: do {
// call un_double, line 243
if (!r_un_double())
{
break lab11;
}
} while (false);
cursor = limit - v_9;
// do, line 244
v_10 = limit - cursor;
lab12: do {
// call un_accent, line 244
if (!r_un_accent())
{
break lab12;
}
} while (false);
cursor = limit - v_10;
cursor = limit_backward; // do, line 246
v_11 = cursor;
lab13: do {
// call postlude, line 246
if (!r_postlude())
{
break lab13;
}
} while (false);
cursor = v_11;
return true;
}
public boolean equals( Object o ) {
return o instanceof frenchStemmer;
}
public int hashCode() {
return frenchStemmer.class.getName().hashCode();
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/stemmer
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/stemmer/snowball/germanStemmer.java
|
// CHECKSTYLE:OFF
/*
Copyright (c) 2001, Dr Martin Porter
Copyright (c) 2002, Richard Boulton
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* Neither the name of the copyright holders nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
// This file was generated automatically by the Snowball to Java compiler
package opennlp.tools.stemmer.snowball;
/**
* This class was automatically generated by a Snowball to Java compiler
* It implements the stemming algorithm defined by a snowball script.
*/
class germanStemmer extends opennlp.tools.stemmer.snowball.AbstractSnowballStemmer {
private final static germanStemmer methodObject = new germanStemmer ();
private final static Among a_0[] = {
new Among ( "", -1, 6, "", methodObject ),
new Among ( "U", 0, 2, "", methodObject ),
new Among ( "Y", 0, 1, "", methodObject ),
new Among ( "\u00E4", 0, 3, "", methodObject ),
new Among ( "\u00F6", 0, 4, "", methodObject ),
new Among ( "\u00FC", 0, 5, "", methodObject )
};
private final static Among a_1[] = {
new Among ( "e", -1, 2, "", methodObject ),
new Among ( "em", -1, 1, "", methodObject ),
new Among ( "en", -1, 2, "", methodObject ),
new Among ( "ern", -1, 1, "", methodObject ),
new Among ( "er", -1, 1, "", methodObject ),
new Among ( "s", -1, 3, "", methodObject ),
new Among ( "es", 5, 2, "", methodObject )
};
private final static Among a_2[] = {
new Among ( "en", -1, 1, "", methodObject ),
new Among ( "er", -1, 1, "", methodObject ),
new Among ( "st", -1, 2, "", methodObject ),
new Among ( "est", 2, 1, "", methodObject )
};
private final static Among a_3[] = {
new Among ( "ig", -1, 1, "", methodObject ),
new Among ( "lich", -1, 1, "", methodObject )
};
private final static Among a_4[] = {
new Among ( "end", -1, 1, "", methodObject ),
new Among ( "ig", -1, 2, "", methodObject ),
new Among ( "ung", -1, 1, "", methodObject ),
new Among ( "lich", -1, 3, "", methodObject ),
new Among ( "isch", -1, 2, "", methodObject ),
new Among ( "ik", -1, 2, "", methodObject ),
new Among ( "heit", -1, 3, "", methodObject ),
new Among ( "keit", -1, 4, "", methodObject )
};
private static final char g_v[] = {17, 65, 16, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 0, 32, 8 };
private static final char g_s_ending[] = {117, 30, 5 };
private static final char g_st_ending[] = {117, 30, 4 };
private int I_x;
private int I_p2;
private int I_p1;
private void copy_from(germanStemmer other) {
I_x = other.I_x;
I_p2 = other.I_p2;
I_p1 = other.I_p1;
super.copy_from(other);
}
private boolean r_prelude() {
int v_1;
int v_2;
int v_3;
int v_4;
int v_5;
int v_6;
// (, line 33
// test, line 35
v_1 = cursor;
// repeat, line 35
replab0: while(true)
{
v_2 = cursor;
lab1: do {
// (, line 35
// or, line 38
lab2: do {
v_3 = cursor;
lab3: do {
// (, line 36
// [, line 37
bra = cursor;
// literal, line 37
if (!(eq_s(1, "\u00DF")))
{
break lab3;
}
// ], line 37
ket = cursor;
// <-, line 37
slice_from("ss");
break lab2;
} while (false);
cursor = v_3;
// next, line 38
if (cursor >= limit)
{
break lab1;
}
cursor++;
} while (false);
continue replab0;
} while (false);
cursor = v_2;
break replab0;
}
cursor = v_1;
// repeat, line 41
replab4: while(true)
{
v_4 = cursor;
lab5: do {
// goto, line 41
golab6: while(true)
{
v_5 = cursor;
lab7: do {
// (, line 41
if (!(in_grouping(g_v, 97, 252)))
{
break lab7;
}
// [, line 42
bra = cursor;
// or, line 42
lab8: do {
v_6 = cursor;
lab9: do {
// (, line 42
// literal, line 42
if (!(eq_s(1, "u")))
{
break lab9;
}
// ], line 42
ket = cursor;
if (!(in_grouping(g_v, 97, 252)))
{
break lab9;
}
// <-, line 42
slice_from("U");
break lab8;
} while (false);
cursor = v_6;
// (, line 43
// literal, line 43
if (!(eq_s(1, "y")))
{
break lab7;
}
// ], line 43
ket = cursor;
if (!(in_grouping(g_v, 97, 252)))
{
break lab7;
}
// <-, line 43
slice_from("Y");
} while (false);
cursor = v_5;
break golab6;
} while (false);
cursor = v_5;
if (cursor >= limit)
{
break lab5;
}
cursor++;
}
continue replab4;
} while (false);
cursor = v_4;
break replab4;
}
return true;
}
private boolean r_mark_regions() {
int v_1;
// (, line 47
I_p1 = limit;
I_p2 = limit;
// test, line 52
v_1 = cursor;
// (, line 52
// hop, line 52
{
int c = cursor + 3;
if (0 > c || c > limit)
{
return false;
}
cursor = c;
}
// setmark x, line 52
I_x = cursor;
cursor = v_1;
// gopast, line 54
golab0: while(true)
{
lab1: do {
if (!(in_grouping(g_v, 97, 252)))
{
break lab1;
}
break golab0;
} while (false);
if (cursor >= limit)
{
return false;
}
cursor++;
}
// gopast, line 54
golab2: while(true)
{
lab3: do {
if (!(out_grouping(g_v, 97, 252)))
{
break lab3;
}
break golab2;
} while (false);
if (cursor >= limit)
{
return false;
}
cursor++;
}
// setmark p1, line 54
I_p1 = cursor;
// try, line 55
lab4: do {
// (, line 55
if (!(I_p1 < I_x))
{
break lab4;
}
I_p1 = I_x;
} while (false);
// gopast, line 56
golab5: while(true)
{
lab6: do {
if (!(in_grouping(g_v, 97, 252)))
{
break lab6;
}
break golab5;
} while (false);
if (cursor >= limit)
{
return false;
}
cursor++;
}
// gopast, line 56
golab7: while(true)
{
lab8: do {
if (!(out_grouping(g_v, 97, 252)))
{
break lab8;
}
break golab7;
} while (false);
if (cursor >= limit)
{
return false;
}
cursor++;
}
// setmark p2, line 56
I_p2 = cursor;
return true;
}
private boolean r_postlude() {
int among_var;
int v_1;
// repeat, line 60
replab0: while(true)
{
v_1 = cursor;
lab1: do {
// (, line 60
// [, line 62
bra = cursor;
// substring, line 62
among_var = find_among(a_0, 6);
if (among_var == 0)
{
break lab1;
}
// ], line 62
ket = cursor;
switch(among_var) {
case 0:
break lab1;
case 1:
// (, line 63
// <-, line 63
slice_from("y");
break;
case 2:
// (, line 64
// <-, line 64
slice_from("u");
break;
case 3:
// (, line 65
// <-, line 65
slice_from("a");
break;
case 4:
// (, line 66
// <-, line 66
slice_from("o");
break;
case 5:
// (, line 67
// <-, line 67
slice_from("u");
break;
case 6:
// (, line 68
// next, line 68
if (cursor >= limit)
{
break lab1;
}
cursor++;
break;
}
continue replab0;
} while (false);
cursor = v_1;
break replab0;
}
return true;
}
private boolean r_R1() {
if (!(I_p1 <= cursor))
{
return false;
}
return true;
}
private boolean r_R2() {
if (!(I_p2 <= cursor))
{
return false;
}
return true;
}
private boolean r_standard_suffix() {
int among_var;
int v_1;
int v_2;
int v_3;
int v_4;
int v_5;
int v_6;
int v_7;
int v_8;
int v_9;
int v_10;
// (, line 78
// do, line 79
v_1 = limit - cursor;
lab0: do {
// (, line 79
// [, line 80
ket = cursor;
// substring, line 80
among_var = find_among_b(a_1, 7);
if (among_var == 0)
{
break lab0;
}
// ], line 80
bra = cursor;
// call R1, line 80
if (!r_R1())
{
break lab0;
}
switch(among_var) {
case 0:
break lab0;
case 1:
// (, line 82
// delete, line 82
slice_del();
break;
case 2:
// (, line 85
// delete, line 85
slice_del();
// try, line 86
v_2 = limit - cursor;
lab1: do {
// (, line 86
// [, line 86
ket = cursor;
// literal, line 86
if (!(eq_s_b(1, "s")))
{
cursor = limit - v_2;
break lab1;
}
// ], line 86
bra = cursor;
// literal, line 86
if (!(eq_s_b(3, "nis")))
{
cursor = limit - v_2;
break lab1;
}
// delete, line 86
slice_del();
} while (false);
break;
case 3:
// (, line 89
if (!(in_grouping_b(g_s_ending, 98, 116)))
{
break lab0;
}
// delete, line 89
slice_del();
break;
}
} while (false);
cursor = limit - v_1;
// do, line 93
v_3 = limit - cursor;
lab2: do {
// (, line 93
// [, line 94
ket = cursor;
// substring, line 94
among_var = find_among_b(a_2, 4);
if (among_var == 0)
{
break lab2;
}
// ], line 94
bra = cursor;
// call R1, line 94
if (!r_R1())
{
break lab2;
}
switch(among_var) {
case 0:
break lab2;
case 1:
// (, line 96
// delete, line 96
slice_del();
break;
case 2:
// (, line 99
if (!(in_grouping_b(g_st_ending, 98, 116)))
{
break lab2;
}
// hop, line 99
{
int c = cursor - 3;
if (limit_backward > c || c > limit)
{
break lab2;
}
cursor = c;
}
// delete, line 99
slice_del();
break;
}
} while (false);
cursor = limit - v_3;
// do, line 103
v_4 = limit - cursor;
lab3: do {
// (, line 103
// [, line 104
ket = cursor;
// substring, line 104
among_var = find_among_b(a_4, 8);
if (among_var == 0)
{
break lab3;
}
// ], line 104
bra = cursor;
// call R2, line 104
if (!r_R2())
{
break lab3;
}
switch(among_var) {
case 0:
break lab3;
case 1:
// (, line 106
// delete, line 106
slice_del();
// try, line 107
v_5 = limit - cursor;
lab4: do {
// (, line 107
// [, line 107
ket = cursor;
// literal, line 107
if (!(eq_s_b(2, "ig")))
{
cursor = limit - v_5;
break lab4;
}
// ], line 107
bra = cursor;
// not, line 107
{
v_6 = limit - cursor;
lab5: do {
// literal, line 107
if (!(eq_s_b(1, "e")))
{
break lab5;
}
cursor = limit - v_5;
break lab4;
} while (false);
cursor = limit - v_6;
}
// call R2, line 107
if (!r_R2())
{
cursor = limit - v_5;
break lab4;
}
// delete, line 107
slice_del();
} while (false);
break;
case 2:
// (, line 110
// not, line 110
{
v_7 = limit - cursor;
lab6: do {
// literal, line 110
if (!(eq_s_b(1, "e")))
{
break lab6;
}
break lab3;
} while (false);
cursor = limit - v_7;
}
// delete, line 110
slice_del();
break;
case 3:
// (, line 113
// delete, line 113
slice_del();
// try, line 114
v_8 = limit - cursor;
lab7: do {
// (, line 114
// [, line 115
ket = cursor;
// or, line 115
lab8: do {
v_9 = limit - cursor;
lab9: do {
// literal, line 115
if (!(eq_s_b(2, "er")))
{
break lab9;
}
break lab8;
} while (false);
cursor = limit - v_9;
// literal, line 115
if (!(eq_s_b(2, "en")))
{
cursor = limit - v_8;
break lab7;
}
} while (false);
// ], line 115
bra = cursor;
// call R1, line 115
if (!r_R1())
{
cursor = limit - v_8;
break lab7;
}
// delete, line 115
slice_del();
} while (false);
break;
case 4:
// (, line 119
// delete, line 119
slice_del();
// try, line 120
v_10 = limit - cursor;
lab10: do {
// (, line 120
// [, line 121
ket = cursor;
// substring, line 121
among_var = find_among_b(a_3, 2);
if (among_var == 0)
{
cursor = limit - v_10;
break lab10;
}
// ], line 121
bra = cursor;
// call R2, line 121
if (!r_R2())
{
cursor = limit - v_10;
break lab10;
}
switch(among_var) {
case 0:
cursor = limit - v_10;
break lab10;
case 1:
// (, line 123
// delete, line 123
slice_del();
break;
}
} while (false);
break;
}
} while (false);
cursor = limit - v_4;
return true;
}
public boolean stem() {
int v_1;
int v_2;
int v_3;
int v_4;
// (, line 133
// do, line 134
v_1 = cursor;
lab0: do {
// call prelude, line 134
if (!r_prelude())
{
break lab0;
}
} while (false);
cursor = v_1;
// do, line 135
v_2 = cursor;
lab1: do {
// call mark_regions, line 135
if (!r_mark_regions())
{
break lab1;
}
} while (false);
cursor = v_2;
// backwards, line 136
limit_backward = cursor; cursor = limit;
// do, line 137
v_3 = limit - cursor;
lab2: do {
// call standard_suffix, line 137
if (!r_standard_suffix())
{
break lab2;
}
} while (false);
cursor = limit - v_3;
cursor = limit_backward; // do, line 138
v_4 = cursor;
lab3: do {
// call postlude, line 138
if (!r_postlude())
{
break lab3;
}
} while (false);
cursor = v_4;
return true;
}
public boolean equals( Object o ) {
return o instanceof germanStemmer;
}
public int hashCode() {
return germanStemmer.class.getName().hashCode();
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/stemmer
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/stemmer/snowball/hungarianStemmer.java
|
// CHECKSTYLE:OFF
/*
Copyright (c) 2001, Dr Martin Porter
Copyright (c) 2002, Richard Boulton
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* Neither the name of the copyright holders nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
// This file was generated automatically by the Snowball to Java compiler
package opennlp.tools.stemmer.snowball;
/**
* This class was automatically generated by a Snowball to Java compiler
* It implements the stemming algorithm defined by a snowball script.
*/
class hungarianStemmer extends opennlp.tools.stemmer.snowball.AbstractSnowballStemmer {
private final static hungarianStemmer methodObject = new hungarianStemmer ();
private final static Among a_0[] = {
new Among ( "cs", -1, -1, "", methodObject ),
new Among ( "dzs", -1, -1, "", methodObject ),
new Among ( "gy", -1, -1, "", methodObject ),
new Among ( "ly", -1, -1, "", methodObject ),
new Among ( "ny", -1, -1, "", methodObject ),
new Among ( "sz", -1, -1, "", methodObject ),
new Among ( "ty", -1, -1, "", methodObject ),
new Among ( "zs", -1, -1, "", methodObject )
};
private final static Among a_1[] = {
new Among ( "\u00E1", -1, 1, "", methodObject ),
new Among ( "\u00E9", -1, 2, "", methodObject )
};
private final static Among a_2[] = {
new Among ( "bb", -1, -1, "", methodObject ),
new Among ( "cc", -1, -1, "", methodObject ),
new Among ( "dd", -1, -1, "", methodObject ),
new Among ( "ff", -1, -1, "", methodObject ),
new Among ( "gg", -1, -1, "", methodObject ),
new Among ( "jj", -1, -1, "", methodObject ),
new Among ( "kk", -1, -1, "", methodObject ),
new Among ( "ll", -1, -1, "", methodObject ),
new Among ( "mm", -1, -1, "", methodObject ),
new Among ( "nn", -1, -1, "", methodObject ),
new Among ( "pp", -1, -1, "", methodObject ),
new Among ( "rr", -1, -1, "", methodObject ),
new Among ( "ccs", -1, -1, "", methodObject ),
new Among ( "ss", -1, -1, "", methodObject ),
new Among ( "zzs", -1, -1, "", methodObject ),
new Among ( "tt", -1, -1, "", methodObject ),
new Among ( "vv", -1, -1, "", methodObject ),
new Among ( "ggy", -1, -1, "", methodObject ),
new Among ( "lly", -1, -1, "", methodObject ),
new Among ( "nny", -1, -1, "", methodObject ),
new Among ( "tty", -1, -1, "", methodObject ),
new Among ( "ssz", -1, -1, "", methodObject ),
new Among ( "zz", -1, -1, "", methodObject )
};
private final static Among a_3[] = {
new Among ( "al", -1, 1, "", methodObject ),
new Among ( "el", -1, 2, "", methodObject )
};
private final static Among a_4[] = {
new Among ( "ba", -1, -1, "", methodObject ),
new Among ( "ra", -1, -1, "", methodObject ),
new Among ( "be", -1, -1, "", methodObject ),
new Among ( "re", -1, -1, "", methodObject ),
new Among ( "ig", -1, -1, "", methodObject ),
new Among ( "nak", -1, -1, "", methodObject ),
new Among ( "nek", -1, -1, "", methodObject ),
new Among ( "val", -1, -1, "", methodObject ),
new Among ( "vel", -1, -1, "", methodObject ),
new Among ( "ul", -1, -1, "", methodObject ),
new Among ( "n\u00E1l", -1, -1, "", methodObject ),
new Among ( "n\u00E9l", -1, -1, "", methodObject ),
new Among ( "b\u00F3l", -1, -1, "", methodObject ),
new Among ( "r\u00F3l", -1, -1, "", methodObject ),
new Among ( "t\u00F3l", -1, -1, "", methodObject ),
new Among ( "b\u00F5l", -1, -1, "", methodObject ),
new Among ( "r\u00F5l", -1, -1, "", methodObject ),
new Among ( "t\u00F5l", -1, -1, "", methodObject ),
new Among ( "\u00FCl", -1, -1, "", methodObject ),
new Among ( "n", -1, -1, "", methodObject ),
new Among ( "an", 19, -1, "", methodObject ),
new Among ( "ban", 20, -1, "", methodObject ),
new Among ( "en", 19, -1, "", methodObject ),
new Among ( "ben", 22, -1, "", methodObject ),
new Among ( "k\u00E9ppen", 22, -1, "", methodObject ),
new Among ( "on", 19, -1, "", methodObject ),
new Among ( "\u00F6n", 19, -1, "", methodObject ),
new Among ( "k\u00E9pp", -1, -1, "", methodObject ),
new Among ( "kor", -1, -1, "", methodObject ),
new Among ( "t", -1, -1, "", methodObject ),
new Among ( "at", 29, -1, "", methodObject ),
new Among ( "et", 29, -1, "", methodObject ),
new Among ( "k\u00E9nt", 29, -1, "", methodObject ),
new Among ( "ank\u00E9nt", 32, -1, "", methodObject ),
new Among ( "enk\u00E9nt", 32, -1, "", methodObject ),
new Among ( "onk\u00E9nt", 32, -1, "", methodObject ),
new Among ( "ot", 29, -1, "", methodObject ),
new Among ( "\u00E9rt", 29, -1, "", methodObject ),
new Among ( "\u00F6t", 29, -1, "", methodObject ),
new Among ( "hez", -1, -1, "", methodObject ),
new Among ( "hoz", -1, -1, "", methodObject ),
new Among ( "h\u00F6z", -1, -1, "", methodObject ),
new Among ( "v\u00E1", -1, -1, "", methodObject ),
new Among ( "v\u00E9", -1, -1, "", methodObject )
};
private final static Among a_5[] = {
new Among ( "\u00E1n", -1, 2, "", methodObject ),
new Among ( "\u00E9n", -1, 1, "", methodObject ),
new Among ( "\u00E1nk\u00E9nt", -1, 3, "", methodObject )
};
private final static Among a_6[] = {
new Among ( "stul", -1, 2, "", methodObject ),
new Among ( "astul", 0, 1, "", methodObject ),
new Among ( "\u00E1stul", 0, 3, "", methodObject ),
new Among ( "st\u00FCl", -1, 2, "", methodObject ),
new Among ( "est\u00FCl", 3, 1, "", methodObject ),
new Among ( "\u00E9st\u00FCl", 3, 4, "", methodObject )
};
private final static Among a_7[] = {
new Among ( "\u00E1", -1, 1, "", methodObject ),
new Among ( "\u00E9", -1, 2, "", methodObject )
};
private final static Among a_8[] = {
new Among ( "k", -1, 7, "", methodObject ),
new Among ( "ak", 0, 4, "", methodObject ),
new Among ( "ek", 0, 6, "", methodObject ),
new Among ( "ok", 0, 5, "", methodObject ),
new Among ( "\u00E1k", 0, 1, "", methodObject ),
new Among ( "\u00E9k", 0, 2, "", methodObject ),
new Among ( "\u00F6k", 0, 3, "", methodObject )
};
private final static Among a_9[] = {
new Among ( "\u00E9i", -1, 7, "", methodObject ),
new Among ( "\u00E1\u00E9i", 0, 6, "", methodObject ),
new Among ( "\u00E9\u00E9i", 0, 5, "", methodObject ),
new Among ( "\u00E9", -1, 9, "", methodObject ),
new Among ( "k\u00E9", 3, 4, "", methodObject ),
new Among ( "ak\u00E9", 4, 1, "", methodObject ),
new Among ( "ek\u00E9", 4, 1, "", methodObject ),
new Among ( "ok\u00E9", 4, 1, "", methodObject ),
new Among ( "\u00E1k\u00E9", 4, 3, "", methodObject ),
new Among ( "\u00E9k\u00E9", 4, 2, "", methodObject ),
new Among ( "\u00F6k\u00E9", 4, 1, "", methodObject ),
new Among ( "\u00E9\u00E9", 3, 8, "", methodObject )
};
private final static Among a_10[] = {
new Among ( "a", -1, 18, "", methodObject ),
new Among ( "ja", 0, 17, "", methodObject ),
new Among ( "d", -1, 16, "", methodObject ),
new Among ( "ad", 2, 13, "", methodObject ),
new Among ( "ed", 2, 13, "", methodObject ),
new Among ( "od", 2, 13, "", methodObject ),
new Among ( "\u00E1d", 2, 14, "", methodObject ),
new Among ( "\u00E9d", 2, 15, "", methodObject ),
new Among ( "\u00F6d", 2, 13, "", methodObject ),
new Among ( "e", -1, 18, "", methodObject ),
new Among ( "je", 9, 17, "", methodObject ),
new Among ( "nk", -1, 4, "", methodObject ),
new Among ( "unk", 11, 1, "", methodObject ),
new Among ( "\u00E1nk", 11, 2, "", methodObject ),
new Among ( "\u00E9nk", 11, 3, "", methodObject ),
new Among ( "\u00FCnk", 11, 1, "", methodObject ),
new Among ( "uk", -1, 8, "", methodObject ),
new Among ( "juk", 16, 7, "", methodObject ),
new Among ( "\u00E1juk", 17, 5, "", methodObject ),
new Among ( "\u00FCk", -1, 8, "", methodObject ),
new Among ( "j\u00FCk", 19, 7, "", methodObject ),
new Among ( "\u00E9j\u00FCk", 20, 6, "", methodObject ),
new Among ( "m", -1, 12, "", methodObject ),
new Among ( "am", 22, 9, "", methodObject ),
new Among ( "em", 22, 9, "", methodObject ),
new Among ( "om", 22, 9, "", methodObject ),
new Among ( "\u00E1m", 22, 10, "", methodObject ),
new Among ( "\u00E9m", 22, 11, "", methodObject ),
new Among ( "o", -1, 18, "", methodObject ),
new Among ( "\u00E1", -1, 19, "", methodObject ),
new Among ( "\u00E9", -1, 20, "", methodObject )
};
private final static Among a_11[] = {
new Among ( "id", -1, 10, "", methodObject ),
new Among ( "aid", 0, 9, "", methodObject ),
new Among ( "jaid", 1, 6, "", methodObject ),
new Among ( "eid", 0, 9, "", methodObject ),
new Among ( "jeid", 3, 6, "", methodObject ),
new Among ( "\u00E1id", 0, 7, "", methodObject ),
new Among ( "\u00E9id", 0, 8, "", methodObject ),
new Among ( "i", -1, 15, "", methodObject ),
new Among ( "ai", 7, 14, "", methodObject ),
new Among ( "jai", 8, 11, "", methodObject ),
new Among ( "ei", 7, 14, "", methodObject ),
new Among ( "jei", 10, 11, "", methodObject ),
new Among ( "\u00E1i", 7, 12, "", methodObject ),
new Among ( "\u00E9i", 7, 13, "", methodObject ),
new Among ( "itek", -1, 24, "", methodObject ),
new Among ( "eitek", 14, 21, "", methodObject ),
new Among ( "jeitek", 15, 20, "", methodObject ),
new Among ( "\u00E9itek", 14, 23, "", methodObject ),
new Among ( "ik", -1, 29, "", methodObject ),
new Among ( "aik", 18, 26, "", methodObject ),
new Among ( "jaik", 19, 25, "", methodObject ),
new Among ( "eik", 18, 26, "", methodObject ),
new Among ( "jeik", 21, 25, "", methodObject ),
new Among ( "\u00E1ik", 18, 27, "", methodObject ),
new Among ( "\u00E9ik", 18, 28, "", methodObject ),
new Among ( "ink", -1, 20, "", methodObject ),
new Among ( "aink", 25, 17, "", methodObject ),
new Among ( "jaink", 26, 16, "", methodObject ),
new Among ( "eink", 25, 17, "", methodObject ),
new Among ( "jeink", 28, 16, "", methodObject ),
new Among ( "\u00E1ink", 25, 18, "", methodObject ),
new Among ( "\u00E9ink", 25, 19, "", methodObject ),
new Among ( "aitok", -1, 21, "", methodObject ),
new Among ( "jaitok", 32, 20, "", methodObject ),
new Among ( "\u00E1itok", -1, 22, "", methodObject ),
new Among ( "im", -1, 5, "", methodObject ),
new Among ( "aim", 35, 4, "", methodObject ),
new Among ( "jaim", 36, 1, "", methodObject ),
new Among ( "eim", 35, 4, "", methodObject ),
new Among ( "jeim", 38, 1, "", methodObject ),
new Among ( "\u00E1im", 35, 2, "", methodObject ),
new Among ( "\u00E9im", 35, 3, "", methodObject )
};
private static final char g_v[] = {17, 65, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 17, 52, 14 };
private int I_p1;
private void copy_from(hungarianStemmer other) {
I_p1 = other.I_p1;
super.copy_from(other);
}
private boolean r_mark_regions() {
int v_1;
int v_2;
int v_3;
// (, line 44
I_p1 = limit;
// or, line 51
lab0: do {
v_1 = cursor;
lab1: do {
// (, line 48
if (!(in_grouping(g_v, 97, 252)))
{
break lab1;
}
// goto, line 48
golab2: while(true)
{
v_2 = cursor;
lab3: do {
if (!(out_grouping(g_v, 97, 252)))
{
break lab3;
}
cursor = v_2;
break golab2;
} while (false);
cursor = v_2;
if (cursor >= limit)
{
break lab1;
}
cursor++;
}
// or, line 49
lab4: do {
v_3 = cursor;
lab5: do {
// among, line 49
if (find_among(a_0, 8) == 0)
{
break lab5;
}
break lab4;
} while (false);
cursor = v_3;
// next, line 49
if (cursor >= limit)
{
break lab1;
}
cursor++;
} while (false);
// setmark p1, line 50
I_p1 = cursor;
break lab0;
} while (false);
cursor = v_1;
// (, line 53
if (!(out_grouping(g_v, 97, 252)))
{
return false;
}
// gopast, line 53
golab6: while(true)
{
lab7: do {
if (!(in_grouping(g_v, 97, 252)))
{
break lab7;
}
break golab6;
} while (false);
if (cursor >= limit)
{
return false;
}
cursor++;
}
// setmark p1, line 53
I_p1 = cursor;
} while (false);
return true;
}
private boolean r_R1() {
if (!(I_p1 <= cursor))
{
return false;
}
return true;
}
private boolean r_v_ending() {
int among_var;
// (, line 60
// [, line 61
ket = cursor;
// substring, line 61
among_var = find_among_b(a_1, 2);
if (among_var == 0)
{
return false;
}
// ], line 61
bra = cursor;
// call R1, line 61
if (!r_R1())
{
return false;
}
switch(among_var) {
case 0:
return false;
case 1:
// (, line 62
// <-, line 62
slice_from("a");
break;
case 2:
// (, line 63
// <-, line 63
slice_from("e");
break;
}
return true;
}
private boolean r_double() {
int v_1;
// (, line 67
// test, line 68
v_1 = limit - cursor;
// among, line 68
if (find_among_b(a_2, 23) == 0)
{
return false;
}
cursor = limit - v_1;
return true;
}
private boolean r_undouble() {
// (, line 72
// next, line 73
if (cursor <= limit_backward)
{
return false;
}
cursor--;
// [, line 73
ket = cursor;
// hop, line 73
{
int c = cursor - 1;
if (limit_backward > c || c > limit)
{
return false;
}
cursor = c;
}
// ], line 73
bra = cursor;
// delete, line 73
slice_del();
return true;
}
private boolean r_instrum() {
int among_var;
// (, line 76
// [, line 77
ket = cursor;
// substring, line 77
among_var = find_among_b(a_3, 2);
if (among_var == 0)
{
return false;
}
// ], line 77
bra = cursor;
// call R1, line 77
if (!r_R1())
{
return false;
}
switch(among_var) {
case 0:
return false;
case 1:
// (, line 78
// call double, line 78
if (!r_double())
{
return false;
}
break;
case 2:
// (, line 79
// call double, line 79
if (!r_double())
{
return false;
}
break;
}
// delete, line 81
slice_del();
// call undouble, line 82
if (!r_undouble())
{
return false;
}
return true;
}
private boolean r_case() {
// (, line 86
// [, line 87
ket = cursor;
// substring, line 87
if (find_among_b(a_4, 44) == 0)
{
return false;
}
// ], line 87
bra = cursor;
// call R1, line 87
if (!r_R1())
{
return false;
}
// delete, line 111
slice_del();
// call v_ending, line 112
if (!r_v_ending())
{
return false;
}
return true;
}
private boolean r_case_special() {
int among_var;
// (, line 115
// [, line 116
ket = cursor;
// substring, line 116
among_var = find_among_b(a_5, 3);
if (among_var == 0)
{
return false;
}
// ], line 116
bra = cursor;
// call R1, line 116
if (!r_R1())
{
return false;
}
switch(among_var) {
case 0:
return false;
case 1:
// (, line 117
// <-, line 117
slice_from("e");
break;
case 2:
// (, line 118
// <-, line 118
slice_from("a");
break;
case 3:
// (, line 119
// <-, line 119
slice_from("a");
break;
}
return true;
}
private boolean r_case_other() {
int among_var;
// (, line 123
// [, line 124
ket = cursor;
// substring, line 124
among_var = find_among_b(a_6, 6);
if (among_var == 0)
{
return false;
}
// ], line 124
bra = cursor;
// call R1, line 124
if (!r_R1())
{
return false;
}
switch(among_var) {
case 0:
return false;
case 1:
// (, line 125
// delete, line 125
slice_del();
break;
case 2:
// (, line 126
// delete, line 126
slice_del();
break;
case 3:
// (, line 127
// <-, line 127
slice_from("a");
break;
case 4:
// (, line 128
// <-, line 128
slice_from("e");
break;
}
return true;
}
private boolean r_factive() {
int among_var;
// (, line 132
// [, line 133
ket = cursor;
// substring, line 133
among_var = find_among_b(a_7, 2);
if (among_var == 0)
{
return false;
}
// ], line 133
bra = cursor;
// call R1, line 133
if (!r_R1())
{
return false;
}
switch(among_var) {
case 0:
return false;
case 1:
// (, line 134
// call double, line 134
if (!r_double())
{
return false;
}
break;
case 2:
// (, line 135
// call double, line 135
if (!r_double())
{
return false;
}
break;
}
// delete, line 137
slice_del();
// call undouble, line 138
if (!r_undouble())
{
return false;
}
return true;
}
private boolean r_plural() {
int among_var;
// (, line 141
// [, line 142
ket = cursor;
// substring, line 142
among_var = find_among_b(a_8, 7);
if (among_var == 0)
{
return false;
}
// ], line 142
bra = cursor;
// call R1, line 142
if (!r_R1())
{
return false;
}
switch(among_var) {
case 0:
return false;
case 1:
// (, line 143
// <-, line 143
slice_from("a");
break;
case 2:
// (, line 144
// <-, line 144
slice_from("e");
break;
case 3:
// (, line 145
// delete, line 145
slice_del();
break;
case 4:
// (, line 146
// delete, line 146
slice_del();
break;
case 5:
// (, line 147
// delete, line 147
slice_del();
break;
case 6:
// (, line 148
// delete, line 148
slice_del();
break;
case 7:
// (, line 149
// delete, line 149
slice_del();
break;
}
return true;
}
private boolean r_owned() {
int among_var;
// (, line 153
// [, line 154
ket = cursor;
// substring, line 154
among_var = find_among_b(a_9, 12);
if (among_var == 0)
{
return false;
}
// ], line 154
bra = cursor;
// call R1, line 154
if (!r_R1())
{
return false;
}
switch(among_var) {
case 0:
return false;
case 1:
// (, line 155
// delete, line 155
slice_del();
break;
case 2:
// (, line 156
// <-, line 156
slice_from("e");
break;
case 3:
// (, line 157
// <-, line 157
slice_from("a");
break;
case 4:
// (, line 158
// delete, line 158
slice_del();
break;
case 5:
// (, line 159
// <-, line 159
slice_from("e");
break;
case 6:
// (, line 160
// <-, line 160
slice_from("a");
break;
case 7:
// (, line 161
// delete, line 161
slice_del();
break;
case 8:
// (, line 162
// <-, line 162
slice_from("e");
break;
case 9:
// (, line 163
// delete, line 163
slice_del();
break;
}
return true;
}
private boolean r_sing_owner() {
int among_var;
// (, line 167
// [, line 168
ket = cursor;
// substring, line 168
among_var = find_among_b(a_10, 31);
if (among_var == 0)
{
return false;
}
// ], line 168
bra = cursor;
// call R1, line 168
if (!r_R1())
{
return false;
}
switch(among_var) {
case 0:
return false;
case 1:
// (, line 169
// delete, line 169
slice_del();
break;
case 2:
// (, line 170
// <-, line 170
slice_from("a");
break;
case 3:
// (, line 171
// <-, line 171
slice_from("e");
break;
case 4:
// (, line 172
// delete, line 172
slice_del();
break;
case 5:
// (, line 173
// <-, line 173
slice_from("a");
break;
case 6:
// (, line 174
// <-, line 174
slice_from("e");
break;
case 7:
// (, line 175
// delete, line 175
slice_del();
break;
case 8:
// (, line 176
// delete, line 176
slice_del();
break;
case 9:
// (, line 177
// delete, line 177
slice_del();
break;
case 10:
// (, line 178
// <-, line 178
slice_from("a");
break;
case 11:
// (, line 179
// <-, line 179
slice_from("e");
break;
case 12:
// (, line 180
// delete, line 180
slice_del();
break;
case 13:
// (, line 181
// delete, line 181
slice_del();
break;
case 14:
// (, line 182
// <-, line 182
slice_from("a");
break;
case 15:
// (, line 183
// <-, line 183
slice_from("e");
break;
case 16:
// (, line 184
// delete, line 184
slice_del();
break;
case 17:
// (, line 185
// delete, line 185
slice_del();
break;
case 18:
// (, line 186
// delete, line 186
slice_del();
break;
case 19:
// (, line 187
// <-, line 187
slice_from("a");
break;
case 20:
// (, line 188
// <-, line 188
slice_from("e");
break;
}
return true;
}
private boolean r_plur_owner() {
int among_var;
// (, line 192
// [, line 193
ket = cursor;
// substring, line 193
among_var = find_among_b(a_11, 42);
if (among_var == 0)
{
return false;
}
// ], line 193
bra = cursor;
// call R1, line 193
if (!r_R1())
{
return false;
}
switch(among_var) {
case 0:
return false;
case 1:
// (, line 194
// delete, line 194
slice_del();
break;
case 2:
// (, line 195
// <-, line 195
slice_from("a");
break;
case 3:
// (, line 196
// <-, line 196
slice_from("e");
break;
case 4:
// (, line 197
// delete, line 197
slice_del();
break;
case 5:
// (, line 198
// delete, line 198
slice_del();
break;
case 6:
// (, line 199
// delete, line 199
slice_del();
break;
case 7:
// (, line 200
// <-, line 200
slice_from("a");
break;
case 8:
// (, line 201
// <-, line 201
slice_from("e");
break;
case 9:
// (, line 202
// delete, line 202
slice_del();
break;
case 10:
// (, line 203
// delete, line 203
slice_del();
break;
case 11:
// (, line 204
// delete, line 204
slice_del();
break;
case 12:
// (, line 205
// <-, line 205
slice_from("a");
break;
case 13:
// (, line 206
// <-, line 206
slice_from("e");
break;
case 14:
// (, line 207
// delete, line 207
slice_del();
break;
case 15:
// (, line 208
// delete, line 208
slice_del();
break;
case 16:
// (, line 209
// delete, line 209
slice_del();
break;
case 17:
// (, line 210
// delete, line 210
slice_del();
break;
case 18:
// (, line 211
// <-, line 211
slice_from("a");
break;
case 19:
// (, line 212
// <-, line 212
slice_from("e");
break;
case 20:
// (, line 214
// delete, line 214
slice_del();
break;
case 21:
// (, line 215
// delete, line 215
slice_del();
break;
case 22:
// (, line 216
// <-, line 216
slice_from("a");
break;
case 23:
// (, line 217
// <-, line 217
slice_from("e");
break;
case 24:
// (, line 218
// delete, line 218
slice_del();
break;
case 25:
// (, line 219
// delete, line 219
slice_del();
break;
case 26:
// (, line 220
// delete, line 220
slice_del();
break;
case 27:
// (, line 221
// <-, line 221
slice_from("a");
break;
case 28:
// (, line 222
// <-, line 222
slice_from("e");
break;
case 29:
// (, line 223
// delete, line 223
slice_del();
break;
}
return true;
}
public boolean stem() {
int v_1;
int v_2;
int v_3;
int v_4;
int v_5;
int v_6;
int v_7;
int v_8;
int v_9;
int v_10;
// (, line 228
// do, line 229
v_1 = cursor;
lab0: do {
// call mark_regions, line 229
if (!r_mark_regions())
{
break lab0;
}
} while (false);
cursor = v_1;
// backwards, line 230
limit_backward = cursor; cursor = limit;
// (, line 230
// do, line 231
v_2 = limit - cursor;
lab1: do {
// call instrum, line 231
if (!r_instrum())
{
break lab1;
}
} while (false);
cursor = limit - v_2;
// do, line 232
v_3 = limit - cursor;
lab2: do {
// call case, line 232
if (!r_case())
{
break lab2;
}
} while (false);
cursor = limit - v_3;
// do, line 233
v_4 = limit - cursor;
lab3: do {
// call case_special, line 233
if (!r_case_special())
{
break lab3;
}
} while (false);
cursor = limit - v_4;
// do, line 234
v_5 = limit - cursor;
lab4: do {
// call case_other, line 234
if (!r_case_other())
{
break lab4;
}
} while (false);
cursor = limit - v_5;
// do, line 235
v_6 = limit - cursor;
lab5: do {
// call factive, line 235
if (!r_factive())
{
break lab5;
}
} while (false);
cursor = limit - v_6;
// do, line 236
v_7 = limit - cursor;
lab6: do {
// call owned, line 236
if (!r_owned())
{
break lab6;
}
} while (false);
cursor = limit - v_7;
// do, line 237
v_8 = limit - cursor;
lab7: do {
// call sing_owner, line 237
if (!r_sing_owner())
{
break lab7;
}
} while (false);
cursor = limit - v_8;
// do, line 238
v_9 = limit - cursor;
lab8: do {
// call plur_owner, line 238
if (!r_plur_owner())
{
break lab8;
}
} while (false);
cursor = limit - v_9;
// do, line 239
v_10 = limit - cursor;
lab9: do {
// call plural, line 239
if (!r_plural())
{
break lab9;
}
} while (false);
cursor = limit - v_10;
cursor = limit_backward; return true;
}
public boolean equals( Object o ) {
return o instanceof hungarianStemmer;
}
public int hashCode() {
return hungarianStemmer.class.getName().hashCode();
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/stemmer
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/stemmer/snowball/irishStemmer.java
|
// CHECKSTYLE:OFF
/*
Copyright (c) 2001, Dr Martin Porter
Copyright (c) 2002, Richard Boulton
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* Neither the name of the copyright holders nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
// This file was generated automatically by the Snowball to Java compiler
package opennlp.tools.stemmer.snowball;
/**
* This class was automatically generated by a Snowball to Java compiler
* It implements the stemming algorithm defined by a snowball script.
*/
public class irishStemmer extends opennlp.tools.stemmer.snowball.AbstractSnowballStemmer {
private final static irishStemmer methodObject = new irishStemmer ();
private final static Among a_0[] = {
new Among ( "b'", -1, 4, "", methodObject ),
new Among ( "bh", -1, 14, "", methodObject ),
new Among ( "bhf", 1, 9, "", methodObject ),
new Among ( "bp", -1, 11, "", methodObject ),
new Among ( "ch", -1, 15, "", methodObject ),
new Among ( "d'", -1, 2, "", methodObject ),
new Among ( "d'fh", 5, 3, "", methodObject ),
new Among ( "dh", -1, 16, "", methodObject ),
new Among ( "dt", -1, 13, "", methodObject ),
new Among ( "fh", -1, 17, "", methodObject ),
new Among ( "gc", -1, 7, "", methodObject ),
new Among ( "gh", -1, 18, "", methodObject ),
new Among ( "h-", -1, 1, "", methodObject ),
new Among ( "m'", -1, 4, "", methodObject ),
new Among ( "mb", -1, 6, "", methodObject ),
new Among ( "mh", -1, 19, "", methodObject ),
new Among ( "n-", -1, 1, "", methodObject ),
new Among ( "nd", -1, 8, "", methodObject ),
new Among ( "ng", -1, 10, "", methodObject ),
new Among ( "ph", -1, 20, "", methodObject ),
new Among ( "sh", -1, 5, "", methodObject ),
new Among ( "t-", -1, 1, "", methodObject ),
new Among ( "th", -1, 21, "", methodObject ),
new Among ( "ts", -1, 12, "", methodObject )
};
private final static Among a_1[] = {
new Among ( "\u00EDochta", -1, 1, "", methodObject ),
new Among ( "a\u00EDochta", 0, 1, "", methodObject ),
new Among ( "ire", -1, 2, "", methodObject ),
new Among ( "aire", 2, 2, "", methodObject ),
new Among ( "abh", -1, 1, "", methodObject ),
new Among ( "eabh", 4, 1, "", methodObject ),
new Among ( "ibh", -1, 1, "", methodObject ),
new Among ( "aibh", 6, 1, "", methodObject ),
new Among ( "amh", -1, 1, "", methodObject ),
new Among ( "eamh", 8, 1, "", methodObject ),
new Among ( "imh", -1, 1, "", methodObject ),
new Among ( "aimh", 10, 1, "", methodObject ),
new Among ( "\u00EDocht", -1, 1, "", methodObject ),
new Among ( "a\u00EDocht", 12, 1, "", methodObject ),
new Among ( "ir\u00ED", -1, 2, "", methodObject ),
new Among ( "air\u00ED", 14, 2, "", methodObject )
};
private final static Among a_2[] = {
new Among ( "\u00F3ideacha", -1, 6, "", methodObject ),
new Among ( "patacha", -1, 5, "", methodObject ),
new Among ( "achta", -1, 1, "", methodObject ),
new Among ( "arcachta", 2, 2, "", methodObject ),
new Among ( "eachta", 2, 1, "", methodObject ),
new Among ( "grafa\u00EDochta", -1, 4, "", methodObject ),
new Among ( "paite", -1, 5, "", methodObject ),
new Among ( "ach", -1, 1, "", methodObject ),
new Among ( "each", 7, 1, "", methodObject ),
new Among ( "\u00F3ideach", 8, 6, "", methodObject ),
new Among ( "gineach", 8, 3, "", methodObject ),
new Among ( "patach", 7, 5, "", methodObject ),
new Among ( "grafa\u00EDoch", -1, 4, "", methodObject ),
new Among ( "pataigh", -1, 5, "", methodObject ),
new Among ( "\u00F3idigh", -1, 6, "", methodObject ),
new Among ( "acht\u00FAil", -1, 1, "", methodObject ),
new Among ( "eacht\u00FAil", 15, 1, "", methodObject ),
new Among ( "gineas", -1, 3, "", methodObject ),
new Among ( "ginis", -1, 3, "", methodObject ),
new Among ( "acht", -1, 1, "", methodObject ),
new Among ( "arcacht", 19, 2, "", methodObject ),
new Among ( "eacht", 19, 1, "", methodObject ),
new Among ( "grafa\u00EDocht", -1, 4, "", methodObject ),
new Among ( "arcachta\u00ED", -1, 2, "", methodObject ),
new Among ( "grafa\u00EDochta\u00ED", -1, 4, "", methodObject )
};
private final static Among a_3[] = {
new Among ( "imid", -1, 1, "", methodObject ),
new Among ( "aimid", 0, 1, "", methodObject ),
new Among ( "\u00EDmid", -1, 1, "", methodObject ),
new Among ( "a\u00EDmid", 2, 1, "", methodObject ),
new Among ( "adh", -1, 2, "", methodObject ),
new Among ( "eadh", 4, 2, "", methodObject ),
new Among ( "faidh", -1, 1, "", methodObject ),
new Among ( "fidh", -1, 1, "", methodObject ),
new Among ( "\u00E1il", -1, 2, "", methodObject ),
new Among ( "ain", -1, 2, "", methodObject ),
new Among ( "tear", -1, 2, "", methodObject ),
new Among ( "tar", -1, 2, "", methodObject )
};
private static final char g_v[] = {17, 65, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 17, 4, 2 };
private int I_p2;
private int I_p1;
private int I_pV;
private void copy_from(irishStemmer other) {
I_p2 = other.I_p2;
I_p1 = other.I_p1;
I_pV = other.I_pV;
super.copy_from(other);
}
private boolean r_mark_regions() {
int v_1;
int v_3;
// (, line 28
I_pV = limit;
I_p1 = limit;
I_p2 = limit;
// do, line 34
v_1 = cursor;
lab0: do {
// (, line 34
// gopast, line 35
golab1: while(true)
{
lab2: do {
if (!(in_grouping(g_v, 97, 250)))
{
break lab2;
}
break golab1;
} while (false);
if (cursor >= limit)
{
break lab0;
}
cursor++;
}
// setmark pV, line 35
I_pV = cursor;
} while (false);
cursor = v_1;
// do, line 37
v_3 = cursor;
lab3: do {
// (, line 37
// gopast, line 38
golab4: while(true)
{
lab5: do {
if (!(in_grouping(g_v, 97, 250)))
{
break lab5;
}
break golab4;
} while (false);
if (cursor >= limit)
{
break lab3;
}
cursor++;
}
// gopast, line 38
golab6: while(true)
{
lab7: do {
if (!(out_grouping(g_v, 97, 250)))
{
break lab7;
}
break golab6;
} while (false);
if (cursor >= limit)
{
break lab3;
}
cursor++;
}
// setmark p1, line 38
I_p1 = cursor;
// gopast, line 39
golab8: while(true)
{
lab9: do {
if (!(in_grouping(g_v, 97, 250)))
{
break lab9;
}
break golab8;
} while (false);
if (cursor >= limit)
{
break lab3;
}
cursor++;
}
// gopast, line 39
golab10: while(true)
{
lab11: do {
if (!(out_grouping(g_v, 97, 250)))
{
break lab11;
}
break golab10;
} while (false);
if (cursor >= limit)
{
break lab3;
}
cursor++;
}
// setmark p2, line 39
I_p2 = cursor;
} while (false);
cursor = v_3;
return true;
}
private boolean r_initial_morph() {
int among_var;
// (, line 43
// [, line 44
bra = cursor;
// substring, line 44
among_var = find_among(a_0, 24);
if (among_var == 0)
{
return false;
}
// ], line 44
ket = cursor;
switch (among_var) {
case 0:
return false;
case 1:
// (, line 46
// delete, line 46
slice_del();
break;
case 2:
// (, line 50
// delete, line 50
slice_del();
break;
case 3:
// (, line 52
// <-, line 52
slice_from("f");
break;
case 4:
// (, line 55
// delete, line 55
slice_del();
break;
case 5:
// (, line 58
// <-, line 58
slice_from("s");
break;
case 6:
// (, line 61
// <-, line 61
slice_from("b");
break;
case 7:
// (, line 63
// <-, line 63
slice_from("c");
break;
case 8:
// (, line 65
// <-, line 65
slice_from("d");
break;
case 9:
// (, line 67
// <-, line 67
slice_from("f");
break;
case 10:
// (, line 69
// <-, line 69
slice_from("g");
break;
case 11:
// (, line 71
// <-, line 71
slice_from("p");
break;
case 12:
// (, line 73
// <-, line 73
slice_from("s");
break;
case 13:
// (, line 75
// <-, line 75
slice_from("t");
break;
case 14:
// (, line 79
// <-, line 79
slice_from("b");
break;
case 15:
// (, line 81
// <-, line 81
slice_from("c");
break;
case 16:
// (, line 83
// <-, line 83
slice_from("d");
break;
case 17:
// (, line 85
// <-, line 85
slice_from("f");
break;
case 18:
// (, line 87
// <-, line 87
slice_from("g");
break;
case 19:
// (, line 89
// <-, line 89
slice_from("m");
break;
case 20:
// (, line 91
// <-, line 91
slice_from("p");
break;
case 21:
// (, line 93
// <-, line 93
slice_from("t");
break;
}
return true;
}
private boolean r_RV() {
if (!(I_pV <= cursor))
{
return false;
}
return true;
}
private boolean r_R1() {
if (!(I_p1 <= cursor))
{
return false;
}
return true;
}
private boolean r_R2() {
if (!(I_p2 <= cursor))
{
return false;
}
return true;
}
private boolean r_noun_sfx() {
int among_var;
// (, line 103
// [, line 104
ket = cursor;
// substring, line 104
among_var = find_among_b(a_1, 16);
if (among_var == 0)
{
return false;
}
// ], line 104
bra = cursor;
switch (among_var) {
case 0:
return false;
case 1:
// (, line 108
// call R1, line 108
if (!r_R1())
{
return false;
}
// delete, line 108
slice_del();
break;
case 2:
// (, line 110
// call R2, line 110
if (!r_R2())
{
return false;
}
// delete, line 110
slice_del();
break;
}
return true;
}
private boolean r_deriv() {
int among_var;
// (, line 113
// [, line 114
ket = cursor;
// substring, line 114
among_var = find_among_b(a_2, 25);
if (among_var == 0)
{
return false;
}
// ], line 114
bra = cursor;
switch (among_var) {
case 0:
return false;
case 1:
// (, line 116
// call R2, line 116
if (!r_R2())
{
return false;
}
// delete, line 116
slice_del();
break;
case 2:
// (, line 118
// <-, line 118
slice_from("arc");
break;
case 3:
// (, line 120
// <-, line 120
slice_from("gin");
break;
case 4:
// (, line 122
// <-, line 122
slice_from("graf");
break;
case 5:
// (, line 124
// <-, line 124
slice_from("paite");
break;
case 6:
// (, line 126
// <-, line 126
slice_from("\u00F3id");
break;
}
return true;
}
private boolean r_verb_sfx() {
int among_var;
// (, line 129
// [, line 130
ket = cursor;
// substring, line 130
among_var = find_among_b(a_3, 12);
if (among_var == 0)
{
return false;
}
// ], line 130
bra = cursor;
switch (among_var) {
case 0:
return false;
case 1:
// (, line 133
// call RV, line 133
if (!r_RV())
{
return false;
}
// delete, line 133
slice_del();
break;
case 2:
// (, line 138
// call R1, line 138
if (!r_R1())
{
return false;
}
// delete, line 138
slice_del();
break;
}
return true;
}
public boolean stem() {
int v_1;
int v_2;
int v_3;
int v_4;
int v_5;
// (, line 143
// do, line 144
v_1 = cursor;
lab0: do {
// call initial_morph, line 144
if (!r_initial_morph())
{
break lab0;
}
} while (false);
cursor = v_1;
// do, line 145
v_2 = cursor;
lab1: do {
// call mark_regions, line 145
if (!r_mark_regions())
{
break lab1;
}
} while (false);
cursor = v_2;
// backwards, line 146
limit_backward = cursor; cursor = limit;
// (, line 146
// do, line 147
v_3 = limit - cursor;
lab2: do {
// call noun_sfx, line 147
if (!r_noun_sfx())
{
break lab2;
}
} while (false);
cursor = limit - v_3;
// do, line 148
v_4 = limit - cursor;
lab3: do {
// call deriv, line 148
if (!r_deriv())
{
break lab3;
}
} while (false);
cursor = limit - v_4;
// do, line 149
v_5 = limit - cursor;
lab4: do {
// call verb_sfx, line 149
if (!r_verb_sfx())
{
break lab4;
}
} while (false);
cursor = limit - v_5;
cursor = limit_backward; return true;
}
public boolean equals( Object o ) {
return o instanceof irishStemmer;
}
public int hashCode() {
return irishStemmer.class.getName().hashCode();
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/stemmer
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/stemmer/snowball/italianStemmer.java
|
// CHECKSTYLE:OFF
/*
Copyright (c) 2001, Dr Martin Porter
Copyright (c) 2002, Richard Boulton
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* Neither the name of the copyright holders nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
// This file was generated automatically by the Snowball to Java compiler
package opennlp.tools.stemmer.snowball;
/**
* This class was automatically generated by a Snowball to Java compiler
* It implements the stemming algorithm defined by a snowball script.
*/
class italianStemmer extends opennlp.tools.stemmer.snowball.AbstractSnowballStemmer {
private final static italianStemmer methodObject = new italianStemmer ();
private final static Among a_0[] = {
new Among ( "", -1, 7, "", methodObject ),
new Among ( "qu", 0, 6, "", methodObject ),
new Among ( "\u00E1", 0, 1, "", methodObject ),
new Among ( "\u00E9", 0, 2, "", methodObject ),
new Among ( "\u00ED", 0, 3, "", methodObject ),
new Among ( "\u00F3", 0, 4, "", methodObject ),
new Among ( "\u00FA", 0, 5, "", methodObject )
};
private final static Among a_1[] = {
new Among ( "", -1, 3, "", methodObject ),
new Among ( "I", 0, 1, "", methodObject ),
new Among ( "U", 0, 2, "", methodObject )
};
private final static Among a_2[] = {
new Among ( "la", -1, -1, "", methodObject ),
new Among ( "cela", 0, -1, "", methodObject ),
new Among ( "gliela", 0, -1, "", methodObject ),
new Among ( "mela", 0, -1, "", methodObject ),
new Among ( "tela", 0, -1, "", methodObject ),
new Among ( "vela", 0, -1, "", methodObject ),
new Among ( "le", -1, -1, "", methodObject ),
new Among ( "cele", 6, -1, "", methodObject ),
new Among ( "gliele", 6, -1, "", methodObject ),
new Among ( "mele", 6, -1, "", methodObject ),
new Among ( "tele", 6, -1, "", methodObject ),
new Among ( "vele", 6, -1, "", methodObject ),
new Among ( "ne", -1, -1, "", methodObject ),
new Among ( "cene", 12, -1, "", methodObject ),
new Among ( "gliene", 12, -1, "", methodObject ),
new Among ( "mene", 12, -1, "", methodObject ),
new Among ( "sene", 12, -1, "", methodObject ),
new Among ( "tene", 12, -1, "", methodObject ),
new Among ( "vene", 12, -1, "", methodObject ),
new Among ( "ci", -1, -1, "", methodObject ),
new Among ( "li", -1, -1, "", methodObject ),
new Among ( "celi", 20, -1, "", methodObject ),
new Among ( "glieli", 20, -1, "", methodObject ),
new Among ( "meli", 20, -1, "", methodObject ),
new Among ( "teli", 20, -1, "", methodObject ),
new Among ( "veli", 20, -1, "", methodObject ),
new Among ( "gli", 20, -1, "", methodObject ),
new Among ( "mi", -1, -1, "", methodObject ),
new Among ( "si", -1, -1, "", methodObject ),
new Among ( "ti", -1, -1, "", methodObject ),
new Among ( "vi", -1, -1, "", methodObject ),
new Among ( "lo", -1, -1, "", methodObject ),
new Among ( "celo", 31, -1, "", methodObject ),
new Among ( "glielo", 31, -1, "", methodObject ),
new Among ( "melo", 31, -1, "", methodObject ),
new Among ( "telo", 31, -1, "", methodObject ),
new Among ( "velo", 31, -1, "", methodObject )
};
private final static Among a_3[] = {
new Among ( "ando", -1, 1, "", methodObject ),
new Among ( "endo", -1, 1, "", methodObject ),
new Among ( "ar", -1, 2, "", methodObject ),
new Among ( "er", -1, 2, "", methodObject ),
new Among ( "ir", -1, 2, "", methodObject )
};
private final static Among a_4[] = {
new Among ( "ic", -1, -1, "", methodObject ),
new Among ( "abil", -1, -1, "", methodObject ),
new Among ( "os", -1, -1, "", methodObject ),
new Among ( "iv", -1, 1, "", methodObject )
};
private final static Among a_5[] = {
new Among ( "ic", -1, 1, "", methodObject ),
new Among ( "abil", -1, 1, "", methodObject ),
new Among ( "iv", -1, 1, "", methodObject )
};
private final static Among a_6[] = {
new Among ( "ica", -1, 1, "", methodObject ),
new Among ( "logia", -1, 3, "", methodObject ),
new Among ( "osa", -1, 1, "", methodObject ),
new Among ( "ista", -1, 1, "", methodObject ),
new Among ( "iva", -1, 9, "", methodObject ),
new Among ( "anza", -1, 1, "", methodObject ),
new Among ( "enza", -1, 5, "", methodObject ),
new Among ( "ice", -1, 1, "", methodObject ),
new Among ( "atrice", 7, 1, "", methodObject ),
new Among ( "iche", -1, 1, "", methodObject ),
new Among ( "logie", -1, 3, "", methodObject ),
new Among ( "abile", -1, 1, "", methodObject ),
new Among ( "ibile", -1, 1, "", methodObject ),
new Among ( "usione", -1, 4, "", methodObject ),
new Among ( "azione", -1, 2, "", methodObject ),
new Among ( "uzione", -1, 4, "", methodObject ),
new Among ( "atore", -1, 2, "", methodObject ),
new Among ( "ose", -1, 1, "", methodObject ),
new Among ( "ante", -1, 1, "", methodObject ),
new Among ( "mente", -1, 1, "", methodObject ),
new Among ( "amente", 19, 7, "", methodObject ),
new Among ( "iste", -1, 1, "", methodObject ),
new Among ( "ive", -1, 9, "", methodObject ),
new Among ( "anze", -1, 1, "", methodObject ),
new Among ( "enze", -1, 5, "", methodObject ),
new Among ( "ici", -1, 1, "", methodObject ),
new Among ( "atrici", 25, 1, "", methodObject ),
new Among ( "ichi", -1, 1, "", methodObject ),
new Among ( "abili", -1, 1, "", methodObject ),
new Among ( "ibili", -1, 1, "", methodObject ),
new Among ( "ismi", -1, 1, "", methodObject ),
new Among ( "usioni", -1, 4, "", methodObject ),
new Among ( "azioni", -1, 2, "", methodObject ),
new Among ( "uzioni", -1, 4, "", methodObject ),
new Among ( "atori", -1, 2, "", methodObject ),
new Among ( "osi", -1, 1, "", methodObject ),
new Among ( "anti", -1, 1, "", methodObject ),
new Among ( "amenti", -1, 6, "", methodObject ),
new Among ( "imenti", -1, 6, "", methodObject ),
new Among ( "isti", -1, 1, "", methodObject ),
new Among ( "ivi", -1, 9, "", methodObject ),
new Among ( "ico", -1, 1, "", methodObject ),
new Among ( "ismo", -1, 1, "", methodObject ),
new Among ( "oso", -1, 1, "", methodObject ),
new Among ( "amento", -1, 6, "", methodObject ),
new Among ( "imento", -1, 6, "", methodObject ),
new Among ( "ivo", -1, 9, "", methodObject ),
new Among ( "it\u00E0", -1, 8, "", methodObject ),
new Among ( "ist\u00E0", -1, 1, "", methodObject ),
new Among ( "ist\u00E8", -1, 1, "", methodObject ),
new Among ( "ist\u00EC", -1, 1, "", methodObject )
};
private final static Among a_7[] = {
new Among ( "isca", -1, 1, "", methodObject ),
new Among ( "enda", -1, 1, "", methodObject ),
new Among ( "ata", -1, 1, "", methodObject ),
new Among ( "ita", -1, 1, "", methodObject ),
new Among ( "uta", -1, 1, "", methodObject ),
new Among ( "ava", -1, 1, "", methodObject ),
new Among ( "eva", -1, 1, "", methodObject ),
new Among ( "iva", -1, 1, "", methodObject ),
new Among ( "erebbe", -1, 1, "", methodObject ),
new Among ( "irebbe", -1, 1, "", methodObject ),
new Among ( "isce", -1, 1, "", methodObject ),
new Among ( "ende", -1, 1, "", methodObject ),
new Among ( "are", -1, 1, "", methodObject ),
new Among ( "ere", -1, 1, "", methodObject ),
new Among ( "ire", -1, 1, "", methodObject ),
new Among ( "asse", -1, 1, "", methodObject ),
new Among ( "ate", -1, 1, "", methodObject ),
new Among ( "avate", 16, 1, "", methodObject ),
new Among ( "evate", 16, 1, "", methodObject ),
new Among ( "ivate", 16, 1, "", methodObject ),
new Among ( "ete", -1, 1, "", methodObject ),
new Among ( "erete", 20, 1, "", methodObject ),
new Among ( "irete", 20, 1, "", methodObject ),
new Among ( "ite", -1, 1, "", methodObject ),
new Among ( "ereste", -1, 1, "", methodObject ),
new Among ( "ireste", -1, 1, "", methodObject ),
new Among ( "ute", -1, 1, "", methodObject ),
new Among ( "erai", -1, 1, "", methodObject ),
new Among ( "irai", -1, 1, "", methodObject ),
new Among ( "isci", -1, 1, "", methodObject ),
new Among ( "endi", -1, 1, "", methodObject ),
new Among ( "erei", -1, 1, "", methodObject ),
new Among ( "irei", -1, 1, "", methodObject ),
new Among ( "assi", -1, 1, "", methodObject ),
new Among ( "ati", -1, 1, "", methodObject ),
new Among ( "iti", -1, 1, "", methodObject ),
new Among ( "eresti", -1, 1, "", methodObject ),
new Among ( "iresti", -1, 1, "", methodObject ),
new Among ( "uti", -1, 1, "", methodObject ),
new Among ( "avi", -1, 1, "", methodObject ),
new Among ( "evi", -1, 1, "", methodObject ),
new Among ( "ivi", -1, 1, "", methodObject ),
new Among ( "isco", -1, 1, "", methodObject ),
new Among ( "ando", -1, 1, "", methodObject ),
new Among ( "endo", -1, 1, "", methodObject ),
new Among ( "Yamo", -1, 1, "", methodObject ),
new Among ( "iamo", -1, 1, "", methodObject ),
new Among ( "avamo", -1, 1, "", methodObject ),
new Among ( "evamo", -1, 1, "", methodObject ),
new Among ( "ivamo", -1, 1, "", methodObject ),
new Among ( "eremo", -1, 1, "", methodObject ),
new Among ( "iremo", -1, 1, "", methodObject ),
new Among ( "assimo", -1, 1, "", methodObject ),
new Among ( "ammo", -1, 1, "", methodObject ),
new Among ( "emmo", -1, 1, "", methodObject ),
new Among ( "eremmo", 54, 1, "", methodObject ),
new Among ( "iremmo", 54, 1, "", methodObject ),
new Among ( "immo", -1, 1, "", methodObject ),
new Among ( "ano", -1, 1, "", methodObject ),
new Among ( "iscano", 58, 1, "", methodObject ),
new Among ( "avano", 58, 1, "", methodObject ),
new Among ( "evano", 58, 1, "", methodObject ),
new Among ( "ivano", 58, 1, "", methodObject ),
new Among ( "eranno", -1, 1, "", methodObject ),
new Among ( "iranno", -1, 1, "", methodObject ),
new Among ( "ono", -1, 1, "", methodObject ),
new Among ( "iscono", 65, 1, "", methodObject ),
new Among ( "arono", 65, 1, "", methodObject ),
new Among ( "erono", 65, 1, "", methodObject ),
new Among ( "irono", 65, 1, "", methodObject ),
new Among ( "erebbero", -1, 1, "", methodObject ),
new Among ( "irebbero", -1, 1, "", methodObject ),
new Among ( "assero", -1, 1, "", methodObject ),
new Among ( "essero", -1, 1, "", methodObject ),
new Among ( "issero", -1, 1, "", methodObject ),
new Among ( "ato", -1, 1, "", methodObject ),
new Among ( "ito", -1, 1, "", methodObject ),
new Among ( "uto", -1, 1, "", methodObject ),
new Among ( "avo", -1, 1, "", methodObject ),
new Among ( "evo", -1, 1, "", methodObject ),
new Among ( "ivo", -1, 1, "", methodObject ),
new Among ( "ar", -1, 1, "", methodObject ),
new Among ( "ir", -1, 1, "", methodObject ),
new Among ( "er\u00E0", -1, 1, "", methodObject ),
new Among ( "ir\u00E0", -1, 1, "", methodObject ),
new Among ( "er\u00F2", -1, 1, "", methodObject ),
new Among ( "ir\u00F2", -1, 1, "", methodObject )
};
private static final char g_v[] = {17, 65, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 128, 128, 8, 2, 1 };
private static final char g_AEIO[] = {17, 65, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 128, 128, 8, 2 };
private static final char g_CG[] = {17 };
private int I_p2;
private int I_p1;
private int I_pV;
private void copy_from(italianStemmer other) {
I_p2 = other.I_p2;
I_p1 = other.I_p1;
I_pV = other.I_pV;
super.copy_from(other);
}
private boolean r_prelude() {
int among_var;
int v_1;
int v_2;
int v_3;
int v_4;
int v_5;
// (, line 34
// test, line 35
v_1 = cursor;
// repeat, line 35
replab0: while(true)
{
v_2 = cursor;
lab1: do {
// (, line 35
// [, line 36
bra = cursor;
// substring, line 36
among_var = find_among(a_0, 7);
if (among_var == 0)
{
break lab1;
}
// ], line 36
ket = cursor;
switch(among_var) {
case 0:
break lab1;
case 1:
// (, line 37
// <-, line 37
slice_from("\u00E0");
break;
case 2:
// (, line 38
// <-, line 38
slice_from("\u00E8");
break;
case 3:
// (, line 39
// <-, line 39
slice_from("\u00EC");
break;
case 4:
// (, line 40
// <-, line 40
slice_from("\u00F2");
break;
case 5:
// (, line 41
// <-, line 41
slice_from("\u00F9");
break;
case 6:
// (, line 42
// <-, line 42
slice_from("qU");
break;
case 7:
// (, line 43
// next, line 43
if (cursor >= limit)
{
break lab1;
}
cursor++;
break;
}
continue replab0;
} while (false);
cursor = v_2;
break replab0;
}
cursor = v_1;
// repeat, line 46
replab2: while(true)
{
v_3 = cursor;
lab3: do {
// goto, line 46
golab4: while(true)
{
v_4 = cursor;
lab5: do {
// (, line 46
if (!(in_grouping(g_v, 97, 249)))
{
break lab5;
}
// [, line 47
bra = cursor;
// or, line 47
lab6: do {
v_5 = cursor;
lab7: do {
// (, line 47
// literal, line 47
if (!(eq_s(1, "u")))
{
break lab7;
}
// ], line 47
ket = cursor;
if (!(in_grouping(g_v, 97, 249)))
{
break lab7;
}
// <-, line 47
slice_from("U");
break lab6;
} while (false);
cursor = v_5;
// (, line 48
// literal, line 48
if (!(eq_s(1, "i")))
{
break lab5;
}
// ], line 48
ket = cursor;
if (!(in_grouping(g_v, 97, 249)))
{
break lab5;
}
// <-, line 48
slice_from("I");
} while (false);
cursor = v_4;
break golab4;
} while (false);
cursor = v_4;
if (cursor >= limit)
{
break lab3;
}
cursor++;
}
continue replab2;
} while (false);
cursor = v_3;
break replab2;
}
return true;
}
private boolean r_mark_regions() {
int v_1;
int v_2;
int v_3;
int v_6;
int v_8;
// (, line 52
I_pV = limit;
I_p1 = limit;
I_p2 = limit;
// do, line 58
v_1 = cursor;
lab0: do {
// (, line 58
// or, line 60
lab1: do {
v_2 = cursor;
lab2: do {
// (, line 59
if (!(in_grouping(g_v, 97, 249)))
{
break lab2;
}
// or, line 59
lab3: do {
v_3 = cursor;
lab4: do {
// (, line 59
if (!(out_grouping(g_v, 97, 249)))
{
break lab4;
}
// gopast, line 59
golab5: while(true)
{
lab6: do {
if (!(in_grouping(g_v, 97, 249)))
{
break lab6;
}
break golab5;
} while (false);
if (cursor >= limit)
{
break lab4;
}
cursor++;
}
break lab3;
} while (false);
cursor = v_3;
// (, line 59
if (!(in_grouping(g_v, 97, 249)))
{
break lab2;
}
// gopast, line 59
golab7: while(true)
{
lab8: do {
if (!(out_grouping(g_v, 97, 249)))
{
break lab8;
}
break golab7;
} while (false);
if (cursor >= limit)
{
break lab2;
}
cursor++;
}
} while (false);
break lab1;
} while (false);
cursor = v_2;
// (, line 61
if (!(out_grouping(g_v, 97, 249)))
{
break lab0;
}
// or, line 61
lab9: do {
v_6 = cursor;
lab10: do {
// (, line 61
if (!(out_grouping(g_v, 97, 249)))
{
break lab10;
}
// gopast, line 61
golab11: while(true)
{
lab12: do {
if (!(in_grouping(g_v, 97, 249)))
{
break lab12;
}
break golab11;
} while (false);
if (cursor >= limit)
{
break lab10;
}
cursor++;
}
break lab9;
} while (false);
cursor = v_6;
// (, line 61
if (!(in_grouping(g_v, 97, 249)))
{
break lab0;
}
// next, line 61
if (cursor >= limit)
{
break lab0;
}
cursor++;
} while (false);
} while (false);
// setmark pV, line 62
I_pV = cursor;
} while (false);
cursor = v_1;
// do, line 64
v_8 = cursor;
lab13: do {
// (, line 64
// gopast, line 65
golab14: while(true)
{
lab15: do {
if (!(in_grouping(g_v, 97, 249)))
{
break lab15;
}
break golab14;
} while (false);
if (cursor >= limit)
{
break lab13;
}
cursor++;
}
// gopast, line 65
golab16: while(true)
{
lab17: do {
if (!(out_grouping(g_v, 97, 249)))
{
break lab17;
}
break golab16;
} while (false);
if (cursor >= limit)
{
break lab13;
}
cursor++;
}
// setmark p1, line 65
I_p1 = cursor;
// gopast, line 66
golab18: while(true)
{
lab19: do {
if (!(in_grouping(g_v, 97, 249)))
{
break lab19;
}
break golab18;
} while (false);
if (cursor >= limit)
{
break lab13;
}
cursor++;
}
// gopast, line 66
golab20: while(true)
{
lab21: do {
if (!(out_grouping(g_v, 97, 249)))
{
break lab21;
}
break golab20;
} while (false);
if (cursor >= limit)
{
break lab13;
}
cursor++;
}
// setmark p2, line 66
I_p2 = cursor;
} while (false);
cursor = v_8;
return true;
}
private boolean r_postlude() {
int among_var;
int v_1;
// repeat, line 70
replab0: while(true)
{
v_1 = cursor;
lab1: do {
// (, line 70
// [, line 72
bra = cursor;
// substring, line 72
among_var = find_among(a_1, 3);
if (among_var == 0)
{
break lab1;
}
// ], line 72
ket = cursor;
switch(among_var) {
case 0:
break lab1;
case 1:
// (, line 73
// <-, line 73
slice_from("i");
break;
case 2:
// (, line 74
// <-, line 74
slice_from("u");
break;
case 3:
// (, line 75
// next, line 75
if (cursor >= limit)
{
break lab1;
}
cursor++;
break;
}
continue replab0;
} while (false);
cursor = v_1;
break replab0;
}
return true;
}
private boolean r_RV() {
if (!(I_pV <= cursor))
{
return false;
}
return true;
}
private boolean r_R1() {
if (!(I_p1 <= cursor))
{
return false;
}
return true;
}
private boolean r_R2() {
if (!(I_p2 <= cursor))
{
return false;
}
return true;
}
private boolean r_attached_pronoun() {
int among_var;
// (, line 86
// [, line 87
ket = cursor;
// substring, line 87
if (find_among_b(a_2, 37) == 0)
{
return false;
}
// ], line 87
bra = cursor;
// among, line 97
among_var = find_among_b(a_3, 5);
if (among_var == 0)
{
return false;
}
// (, line 97
// call RV, line 97
if (!r_RV())
{
return false;
}
switch(among_var) {
case 0:
return false;
case 1:
// (, line 98
// delete, line 98
slice_del();
break;
case 2:
// (, line 99
// <-, line 99
slice_from("e");
break;
}
return true;
}
private boolean r_standard_suffix() {
int among_var;
int v_1;
int v_2;
int v_3;
int v_4;
// (, line 103
// [, line 104
ket = cursor;
// substring, line 104
among_var = find_among_b(a_6, 51);
if (among_var == 0)
{
return false;
}
// ], line 104
bra = cursor;
switch(among_var) {
case 0:
return false;
case 1:
// (, line 111
// call R2, line 111
if (!r_R2())
{
return false;
}
// delete, line 111
slice_del();
break;
case 2:
// (, line 113
// call R2, line 113
if (!r_R2())
{
return false;
}
// delete, line 113
slice_del();
// try, line 114
v_1 = limit - cursor;
lab0: do {
// (, line 114
// [, line 114
ket = cursor;
// literal, line 114
if (!(eq_s_b(2, "ic")))
{
cursor = limit - v_1;
break lab0;
}
// ], line 114
bra = cursor;
// call R2, line 114
if (!r_R2())
{
cursor = limit - v_1;
break lab0;
}
// delete, line 114
slice_del();
} while (false);
break;
case 3:
// (, line 117
// call R2, line 117
if (!r_R2())
{
return false;
}
// <-, line 117
slice_from("log");
break;
case 4:
// (, line 119
// call R2, line 119
if (!r_R2())
{
return false;
}
// <-, line 119
slice_from("u");
break;
case 5:
// (, line 121
// call R2, line 121
if (!r_R2())
{
return false;
}
// <-, line 121
slice_from("ente");
break;
case 6:
// (, line 123
// call RV, line 123
if (!r_RV())
{
return false;
}
// delete, line 123
slice_del();
break;
case 7:
// (, line 124
// call R1, line 125
if (!r_R1())
{
return false;
}
// delete, line 125
slice_del();
// try, line 126
v_2 = limit - cursor;
lab1: do {
// (, line 126
// [, line 127
ket = cursor;
// substring, line 127
among_var = find_among_b(a_4, 4);
if (among_var == 0)
{
cursor = limit - v_2;
break lab1;
}
// ], line 127
bra = cursor;
// call R2, line 127
if (!r_R2())
{
cursor = limit - v_2;
break lab1;
}
// delete, line 127
slice_del();
switch(among_var) {
case 0:
cursor = limit - v_2;
break lab1;
case 1:
// (, line 128
// [, line 128
ket = cursor;
// literal, line 128
if (!(eq_s_b(2, "at")))
{
cursor = limit - v_2;
break lab1;
}
// ], line 128
bra = cursor;
// call R2, line 128
if (!r_R2())
{
cursor = limit - v_2;
break lab1;
}
// delete, line 128
slice_del();
break;
}
} while (false);
break;
case 8:
// (, line 133
// call R2, line 134
if (!r_R2())
{
return false;
}
// delete, line 134
slice_del();
// try, line 135
v_3 = limit - cursor;
lab2: do {
// (, line 135
// [, line 136
ket = cursor;
// substring, line 136
among_var = find_among_b(a_5, 3);
if (among_var == 0)
{
cursor = limit - v_3;
break lab2;
}
// ], line 136
bra = cursor;
switch(among_var) {
case 0:
cursor = limit - v_3;
break lab2;
case 1:
// (, line 137
// call R2, line 137
if (!r_R2())
{
cursor = limit - v_3;
break lab2;
}
// delete, line 137
slice_del();
break;
}
} while (false);
break;
case 9:
// (, line 141
// call R2, line 142
if (!r_R2())
{
return false;
}
// delete, line 142
slice_del();
// try, line 143
v_4 = limit - cursor;
lab3: do {
// (, line 143
// [, line 143
ket = cursor;
// literal, line 143
if (!(eq_s_b(2, "at")))
{
cursor = limit - v_4;
break lab3;
}
// ], line 143
bra = cursor;
// call R2, line 143
if (!r_R2())
{
cursor = limit - v_4;
break lab3;
}
// delete, line 143
slice_del();
// [, line 143
ket = cursor;
// literal, line 143
if (!(eq_s_b(2, "ic")))
{
cursor = limit - v_4;
break lab3;
}
// ], line 143
bra = cursor;
// call R2, line 143
if (!r_R2())
{
cursor = limit - v_4;
break lab3;
}
// delete, line 143
slice_del();
} while (false);
break;
}
return true;
}
private boolean r_verb_suffix() {
int among_var;
int v_1;
int v_2;
// setlimit, line 148
v_1 = limit - cursor;
// tomark, line 148
if (cursor < I_pV)
{
return false;
}
cursor = I_pV;
v_2 = limit_backward;
limit_backward = cursor;
cursor = limit - v_1;
// (, line 148
// [, line 149
ket = cursor;
// substring, line 149
among_var = find_among_b(a_7, 87);
if (among_var == 0)
{
limit_backward = v_2;
return false;
}
// ], line 149
bra = cursor;
switch(among_var) {
case 0:
limit_backward = v_2;
return false;
case 1:
// (, line 163
// delete, line 163
slice_del();
break;
}
limit_backward = v_2;
return true;
}
private boolean r_vowel_suffix() {
int v_1;
int v_2;
// (, line 170
// try, line 171
v_1 = limit - cursor;
lab0: do {
// (, line 171
// [, line 172
ket = cursor;
if (!(in_grouping_b(g_AEIO, 97, 242)))
{
cursor = limit - v_1;
break lab0;
}
// ], line 172
bra = cursor;
// call RV, line 172
if (!r_RV())
{
cursor = limit - v_1;
break lab0;
}
// delete, line 172
slice_del();
// [, line 173
ket = cursor;
// literal, line 173
if (!(eq_s_b(1, "i")))
{
cursor = limit - v_1;
break lab0;
}
// ], line 173
bra = cursor;
// call RV, line 173
if (!r_RV())
{
cursor = limit - v_1;
break lab0;
}
// delete, line 173
slice_del();
} while (false);
// try, line 175
v_2 = limit - cursor;
lab1: do {
// (, line 175
// [, line 176
ket = cursor;
// literal, line 176
if (!(eq_s_b(1, "h")))
{
cursor = limit - v_2;
break lab1;
}
// ], line 176
bra = cursor;
if (!(in_grouping_b(g_CG, 99, 103)))
{
cursor = limit - v_2;
break lab1;
}
// call RV, line 176
if (!r_RV())
{
cursor = limit - v_2;
break lab1;
}
// delete, line 176
slice_del();
} while (false);
return true;
}
public boolean stem() {
int v_1;
int v_2;
int v_3;
int v_4;
int v_5;
int v_6;
int v_7;
// (, line 181
// do, line 182
v_1 = cursor;
lab0: do {
// call prelude, line 182
if (!r_prelude())
{
break lab0;
}
} while (false);
cursor = v_1;
// do, line 183
v_2 = cursor;
lab1: do {
// call mark_regions, line 183
if (!r_mark_regions())
{
break lab1;
}
} while (false);
cursor = v_2;
// backwards, line 184
limit_backward = cursor; cursor = limit;
// (, line 184
// do, line 185
v_3 = limit - cursor;
lab2: do {
// call attached_pronoun, line 185
if (!r_attached_pronoun())
{
break lab2;
}
} while (false);
cursor = limit - v_3;
// do, line 186
v_4 = limit - cursor;
lab3: do {
// (, line 186
// or, line 186
lab4: do {
v_5 = limit - cursor;
lab5: do {
// call standard_suffix, line 186
if (!r_standard_suffix())
{
break lab5;
}
break lab4;
} while (false);
cursor = limit - v_5;
// call verb_suffix, line 186
if (!r_verb_suffix())
{
break lab3;
}
} while (false);
} while (false);
cursor = limit - v_4;
// do, line 187
v_6 = limit - cursor;
lab6: do {
// call vowel_suffix, line 187
if (!r_vowel_suffix())
{
break lab6;
}
} while (false);
cursor = limit - v_6;
cursor = limit_backward; // do, line 189
v_7 = cursor;
lab7: do {
// call postlude, line 189
if (!r_postlude())
{
break lab7;
}
} while (false);
cursor = v_7;
return true;
}
public boolean equals( Object o ) {
return o instanceof italianStemmer;
}
public int hashCode() {
return italianStemmer.class.getName().hashCode();
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/stemmer
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/stemmer/snowball/norwegianStemmer.java
|
// CHECKSTYLE:OFF
/*
Copyright (c) 2001, Dr Martin Porter
Copyright (c) 2002, Richard Boulton
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* Neither the name of the copyright holders nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
// This file was generated automatically by the Snowball to Java compiler
package opennlp.tools.stemmer.snowball;
/**
* This class was automatically generated by a Snowball to Java compiler
* It implements the stemming algorithm defined by a snowball script.
*/
class norwegianStemmer extends opennlp.tools.stemmer.snowball.AbstractSnowballStemmer {
private final static norwegianStemmer methodObject = new norwegianStemmer ();
private final static Among a_0[] = {
new Among ( "a", -1, 1, "", methodObject ),
new Among ( "e", -1, 1, "", methodObject ),
new Among ( "ede", 1, 1, "", methodObject ),
new Among ( "ande", 1, 1, "", methodObject ),
new Among ( "ende", 1, 1, "", methodObject ),
new Among ( "ane", 1, 1, "", methodObject ),
new Among ( "ene", 1, 1, "", methodObject ),
new Among ( "hetene", 6, 1, "", methodObject ),
new Among ( "erte", 1, 3, "", methodObject ),
new Among ( "en", -1, 1, "", methodObject ),
new Among ( "heten", 9, 1, "", methodObject ),
new Among ( "ar", -1, 1, "", methodObject ),
new Among ( "er", -1, 1, "", methodObject ),
new Among ( "heter", 12, 1, "", methodObject ),
new Among ( "s", -1, 2, "", methodObject ),
new Among ( "as", 14, 1, "", methodObject ),
new Among ( "es", 14, 1, "", methodObject ),
new Among ( "edes", 16, 1, "", methodObject ),
new Among ( "endes", 16, 1, "", methodObject ),
new Among ( "enes", 16, 1, "", methodObject ),
new Among ( "hetenes", 19, 1, "", methodObject ),
new Among ( "ens", 14, 1, "", methodObject ),
new Among ( "hetens", 21, 1, "", methodObject ),
new Among ( "ers", 14, 1, "", methodObject ),
new Among ( "ets", 14, 1, "", methodObject ),
new Among ( "et", -1, 1, "", methodObject ),
new Among ( "het", 25, 1, "", methodObject ),
new Among ( "ert", -1, 3, "", methodObject ),
new Among ( "ast", -1, 1, "", methodObject )
};
private final static Among a_1[] = {
new Among ( "dt", -1, -1, "", methodObject ),
new Among ( "vt", -1, -1, "", methodObject )
};
private final static Among a_2[] = {
new Among ( "leg", -1, 1, "", methodObject ),
new Among ( "eleg", 0, 1, "", methodObject ),
new Among ( "ig", -1, 1, "", methodObject ),
new Among ( "eig", 2, 1, "", methodObject ),
new Among ( "lig", 2, 1, "", methodObject ),
new Among ( "elig", 4, 1, "", methodObject ),
new Among ( "els", -1, 1, "", methodObject ),
new Among ( "lov", -1, 1, "", methodObject ),
new Among ( "elov", 7, 1, "", methodObject ),
new Among ( "slov", 7, 1, "", methodObject ),
new Among ( "hetslov", 9, 1, "", methodObject )
};
private static final char g_v[] = {17, 65, 16, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 48, 0, 128 };
private static final char g_s_ending[] = {119, 125, 149, 1 };
private int I_x;
private int I_p1;
private void copy_from(norwegianStemmer other) {
I_x = other.I_x;
I_p1 = other.I_p1;
super.copy_from(other);
}
private boolean r_mark_regions() {
int v_1;
int v_2;
// (, line 26
I_p1 = limit;
// test, line 30
v_1 = cursor;
// (, line 30
// hop, line 30
{
int c = cursor + 3;
if (0 > c || c > limit)
{
return false;
}
cursor = c;
}
// setmark x, line 30
I_x = cursor;
cursor = v_1;
// goto, line 31
golab0: while(true)
{
v_2 = cursor;
lab1: do {
if (!(in_grouping(g_v, 97, 248)))
{
break lab1;
}
cursor = v_2;
break golab0;
} while (false);
cursor = v_2;
if (cursor >= limit)
{
return false;
}
cursor++;
}
// gopast, line 31
golab2: while(true)
{
lab3: do {
if (!(out_grouping(g_v, 97, 248)))
{
break lab3;
}
break golab2;
} while (false);
if (cursor >= limit)
{
return false;
}
cursor++;
}
// setmark p1, line 31
I_p1 = cursor;
// try, line 32
lab4: do {
// (, line 32
if (!(I_p1 < I_x))
{
break lab4;
}
I_p1 = I_x;
} while (false);
return true;
}
private boolean r_main_suffix() {
int among_var;
int v_1;
int v_2;
int v_3;
// (, line 37
// setlimit, line 38
v_1 = limit - cursor;
// tomark, line 38
if (cursor < I_p1)
{
return false;
}
cursor = I_p1;
v_2 = limit_backward;
limit_backward = cursor;
cursor = limit - v_1;
// (, line 38
// [, line 38
ket = cursor;
// substring, line 38
among_var = find_among_b(a_0, 29);
if (among_var == 0)
{
limit_backward = v_2;
return false;
}
// ], line 38
bra = cursor;
limit_backward = v_2;
switch(among_var) {
case 0:
return false;
case 1:
// (, line 44
// delete, line 44
slice_del();
break;
case 2:
// (, line 46
// or, line 46
lab0: do {
v_3 = limit - cursor;
lab1: do {
if (!(in_grouping_b(g_s_ending, 98, 122)))
{
break lab1;
}
break lab0;
} while (false);
cursor = limit - v_3;
// (, line 46
// literal, line 46
if (!(eq_s_b(1, "k")))
{
return false;
}
if (!(out_grouping_b(g_v, 97, 248)))
{
return false;
}
} while (false);
// delete, line 46
slice_del();
break;
case 3:
// (, line 48
// <-, line 48
slice_from("er");
break;
}
return true;
}
private boolean r_consonant_pair() {
int v_1;
int v_2;
int v_3;
// (, line 52
// test, line 53
v_1 = limit - cursor;
// (, line 53
// setlimit, line 54
v_2 = limit - cursor;
// tomark, line 54
if (cursor < I_p1)
{
return false;
}
cursor = I_p1;
v_3 = limit_backward;
limit_backward = cursor;
cursor = limit - v_2;
// (, line 54
// [, line 54
ket = cursor;
// substring, line 54
if (find_among_b(a_1, 2) == 0)
{
limit_backward = v_3;
return false;
}
// ], line 54
bra = cursor;
limit_backward = v_3;
cursor = limit - v_1;
// next, line 59
if (cursor <= limit_backward)
{
return false;
}
cursor--;
// ], line 59
bra = cursor;
// delete, line 59
slice_del();
return true;
}
private boolean r_other_suffix() {
int among_var;
int v_1;
int v_2;
// (, line 62
// setlimit, line 63
v_1 = limit - cursor;
// tomark, line 63
if (cursor < I_p1)
{
return false;
}
cursor = I_p1;
v_2 = limit_backward;
limit_backward = cursor;
cursor = limit - v_1;
// (, line 63
// [, line 63
ket = cursor;
// substring, line 63
among_var = find_among_b(a_2, 11);
if (among_var == 0)
{
limit_backward = v_2;
return false;
}
// ], line 63
bra = cursor;
limit_backward = v_2;
switch(among_var) {
case 0:
return false;
case 1:
// (, line 67
// delete, line 67
slice_del();
break;
}
return true;
}
public boolean stem() {
int v_1;
int v_2;
int v_3;
int v_4;
// (, line 72
// do, line 74
v_1 = cursor;
lab0: do {
// call mark_regions, line 74
if (!r_mark_regions())
{
break lab0;
}
} while (false);
cursor = v_1;
// backwards, line 75
limit_backward = cursor; cursor = limit;
// (, line 75
// do, line 76
v_2 = limit - cursor;
lab1: do {
// call main_suffix, line 76
if (!r_main_suffix())
{
break lab1;
}
} while (false);
cursor = limit - v_2;
// do, line 77
v_3 = limit - cursor;
lab2: do {
// call consonant_pair, line 77
if (!r_consonant_pair())
{
break lab2;
}
} while (false);
cursor = limit - v_3;
// do, line 78
v_4 = limit - cursor;
lab3: do {
// call other_suffix, line 78
if (!r_other_suffix())
{
break lab3;
}
} while (false);
cursor = limit - v_4;
cursor = limit_backward; return true;
}
public boolean equals( Object o ) {
return o instanceof norwegianStemmer;
}
public int hashCode() {
return norwegianStemmer.class.getName().hashCode();
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/stemmer
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/stemmer/snowball/porterStemmer.java
|
// CHECKSTYLE:OFF
/*
Copyright (c) 2001, Dr Martin Porter
Copyright (c) 2002, Richard Boulton
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* Neither the name of the copyright holders nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
// This file was generated automatically by the Snowball to Java compiler
package opennlp.tools.stemmer.snowball;
/**
* This class was automatically generated by a Snowball to Java compiler
* It implements the stemming algorithm defined by a snowball script.
*/
class porterStemmer extends opennlp.tools.stemmer.snowball.AbstractSnowballStemmer {
private final static porterStemmer methodObject = new porterStemmer ();
private final static Among a_0[] = {
new Among ( "s", -1, 3, "", methodObject ),
new Among ( "ies", 0, 2, "", methodObject ),
new Among ( "sses", 0, 1, "", methodObject ),
new Among ( "ss", 0, -1, "", methodObject )
};
private final static Among a_1[] = {
new Among ( "", -1, 3, "", methodObject ),
new Among ( "bb", 0, 2, "", methodObject ),
new Among ( "dd", 0, 2, "", methodObject ),
new Among ( "ff", 0, 2, "", methodObject ),
new Among ( "gg", 0, 2, "", methodObject ),
new Among ( "bl", 0, 1, "", methodObject ),
new Among ( "mm", 0, 2, "", methodObject ),
new Among ( "nn", 0, 2, "", methodObject ),
new Among ( "pp", 0, 2, "", methodObject ),
new Among ( "rr", 0, 2, "", methodObject ),
new Among ( "at", 0, 1, "", methodObject ),
new Among ( "tt", 0, 2, "", methodObject ),
new Among ( "iz", 0, 1, "", methodObject )
};
private final static Among a_2[] = {
new Among ( "ed", -1, 2, "", methodObject ),
new Among ( "eed", 0, 1, "", methodObject ),
new Among ( "ing", -1, 2, "", methodObject )
};
private final static Among a_3[] = {
new Among ( "anci", -1, 3, "", methodObject ),
new Among ( "enci", -1, 2, "", methodObject ),
new Among ( "abli", -1, 4, "", methodObject ),
new Among ( "eli", -1, 6, "", methodObject ),
new Among ( "alli", -1, 9, "", methodObject ),
new Among ( "ousli", -1, 12, "", methodObject ),
new Among ( "entli", -1, 5, "", methodObject ),
new Among ( "aliti", -1, 10, "", methodObject ),
new Among ( "biliti", -1, 14, "", methodObject ),
new Among ( "iviti", -1, 13, "", methodObject ),
new Among ( "tional", -1, 1, "", methodObject ),
new Among ( "ational", 10, 8, "", methodObject ),
new Among ( "alism", -1, 10, "", methodObject ),
new Among ( "ation", -1, 8, "", methodObject ),
new Among ( "ization", 13, 7, "", methodObject ),
new Among ( "izer", -1, 7, "", methodObject ),
new Among ( "ator", -1, 8, "", methodObject ),
new Among ( "iveness", -1, 13, "", methodObject ),
new Among ( "fulness", -1, 11, "", methodObject ),
new Among ( "ousness", -1, 12, "", methodObject )
};
private final static Among a_4[] = {
new Among ( "icate", -1, 2, "", methodObject ),
new Among ( "ative", -1, 3, "", methodObject ),
new Among ( "alize", -1, 1, "", methodObject ),
new Among ( "iciti", -1, 2, "", methodObject ),
new Among ( "ical", -1, 2, "", methodObject ),
new Among ( "ful", -1, 3, "", methodObject ),
new Among ( "ness", -1, 3, "", methodObject )
};
private final static Among a_5[] = {
new Among ( "ic", -1, 1, "", methodObject ),
new Among ( "ance", -1, 1, "", methodObject ),
new Among ( "ence", -1, 1, "", methodObject ),
new Among ( "able", -1, 1, "", methodObject ),
new Among ( "ible", -1, 1, "", methodObject ),
new Among ( "ate", -1, 1, "", methodObject ),
new Among ( "ive", -1, 1, "", methodObject ),
new Among ( "ize", -1, 1, "", methodObject ),
new Among ( "iti", -1, 1, "", methodObject ),
new Among ( "al", -1, 1, "", methodObject ),
new Among ( "ism", -1, 1, "", methodObject ),
new Among ( "ion", -1, 2, "", methodObject ),
new Among ( "er", -1, 1, "", methodObject ),
new Among ( "ous", -1, 1, "", methodObject ),
new Among ( "ant", -1, 1, "", methodObject ),
new Among ( "ent", -1, 1, "", methodObject ),
new Among ( "ment", 15, 1, "", methodObject ),
new Among ( "ement", 16, 1, "", methodObject ),
new Among ( "ou", -1, 1, "", methodObject )
};
private static final char g_v[] = {17, 65, 16, 1 };
private static final char g_v_WXY[] = {1, 17, 65, 208, 1 };
private boolean B_Y_found;
private int I_p2;
private int I_p1;
private void copy_from(porterStemmer other) {
B_Y_found = other.B_Y_found;
I_p2 = other.I_p2;
I_p1 = other.I_p1;
super.copy_from(other);
}
private boolean r_shortv() {
// (, line 19
if (!(out_grouping_b(g_v_WXY, 89, 121)))
{
return false;
}
if (!(in_grouping_b(g_v, 97, 121)))
{
return false;
}
if (!(out_grouping_b(g_v, 97, 121)))
{
return false;
}
return true;
}
private boolean r_R1() {
if (!(I_p1 <= cursor))
{
return false;
}
return true;
}
private boolean r_R2() {
if (!(I_p2 <= cursor))
{
return false;
}
return true;
}
private boolean r_Step_1a() {
int among_var;
// (, line 24
// [, line 25
ket = cursor;
// substring, line 25
among_var = find_among_b(a_0, 4);
if (among_var == 0)
{
return false;
}
// ], line 25
bra = cursor;
switch(among_var) {
case 0:
return false;
case 1:
// (, line 26
// <-, line 26
slice_from("ss");
break;
case 2:
// (, line 27
// <-, line 27
slice_from("i");
break;
case 3:
// (, line 29
// delete, line 29
slice_del();
break;
}
return true;
}
private boolean r_Step_1b() {
int among_var;
int v_1;
int v_3;
int v_4;
// (, line 33
// [, line 34
ket = cursor;
// substring, line 34
among_var = find_among_b(a_2, 3);
if (among_var == 0)
{
return false;
}
// ], line 34
bra = cursor;
switch(among_var) {
case 0:
return false;
case 1:
// (, line 35
// call R1, line 35
if (!r_R1())
{
return false;
}
// <-, line 35
slice_from("ee");
break;
case 2:
// (, line 37
// test, line 38
v_1 = limit - cursor;
// gopast, line 38
golab0: while(true)
{
lab1: do {
if (!(in_grouping_b(g_v, 97, 121)))
{
break lab1;
}
break golab0;
} while (false);
if (cursor <= limit_backward)
{
return false;
}
cursor--;
}
cursor = limit - v_1;
// delete, line 38
slice_del();
// test, line 39
v_3 = limit - cursor;
// substring, line 39
among_var = find_among_b(a_1, 13);
if (among_var == 0)
{
return false;
}
cursor = limit - v_3;
switch(among_var) {
case 0:
return false;
case 1:
// (, line 41
// <+, line 41
{
int c = cursor;
insert(cursor, cursor, "e");
cursor = c;
}
break;
case 2:
// (, line 44
// [, line 44
ket = cursor;
// next, line 44
if (cursor <= limit_backward)
{
return false;
}
cursor--;
// ], line 44
bra = cursor;
// delete, line 44
slice_del();
break;
case 3:
// (, line 45
// atmark, line 45
if (cursor != I_p1)
{
return false;
}
// test, line 45
v_4 = limit - cursor;
// call shortv, line 45
if (!r_shortv())
{
return false;
}
cursor = limit - v_4;
// <+, line 45
{
int c = cursor;
insert(cursor, cursor, "e");
cursor = c;
}
break;
}
break;
}
return true;
}
private boolean r_Step_1c() {
int v_1;
// (, line 51
// [, line 52
ket = cursor;
// or, line 52
lab0: do {
v_1 = limit - cursor;
lab1: do {
// literal, line 52
if (!(eq_s_b(1, "y")))
{
break lab1;
}
break lab0;
} while (false);
cursor = limit - v_1;
// literal, line 52
if (!(eq_s_b(1, "Y")))
{
return false;
}
} while (false);
// ], line 52
bra = cursor;
// gopast, line 53
golab2: while(true)
{
lab3: do {
if (!(in_grouping_b(g_v, 97, 121)))
{
break lab3;
}
break golab2;
} while (false);
if (cursor <= limit_backward)
{
return false;
}
cursor--;
}
// <-, line 54
slice_from("i");
return true;
}
private boolean r_Step_2() {
int among_var;
// (, line 57
// [, line 58
ket = cursor;
// substring, line 58
among_var = find_among_b(a_3, 20);
if (among_var == 0)
{
return false;
}
// ], line 58
bra = cursor;
// call R1, line 58
if (!r_R1())
{
return false;
}
switch(among_var) {
case 0:
return false;
case 1:
// (, line 59
// <-, line 59
slice_from("tion");
break;
case 2:
// (, line 60
// <-, line 60
slice_from("ence");
break;
case 3:
// (, line 61
// <-, line 61
slice_from("ance");
break;
case 4:
// (, line 62
// <-, line 62
slice_from("able");
break;
case 5:
// (, line 63
// <-, line 63
slice_from("ent");
break;
case 6:
// (, line 64
// <-, line 64
slice_from("e");
break;
case 7:
// (, line 66
// <-, line 66
slice_from("ize");
break;
case 8:
// (, line 68
// <-, line 68
slice_from("ate");
break;
case 9:
// (, line 69
// <-, line 69
slice_from("al");
break;
case 10:
// (, line 71
// <-, line 71
slice_from("al");
break;
case 11:
// (, line 72
// <-, line 72
slice_from("ful");
break;
case 12:
// (, line 74
// <-, line 74
slice_from("ous");
break;
case 13:
// (, line 76
// <-, line 76
slice_from("ive");
break;
case 14:
// (, line 77
// <-, line 77
slice_from("ble");
break;
}
return true;
}
private boolean r_Step_3() {
int among_var;
// (, line 81
// [, line 82
ket = cursor;
// substring, line 82
among_var = find_among_b(a_4, 7);
if (among_var == 0)
{
return false;
}
// ], line 82
bra = cursor;
// call R1, line 82
if (!r_R1())
{
return false;
}
switch(among_var) {
case 0:
return false;
case 1:
// (, line 83
// <-, line 83
slice_from("al");
break;
case 2:
// (, line 85
// <-, line 85
slice_from("ic");
break;
case 3:
// (, line 87
// delete, line 87
slice_del();
break;
}
return true;
}
private boolean r_Step_4() {
int among_var;
int v_1;
// (, line 91
// [, line 92
ket = cursor;
// substring, line 92
among_var = find_among_b(a_5, 19);
if (among_var == 0)
{
return false;
}
// ], line 92
bra = cursor;
// call R2, line 92
if (!r_R2())
{
return false;
}
switch(among_var) {
case 0:
return false;
case 1:
// (, line 95
// delete, line 95
slice_del();
break;
case 2:
// (, line 96
// or, line 96
lab0: do {
v_1 = limit - cursor;
lab1: do {
// literal, line 96
if (!(eq_s_b(1, "s")))
{
break lab1;
}
break lab0;
} while (false);
cursor = limit - v_1;
// literal, line 96
if (!(eq_s_b(1, "t")))
{
return false;
}
} while (false);
// delete, line 96
slice_del();
break;
}
return true;
}
private boolean r_Step_5a() {
int v_1;
int v_2;
// (, line 100
// [, line 101
ket = cursor;
// literal, line 101
if (!(eq_s_b(1, "e")))
{
return false;
}
// ], line 101
bra = cursor;
// or, line 102
lab0: do {
v_1 = limit - cursor;
lab1: do {
// call R2, line 102
if (!r_R2())
{
break lab1;
}
break lab0;
} while (false);
cursor = limit - v_1;
// (, line 102
// call R1, line 102
if (!r_R1())
{
return false;
}
// not, line 102
{
v_2 = limit - cursor;
lab2: do {
// call shortv, line 102
if (!r_shortv())
{
break lab2;
}
return false;
} while (false);
cursor = limit - v_2;
}
} while (false);
// delete, line 103
slice_del();
return true;
}
private boolean r_Step_5b() {
// (, line 106
// [, line 107
ket = cursor;
// literal, line 107
if (!(eq_s_b(1, "l")))
{
return false;
}
// ], line 107
bra = cursor;
// call R2, line 108
if (!r_R2())
{
return false;
}
// literal, line 108
if (!(eq_s_b(1, "l")))
{
return false;
}
// delete, line 109
slice_del();
return true;
}
public boolean stem() {
int v_1;
int v_2;
int v_3;
int v_4;
int v_5;
int v_10;
int v_11;
int v_12;
int v_13;
int v_14;
int v_15;
int v_16;
int v_17;
int v_18;
int v_19;
int v_20;
// (, line 113
// unset Y_found, line 115
B_Y_found = false;
// do, line 116
v_1 = cursor;
lab0: do {
// (, line 116
// [, line 116
bra = cursor;
// literal, line 116
if (!(eq_s(1, "y")))
{
break lab0;
}
// ], line 116
ket = cursor;
// <-, line 116
slice_from("Y");
// set Y_found, line 116
B_Y_found = true;
} while (false);
cursor = v_1;
// do, line 117
v_2 = cursor;
lab1: do {
// repeat, line 117
replab2: while(true)
{
v_3 = cursor;
lab3: do {
// (, line 117
// goto, line 117
golab4: while(true)
{
v_4 = cursor;
lab5: do {
// (, line 117
if (!(in_grouping(g_v, 97, 121)))
{
break lab5;
}
// [, line 117
bra = cursor;
// literal, line 117
if (!(eq_s(1, "y")))
{
break lab5;
}
// ], line 117
ket = cursor;
cursor = v_4;
break golab4;
} while (false);
cursor = v_4;
if (cursor >= limit)
{
break lab3;
}
cursor++;
}
// <-, line 117
slice_from("Y");
// set Y_found, line 117
B_Y_found = true;
continue replab2;
} while (false);
cursor = v_3;
break replab2;
}
} while (false);
cursor = v_2;
I_p1 = limit;
I_p2 = limit;
// do, line 121
v_5 = cursor;
lab6: do {
// (, line 121
// gopast, line 122
golab7: while(true)
{
lab8: do {
if (!(in_grouping(g_v, 97, 121)))
{
break lab8;
}
break golab7;
} while (false);
if (cursor >= limit)
{
break lab6;
}
cursor++;
}
// gopast, line 122
golab9: while(true)
{
lab10: do {
if (!(out_grouping(g_v, 97, 121)))
{
break lab10;
}
break golab9;
} while (false);
if (cursor >= limit)
{
break lab6;
}
cursor++;
}
// setmark p1, line 122
I_p1 = cursor;
// gopast, line 123
golab11: while(true)
{
lab12: do {
if (!(in_grouping(g_v, 97, 121)))
{
break lab12;
}
break golab11;
} while (false);
if (cursor >= limit)
{
break lab6;
}
cursor++;
}
// gopast, line 123
golab13: while(true)
{
lab14: do {
if (!(out_grouping(g_v, 97, 121)))
{
break lab14;
}
break golab13;
} while (false);
if (cursor >= limit)
{
break lab6;
}
cursor++;
}
// setmark p2, line 123
I_p2 = cursor;
} while (false);
cursor = v_5;
// backwards, line 126
limit_backward = cursor; cursor = limit;
// (, line 126
// do, line 127
v_10 = limit - cursor;
lab15: do {
// call Step_1a, line 127
if (!r_Step_1a())
{
break lab15;
}
} while (false);
cursor = limit - v_10;
// do, line 128
v_11 = limit - cursor;
lab16: do {
// call Step_1b, line 128
if (!r_Step_1b())
{
break lab16;
}
} while (false);
cursor = limit - v_11;
// do, line 129
v_12 = limit - cursor;
lab17: do {
// call Step_1c, line 129
if (!r_Step_1c())
{
break lab17;
}
} while (false);
cursor = limit - v_12;
// do, line 130
v_13 = limit - cursor;
lab18: do {
// call Step_2, line 130
if (!r_Step_2())
{
break lab18;
}
} while (false);
cursor = limit - v_13;
// do, line 131
v_14 = limit - cursor;
lab19: do {
// call Step_3, line 131
if (!r_Step_3())
{
break lab19;
}
} while (false);
cursor = limit - v_14;
// do, line 132
v_15 = limit - cursor;
lab20: do {
// call Step_4, line 132
if (!r_Step_4())
{
break lab20;
}
} while (false);
cursor = limit - v_15;
// do, line 133
v_16 = limit - cursor;
lab21: do {
// call Step_5a, line 133
if (!r_Step_5a())
{
break lab21;
}
} while (false);
cursor = limit - v_16;
// do, line 134
v_17 = limit - cursor;
lab22: do {
// call Step_5b, line 134
if (!r_Step_5b())
{
break lab22;
}
} while (false);
cursor = limit - v_17;
cursor = limit_backward; // do, line 137
v_18 = cursor;
lab23: do {
// (, line 137
// Boolean test Y_found, line 137
if (!(B_Y_found))
{
break lab23;
}
// repeat, line 137
replab24: while(true)
{
v_19 = cursor;
lab25: do {
// (, line 137
// goto, line 137
golab26: while(true)
{
v_20 = cursor;
lab27: do {
// (, line 137
// [, line 137
bra = cursor;
// literal, line 137
if (!(eq_s(1, "Y")))
{
break lab27;
}
// ], line 137
ket = cursor;
cursor = v_20;
break golab26;
} while (false);
cursor = v_20;
if (cursor >= limit)
{
break lab25;
}
cursor++;
}
// <-, line 137
slice_from("y");
continue replab24;
} while (false);
cursor = v_19;
break replab24;
}
} while (false);
cursor = v_18;
return true;
}
public boolean equals( Object o ) {
return o instanceof porterStemmer;
}
public int hashCode() {
return porterStemmer.class.getName().hashCode();
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/stemmer
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/stemmer/snowball/portugueseStemmer.java
|
// CHECKSTYLE:OFF
/*
Copyright (c) 2001, Dr Martin Porter
Copyright (c) 2002, Richard Boulton
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* Neither the name of the copyright holders nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
// This file was generated automatically by the Snowball to Java compiler
package opennlp.tools.stemmer.snowball;
/**
* This class was automatically generated by a Snowball to Java compiler
* It implements the stemming algorithm defined by a snowball script.
*/
class portugueseStemmer extends opennlp.tools.stemmer.snowball.AbstractSnowballStemmer {
private final static portugueseStemmer methodObject = new portugueseStemmer ();
private final static Among a_0[] = {
new Among ( "", -1, 3, "", methodObject ),
new Among ( "\u00E3", 0, 1, "", methodObject ),
new Among ( "\u00F5", 0, 2, "", methodObject )
};
private final static Among a_1[] = {
new Among ( "", -1, 3, "", methodObject ),
new Among ( "a~", 0, 1, "", methodObject ),
new Among ( "o~", 0, 2, "", methodObject )
};
private final static Among a_2[] = {
new Among ( "ic", -1, -1, "", methodObject ),
new Among ( "ad", -1, -1, "", methodObject ),
new Among ( "os", -1, -1, "", methodObject ),
new Among ( "iv", -1, 1, "", methodObject )
};
private final static Among a_3[] = {
new Among ( "ante", -1, 1, "", methodObject ),
new Among ( "avel", -1, 1, "", methodObject ),
new Among ( "\u00EDvel", -1, 1, "", methodObject )
};
private final static Among a_4[] = {
new Among ( "ic", -1, 1, "", methodObject ),
new Among ( "abil", -1, 1, "", methodObject ),
new Among ( "iv", -1, 1, "", methodObject )
};
private final static Among a_5[] = {
new Among ( "ica", -1, 1, "", methodObject ),
new Among ( "\u00E2ncia", -1, 1, "", methodObject ),
new Among ( "\u00EAncia", -1, 4, "", methodObject ),
new Among ( "ira", -1, 9, "", methodObject ),
new Among ( "adora", -1, 1, "", methodObject ),
new Among ( "osa", -1, 1, "", methodObject ),
new Among ( "ista", -1, 1, "", methodObject ),
new Among ( "iva", -1, 8, "", methodObject ),
new Among ( "eza", -1, 1, "", methodObject ),
new Among ( "log\u00EDa", -1, 2, "", methodObject ),
new Among ( "idade", -1, 7, "", methodObject ),
new Among ( "ante", -1, 1, "", methodObject ),
new Among ( "mente", -1, 6, "", methodObject ),
new Among ( "amente", 12, 5, "", methodObject ),
new Among ( "\u00E1vel", -1, 1, "", methodObject ),
new Among ( "\u00EDvel", -1, 1, "", methodObject ),
new Among ( "uci\u00F3n", -1, 3, "", methodObject ),
new Among ( "ico", -1, 1, "", methodObject ),
new Among ( "ismo", -1, 1, "", methodObject ),
new Among ( "oso", -1, 1, "", methodObject ),
new Among ( "amento", -1, 1, "", methodObject ),
new Among ( "imento", -1, 1, "", methodObject ),
new Among ( "ivo", -1, 8, "", methodObject ),
new Among ( "a\u00E7a~o", -1, 1, "", methodObject ),
new Among ( "ador", -1, 1, "", methodObject ),
new Among ( "icas", -1, 1, "", methodObject ),
new Among ( "\u00EAncias", -1, 4, "", methodObject ),
new Among ( "iras", -1, 9, "", methodObject ),
new Among ( "adoras", -1, 1, "", methodObject ),
new Among ( "osas", -1, 1, "", methodObject ),
new Among ( "istas", -1, 1, "", methodObject ),
new Among ( "ivas", -1, 8, "", methodObject ),
new Among ( "ezas", -1, 1, "", methodObject ),
new Among ( "log\u00EDas", -1, 2, "", methodObject ),
new Among ( "idades", -1, 7, "", methodObject ),
new Among ( "uciones", -1, 3, "", methodObject ),
new Among ( "adores", -1, 1, "", methodObject ),
new Among ( "antes", -1, 1, "", methodObject ),
new Among ( "a\u00E7o~es", -1, 1, "", methodObject ),
new Among ( "icos", -1, 1, "", methodObject ),
new Among ( "ismos", -1, 1, "", methodObject ),
new Among ( "osos", -1, 1, "", methodObject ),
new Among ( "amentos", -1, 1, "", methodObject ),
new Among ( "imentos", -1, 1, "", methodObject ),
new Among ( "ivos", -1, 8, "", methodObject )
};
private final static Among a_6[] = {
new Among ( "ada", -1, 1, "", methodObject ),
new Among ( "ida", -1, 1, "", methodObject ),
new Among ( "ia", -1, 1, "", methodObject ),
new Among ( "aria", 2, 1, "", methodObject ),
new Among ( "eria", 2, 1, "", methodObject ),
new Among ( "iria", 2, 1, "", methodObject ),
new Among ( "ara", -1, 1, "", methodObject ),
new Among ( "era", -1, 1, "", methodObject ),
new Among ( "ira", -1, 1, "", methodObject ),
new Among ( "ava", -1, 1, "", methodObject ),
new Among ( "asse", -1, 1, "", methodObject ),
new Among ( "esse", -1, 1, "", methodObject ),
new Among ( "isse", -1, 1, "", methodObject ),
new Among ( "aste", -1, 1, "", methodObject ),
new Among ( "este", -1, 1, "", methodObject ),
new Among ( "iste", -1, 1, "", methodObject ),
new Among ( "ei", -1, 1, "", methodObject ),
new Among ( "arei", 16, 1, "", methodObject ),
new Among ( "erei", 16, 1, "", methodObject ),
new Among ( "irei", 16, 1, "", methodObject ),
new Among ( "am", -1, 1, "", methodObject ),
new Among ( "iam", 20, 1, "", methodObject ),
new Among ( "ariam", 21, 1, "", methodObject ),
new Among ( "eriam", 21, 1, "", methodObject ),
new Among ( "iriam", 21, 1, "", methodObject ),
new Among ( "aram", 20, 1, "", methodObject ),
new Among ( "eram", 20, 1, "", methodObject ),
new Among ( "iram", 20, 1, "", methodObject ),
new Among ( "avam", 20, 1, "", methodObject ),
new Among ( "em", -1, 1, "", methodObject ),
new Among ( "arem", 29, 1, "", methodObject ),
new Among ( "erem", 29, 1, "", methodObject ),
new Among ( "irem", 29, 1, "", methodObject ),
new Among ( "assem", 29, 1, "", methodObject ),
new Among ( "essem", 29, 1, "", methodObject ),
new Among ( "issem", 29, 1, "", methodObject ),
new Among ( "ado", -1, 1, "", methodObject ),
new Among ( "ido", -1, 1, "", methodObject ),
new Among ( "ando", -1, 1, "", methodObject ),
new Among ( "endo", -1, 1, "", methodObject ),
new Among ( "indo", -1, 1, "", methodObject ),
new Among ( "ara~o", -1, 1, "", methodObject ),
new Among ( "era~o", -1, 1, "", methodObject ),
new Among ( "ira~o", -1, 1, "", methodObject ),
new Among ( "ar", -1, 1, "", methodObject ),
new Among ( "er", -1, 1, "", methodObject ),
new Among ( "ir", -1, 1, "", methodObject ),
new Among ( "as", -1, 1, "", methodObject ),
new Among ( "adas", 47, 1, "", methodObject ),
new Among ( "idas", 47, 1, "", methodObject ),
new Among ( "ias", 47, 1, "", methodObject ),
new Among ( "arias", 50, 1, "", methodObject ),
new Among ( "erias", 50, 1, "", methodObject ),
new Among ( "irias", 50, 1, "", methodObject ),
new Among ( "aras", 47, 1, "", methodObject ),
new Among ( "eras", 47, 1, "", methodObject ),
new Among ( "iras", 47, 1, "", methodObject ),
new Among ( "avas", 47, 1, "", methodObject ),
new Among ( "es", -1, 1, "", methodObject ),
new Among ( "ardes", 58, 1, "", methodObject ),
new Among ( "erdes", 58, 1, "", methodObject ),
new Among ( "irdes", 58, 1, "", methodObject ),
new Among ( "ares", 58, 1, "", methodObject ),
new Among ( "eres", 58, 1, "", methodObject ),
new Among ( "ires", 58, 1, "", methodObject ),
new Among ( "asses", 58, 1, "", methodObject ),
new Among ( "esses", 58, 1, "", methodObject ),
new Among ( "isses", 58, 1, "", methodObject ),
new Among ( "astes", 58, 1, "", methodObject ),
new Among ( "estes", 58, 1, "", methodObject ),
new Among ( "istes", 58, 1, "", methodObject ),
new Among ( "is", -1, 1, "", methodObject ),
new Among ( "ais", 71, 1, "", methodObject ),
new Among ( "eis", 71, 1, "", methodObject ),
new Among ( "areis", 73, 1, "", methodObject ),
new Among ( "ereis", 73, 1, "", methodObject ),
new Among ( "ireis", 73, 1, "", methodObject ),
new Among ( "\u00E1reis", 73, 1, "", methodObject ),
new Among ( "\u00E9reis", 73, 1, "", methodObject ),
new Among ( "\u00EDreis", 73, 1, "", methodObject ),
new Among ( "\u00E1sseis", 73, 1, "", methodObject ),
new Among ( "\u00E9sseis", 73, 1, "", methodObject ),
new Among ( "\u00EDsseis", 73, 1, "", methodObject ),
new Among ( "\u00E1veis", 73, 1, "", methodObject ),
new Among ( "\u00EDeis", 73, 1, "", methodObject ),
new Among ( "ar\u00EDeis", 84, 1, "", methodObject ),
new Among ( "er\u00EDeis", 84, 1, "", methodObject ),
new Among ( "ir\u00EDeis", 84, 1, "", methodObject ),
new Among ( "ados", -1, 1, "", methodObject ),
new Among ( "idos", -1, 1, "", methodObject ),
new Among ( "amos", -1, 1, "", methodObject ),
new Among ( "\u00E1ramos", 90, 1, "", methodObject ),
new Among ( "\u00E9ramos", 90, 1, "", methodObject ),
new Among ( "\u00EDramos", 90, 1, "", methodObject ),
new Among ( "\u00E1vamos", 90, 1, "", methodObject ),
new Among ( "\u00EDamos", 90, 1, "", methodObject ),
new Among ( "ar\u00EDamos", 95, 1, "", methodObject ),
new Among ( "er\u00EDamos", 95, 1, "", methodObject ),
new Among ( "ir\u00EDamos", 95, 1, "", methodObject ),
new Among ( "emos", -1, 1, "", methodObject ),
new Among ( "aremos", 99, 1, "", methodObject ),
new Among ( "eremos", 99, 1, "", methodObject ),
new Among ( "iremos", 99, 1, "", methodObject ),
new Among ( "\u00E1ssemos", 99, 1, "", methodObject ),
new Among ( "\u00EAssemos", 99, 1, "", methodObject ),
new Among ( "\u00EDssemos", 99, 1, "", methodObject ),
new Among ( "imos", -1, 1, "", methodObject ),
new Among ( "armos", -1, 1, "", methodObject ),
new Among ( "ermos", -1, 1, "", methodObject ),
new Among ( "irmos", -1, 1, "", methodObject ),
new Among ( "\u00E1mos", -1, 1, "", methodObject ),
new Among ( "ar\u00E1s", -1, 1, "", methodObject ),
new Among ( "er\u00E1s", -1, 1, "", methodObject ),
new Among ( "ir\u00E1s", -1, 1, "", methodObject ),
new Among ( "eu", -1, 1, "", methodObject ),
new Among ( "iu", -1, 1, "", methodObject ),
new Among ( "ou", -1, 1, "", methodObject ),
new Among ( "ar\u00E1", -1, 1, "", methodObject ),
new Among ( "er\u00E1", -1, 1, "", methodObject ),
new Among ( "ir\u00E1", -1, 1, "", methodObject )
};
private final static Among a_7[] = {
new Among ( "a", -1, 1, "", methodObject ),
new Among ( "i", -1, 1, "", methodObject ),
new Among ( "o", -1, 1, "", methodObject ),
new Among ( "os", -1, 1, "", methodObject ),
new Among ( "\u00E1", -1, 1, "", methodObject ),
new Among ( "\u00ED", -1, 1, "", methodObject ),
new Among ( "\u00F3", -1, 1, "", methodObject )
};
private final static Among a_8[] = {
new Among ( "e", -1, 1, "", methodObject ),
new Among ( "\u00E7", -1, 2, "", methodObject ),
new Among ( "\u00E9", -1, 1, "", methodObject ),
new Among ( "\u00EA", -1, 1, "", methodObject )
};
private static final char g_v[] = {17, 65, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 19, 12, 2 };
private int I_p2;
private int I_p1;
private int I_pV;
private void copy_from(portugueseStemmer other) {
I_p2 = other.I_p2;
I_p1 = other.I_p1;
I_pV = other.I_pV;
super.copy_from(other);
}
private boolean r_prelude() {
int among_var;
int v_1;
// repeat, line 36
replab0: while(true)
{
v_1 = cursor;
lab1: do {
// (, line 36
// [, line 37
bra = cursor;
// substring, line 37
among_var = find_among(a_0, 3);
if (among_var == 0)
{
break lab1;
}
// ], line 37
ket = cursor;
switch(among_var) {
case 0:
break lab1;
case 1:
// (, line 38
// <-, line 38
slice_from("a~");
break;
case 2:
// (, line 39
// <-, line 39
slice_from("o~");
break;
case 3:
// (, line 40
// next, line 40
if (cursor >= limit)
{
break lab1;
}
cursor++;
break;
}
continue replab0;
} while (false);
cursor = v_1;
break replab0;
}
return true;
}
private boolean r_mark_regions() {
int v_1;
int v_2;
int v_3;
int v_6;
int v_8;
// (, line 44
I_pV = limit;
I_p1 = limit;
I_p2 = limit;
// do, line 50
v_1 = cursor;
lab0: do {
// (, line 50
// or, line 52
lab1: do {
v_2 = cursor;
lab2: do {
// (, line 51
if (!(in_grouping(g_v, 97, 250)))
{
break lab2;
}
// or, line 51
lab3: do {
v_3 = cursor;
lab4: do {
// (, line 51
if (!(out_grouping(g_v, 97, 250)))
{
break lab4;
}
// gopast, line 51
golab5: while(true)
{
lab6: do {
if (!(in_grouping(g_v, 97, 250)))
{
break lab6;
}
break golab5;
} while (false);
if (cursor >= limit)
{
break lab4;
}
cursor++;
}
break lab3;
} while (false);
cursor = v_3;
// (, line 51
if (!(in_grouping(g_v, 97, 250)))
{
break lab2;
}
// gopast, line 51
golab7: while(true)
{
lab8: do {
if (!(out_grouping(g_v, 97, 250)))
{
break lab8;
}
break golab7;
} while (false);
if (cursor >= limit)
{
break lab2;
}
cursor++;
}
} while (false);
break lab1;
} while (false);
cursor = v_2;
// (, line 53
if (!(out_grouping(g_v, 97, 250)))
{
break lab0;
}
// or, line 53
lab9: do {
v_6 = cursor;
lab10: do {
// (, line 53
if (!(out_grouping(g_v, 97, 250)))
{
break lab10;
}
// gopast, line 53
golab11: while(true)
{
lab12: do {
if (!(in_grouping(g_v, 97, 250)))
{
break lab12;
}
break golab11;
} while (false);
if (cursor >= limit)
{
break lab10;
}
cursor++;
}
break lab9;
} while (false);
cursor = v_6;
// (, line 53
if (!(in_grouping(g_v, 97, 250)))
{
break lab0;
}
// next, line 53
if (cursor >= limit)
{
break lab0;
}
cursor++;
} while (false);
} while (false);
// setmark pV, line 54
I_pV = cursor;
} while (false);
cursor = v_1;
// do, line 56
v_8 = cursor;
lab13: do {
// (, line 56
// gopast, line 57
golab14: while(true)
{
lab15: do {
if (!(in_grouping(g_v, 97, 250)))
{
break lab15;
}
break golab14;
} while (false);
if (cursor >= limit)
{
break lab13;
}
cursor++;
}
// gopast, line 57
golab16: while(true)
{
lab17: do {
if (!(out_grouping(g_v, 97, 250)))
{
break lab17;
}
break golab16;
} while (false);
if (cursor >= limit)
{
break lab13;
}
cursor++;
}
// setmark p1, line 57
I_p1 = cursor;
// gopast, line 58
golab18: while(true)
{
lab19: do {
if (!(in_grouping(g_v, 97, 250)))
{
break lab19;
}
break golab18;
} while (false);
if (cursor >= limit)
{
break lab13;
}
cursor++;
}
// gopast, line 58
golab20: while(true)
{
lab21: do {
if (!(out_grouping(g_v, 97, 250)))
{
break lab21;
}
break golab20;
} while (false);
if (cursor >= limit)
{
break lab13;
}
cursor++;
}
// setmark p2, line 58
I_p2 = cursor;
} while (false);
cursor = v_8;
return true;
}
private boolean r_postlude() {
int among_var;
int v_1;
// repeat, line 62
replab0: while(true)
{
v_1 = cursor;
lab1: do {
// (, line 62
// [, line 63
bra = cursor;
// substring, line 63
among_var = find_among(a_1, 3);
if (among_var == 0)
{
break lab1;
}
// ], line 63
ket = cursor;
switch(among_var) {
case 0:
break lab1;
case 1:
// (, line 64
// <-, line 64
slice_from("\u00E3");
break;
case 2:
// (, line 65
// <-, line 65
slice_from("\u00F5");
break;
case 3:
// (, line 66
// next, line 66
if (cursor >= limit)
{
break lab1;
}
cursor++;
break;
}
continue replab0;
} while (false);
cursor = v_1;
break replab0;
}
return true;
}
private boolean r_RV() {
if (!(I_pV <= cursor))
{
return false;
}
return true;
}
private boolean r_R1() {
if (!(I_p1 <= cursor))
{
return false;
}
return true;
}
private boolean r_R2() {
if (!(I_p2 <= cursor))
{
return false;
}
return true;
}
private boolean r_standard_suffix() {
int among_var;
int v_1;
int v_2;
int v_3;
int v_4;
// (, line 76
// [, line 77
ket = cursor;
// substring, line 77
among_var = find_among_b(a_5, 45);
if (among_var == 0)
{
return false;
}
// ], line 77
bra = cursor;
switch(among_var) {
case 0:
return false;
case 1:
// (, line 92
// call R2, line 93
if (!r_R2())
{
return false;
}
// delete, line 93
slice_del();
break;
case 2:
// (, line 97
// call R2, line 98
if (!r_R2())
{
return false;
}
// <-, line 98
slice_from("log");
break;
case 3:
// (, line 101
// call R2, line 102
if (!r_R2())
{
return false;
}
// <-, line 102
slice_from("u");
break;
case 4:
// (, line 105
// call R2, line 106
if (!r_R2())
{
return false;
}
// <-, line 106
slice_from("ente");
break;
case 5:
// (, line 109
// call R1, line 110
if (!r_R1())
{
return false;
}
// delete, line 110
slice_del();
// try, line 111
v_1 = limit - cursor;
lab0: do {
// (, line 111
// [, line 112
ket = cursor;
// substring, line 112
among_var = find_among_b(a_2, 4);
if (among_var == 0)
{
cursor = limit - v_1;
break lab0;
}
// ], line 112
bra = cursor;
// call R2, line 112
if (!r_R2())
{
cursor = limit - v_1;
break lab0;
}
// delete, line 112
slice_del();
switch(among_var) {
case 0:
cursor = limit - v_1;
break lab0;
case 1:
// (, line 113
// [, line 113
ket = cursor;
// literal, line 113
if (!(eq_s_b(2, "at")))
{
cursor = limit - v_1;
break lab0;
}
// ], line 113
bra = cursor;
// call R2, line 113
if (!r_R2())
{
cursor = limit - v_1;
break lab0;
}
// delete, line 113
slice_del();
break;
}
} while (false);
break;
case 6:
// (, line 121
// call R2, line 122
if (!r_R2())
{
return false;
}
// delete, line 122
slice_del();
// try, line 123
v_2 = limit - cursor;
lab1: do {
// (, line 123
// [, line 124
ket = cursor;
// substring, line 124
among_var = find_among_b(a_3, 3);
if (among_var == 0)
{
cursor = limit - v_2;
break lab1;
}
// ], line 124
bra = cursor;
switch(among_var) {
case 0:
cursor = limit - v_2;
break lab1;
case 1:
// (, line 127
// call R2, line 127
if (!r_R2())
{
cursor = limit - v_2;
break lab1;
}
// delete, line 127
slice_del();
break;
}
} while (false);
break;
case 7:
// (, line 133
// call R2, line 134
if (!r_R2())
{
return false;
}
// delete, line 134
slice_del();
// try, line 135
v_3 = limit - cursor;
lab2: do {
// (, line 135
// [, line 136
ket = cursor;
// substring, line 136
among_var = find_among_b(a_4, 3);
if (among_var == 0)
{
cursor = limit - v_3;
break lab2;
}
// ], line 136
bra = cursor;
switch(among_var) {
case 0:
cursor = limit - v_3;
break lab2;
case 1:
// (, line 139
// call R2, line 139
if (!r_R2())
{
cursor = limit - v_3;
break lab2;
}
// delete, line 139
slice_del();
break;
}
} while (false);
break;
case 8:
// (, line 145
// call R2, line 146
if (!r_R2())
{
return false;
}
// delete, line 146
slice_del();
// try, line 147
v_4 = limit - cursor;
lab3: do {
// (, line 147
// [, line 148
ket = cursor;
// literal, line 148
if (!(eq_s_b(2, "at")))
{
cursor = limit - v_4;
break lab3;
}
// ], line 148
bra = cursor;
// call R2, line 148
if (!r_R2())
{
cursor = limit - v_4;
break lab3;
}
// delete, line 148
slice_del();
} while (false);
break;
case 9:
// (, line 152
// call RV, line 153
if (!r_RV())
{
return false;
}
// literal, line 153
if (!(eq_s_b(1, "e")))
{
return false;
}
// <-, line 154
slice_from("ir");
break;
}
return true;
}
private boolean r_verb_suffix() {
int among_var;
int v_1;
int v_2;
// setlimit, line 159
v_1 = limit - cursor;
// tomark, line 159
if (cursor < I_pV)
{
return false;
}
cursor = I_pV;
v_2 = limit_backward;
limit_backward = cursor;
cursor = limit - v_1;
// (, line 159
// [, line 160
ket = cursor;
// substring, line 160
among_var = find_among_b(a_6, 120);
if (among_var == 0)
{
limit_backward = v_2;
return false;
}
// ], line 160
bra = cursor;
switch(among_var) {
case 0:
limit_backward = v_2;
return false;
case 1:
// (, line 179
// delete, line 179
slice_del();
break;
}
limit_backward = v_2;
return true;
}
private boolean r_residual_suffix() {
int among_var;
// (, line 183
// [, line 184
ket = cursor;
// substring, line 184
among_var = find_among_b(a_7, 7);
if (among_var == 0)
{
return false;
}
// ], line 184
bra = cursor;
switch(among_var) {
case 0:
return false;
case 1:
// (, line 187
// call RV, line 187
if (!r_RV())
{
return false;
}
// delete, line 187
slice_del();
break;
}
return true;
}
private boolean r_residual_form() {
int among_var;
int v_1;
int v_2;
int v_3;
// (, line 191
// [, line 192
ket = cursor;
// substring, line 192
among_var = find_among_b(a_8, 4);
if (among_var == 0)
{
return false;
}
// ], line 192
bra = cursor;
switch(among_var) {
case 0:
return false;
case 1:
// (, line 194
// call RV, line 194
if (!r_RV())
{
return false;
}
// delete, line 194
slice_del();
// [, line 194
ket = cursor;
// or, line 194
lab0: do {
v_1 = limit - cursor;
lab1: do {
// (, line 194
// literal, line 194
if (!(eq_s_b(1, "u")))
{
break lab1;
}
// ], line 194
bra = cursor;
// test, line 194
v_2 = limit - cursor;
// literal, line 194
if (!(eq_s_b(1, "g")))
{
break lab1;
}
cursor = limit - v_2;
break lab0;
} while (false);
cursor = limit - v_1;
// (, line 195
// literal, line 195
if (!(eq_s_b(1, "i")))
{
return false;
}
// ], line 195
bra = cursor;
// test, line 195
v_3 = limit - cursor;
// literal, line 195
if (!(eq_s_b(1, "c")))
{
return false;
}
cursor = limit - v_3;
} while (false);
// call RV, line 195
if (!r_RV())
{
return false;
}
// delete, line 195
slice_del();
break;
case 2:
// (, line 196
// <-, line 196
slice_from("c");
break;
}
return true;
}
public boolean stem() {
int v_1;
int v_2;
int v_3;
int v_4;
int v_5;
int v_6;
int v_7;
int v_8;
int v_9;
int v_10;
// (, line 201
// do, line 202
v_1 = cursor;
lab0: do {
// call prelude, line 202
if (!r_prelude())
{
break lab0;
}
} while (false);
cursor = v_1;
// do, line 203
v_2 = cursor;
lab1: do {
// call mark_regions, line 203
if (!r_mark_regions())
{
break lab1;
}
} while (false);
cursor = v_2;
// backwards, line 204
limit_backward = cursor; cursor = limit;
// (, line 204
// do, line 205
v_3 = limit - cursor;
lab2: do {
// (, line 205
// or, line 209
lab3: do {
v_4 = limit - cursor;
lab4: do {
// (, line 206
// and, line 207
v_5 = limit - cursor;
// (, line 206
// or, line 206
lab5: do {
v_6 = limit - cursor;
lab6: do {
// call standard_suffix, line 206
if (!r_standard_suffix())
{
break lab6;
}
break lab5;
} while (false);
cursor = limit - v_6;
// call verb_suffix, line 206
if (!r_verb_suffix())
{
break lab4;
}
} while (false);
cursor = limit - v_5;
// do, line 207
v_7 = limit - cursor;
lab7: do {
// (, line 207
// [, line 207
ket = cursor;
// literal, line 207
if (!(eq_s_b(1, "i")))
{
break lab7;
}
// ], line 207
bra = cursor;
// test, line 207
v_8 = limit - cursor;
// literal, line 207
if (!(eq_s_b(1, "c")))
{
break lab7;
}
cursor = limit - v_8;
// call RV, line 207
if (!r_RV())
{
break lab7;
}
// delete, line 207
slice_del();
} while (false);
cursor = limit - v_7;
break lab3;
} while (false);
cursor = limit - v_4;
// call residual_suffix, line 209
if (!r_residual_suffix())
{
break lab2;
}
} while (false);
} while (false);
cursor = limit - v_3;
// do, line 211
v_9 = limit - cursor;
lab8: do {
// call residual_form, line 211
if (!r_residual_form())
{
break lab8;
}
} while (false);
cursor = limit - v_9;
cursor = limit_backward; // do, line 213
v_10 = cursor;
lab9: do {
// call postlude, line 213
if (!r_postlude())
{
break lab9;
}
} while (false);
cursor = v_10;
return true;
}
public boolean equals( Object o ) {
return o instanceof portugueseStemmer;
}
public int hashCode() {
return portugueseStemmer.class.getName().hashCode();
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/stemmer
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/stemmer/snowball/romanianStemmer.java
|
// CHECKSTYLE:OFF
/*
Copyright (c) 2001, Dr Martin Porter
Copyright (c) 2002, Richard Boulton
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* Neither the name of the copyright holders nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
// This file was generated automatically by the Snowball to Java compiler
package opennlp.tools.stemmer.snowball;
/**
* This class was automatically generated by a Snowball to Java compiler
* It implements the stemming algorithm defined by a snowball script.
*/
class romanianStemmer extends opennlp.tools.stemmer.snowball.AbstractSnowballStemmer {
private final static romanianStemmer methodObject = new romanianStemmer ();
private final static Among a_0[] = {
new Among ( "", -1, 3, "", methodObject ),
new Among ( "I", 0, 1, "", methodObject ),
new Among ( "U", 0, 2, "", methodObject )
};
private final static Among a_1[] = {
new Among ( "ea", -1, 3, "", methodObject ),
new Among ( "a\u0163ia", -1, 7, "", methodObject ),
new Among ( "aua", -1, 2, "", methodObject ),
new Among ( "iua", -1, 4, "", methodObject ),
new Among ( "a\u0163ie", -1, 7, "", methodObject ),
new Among ( "ele", -1, 3, "", methodObject ),
new Among ( "ile", -1, 5, "", methodObject ),
new Among ( "iile", 6, 4, "", methodObject ),
new Among ( "iei", -1, 4, "", methodObject ),
new Among ( "atei", -1, 6, "", methodObject ),
new Among ( "ii", -1, 4, "", methodObject ),
new Among ( "ului", -1, 1, "", methodObject ),
new Among ( "ul", -1, 1, "", methodObject ),
new Among ( "elor", -1, 3, "", methodObject ),
new Among ( "ilor", -1, 4, "", methodObject ),
new Among ( "iilor", 14, 4, "", methodObject )
};
private final static Among a_2[] = {
new Among ( "icala", -1, 4, "", methodObject ),
new Among ( "iciva", -1, 4, "", methodObject ),
new Among ( "ativa", -1, 5, "", methodObject ),
new Among ( "itiva", -1, 6, "", methodObject ),
new Among ( "icale", -1, 4, "", methodObject ),
new Among ( "a\u0163iune", -1, 5, "", methodObject ),
new Among ( "i\u0163iune", -1, 6, "", methodObject ),
new Among ( "atoare", -1, 5, "", methodObject ),
new Among ( "itoare", -1, 6, "", methodObject ),
new Among ( "\u0103toare", -1, 5, "", methodObject ),
new Among ( "icitate", -1, 4, "", methodObject ),
new Among ( "abilitate", -1, 1, "", methodObject ),
new Among ( "ibilitate", -1, 2, "", methodObject ),
new Among ( "ivitate", -1, 3, "", methodObject ),
new Among ( "icive", -1, 4, "", methodObject ),
new Among ( "ative", -1, 5, "", methodObject ),
new Among ( "itive", -1, 6, "", methodObject ),
new Among ( "icali", -1, 4, "", methodObject ),
new Among ( "atori", -1, 5, "", methodObject ),
new Among ( "icatori", 18, 4, "", methodObject ),
new Among ( "itori", -1, 6, "", methodObject ),
new Among ( "\u0103tori", -1, 5, "", methodObject ),
new Among ( "icitati", -1, 4, "", methodObject ),
new Among ( "abilitati", -1, 1, "", methodObject ),
new Among ( "ivitati", -1, 3, "", methodObject ),
new Among ( "icivi", -1, 4, "", methodObject ),
new Among ( "ativi", -1, 5, "", methodObject ),
new Among ( "itivi", -1, 6, "", methodObject ),
new Among ( "icit\u0103i", -1, 4, "", methodObject ),
new Among ( "abilit\u0103i", -1, 1, "", methodObject ),
new Among ( "ivit\u0103i", -1, 3, "", methodObject ),
new Among ( "icit\u0103\u0163i", -1, 4, "", methodObject ),
new Among ( "abilit\u0103\u0163i", -1, 1, "", methodObject ),
new Among ( "ivit\u0103\u0163i", -1, 3, "", methodObject ),
new Among ( "ical", -1, 4, "", methodObject ),
new Among ( "ator", -1, 5, "", methodObject ),
new Among ( "icator", 35, 4, "", methodObject ),
new Among ( "itor", -1, 6, "", methodObject ),
new Among ( "\u0103tor", -1, 5, "", methodObject ),
new Among ( "iciv", -1, 4, "", methodObject ),
new Among ( "ativ", -1, 5, "", methodObject ),
new Among ( "itiv", -1, 6, "", methodObject ),
new Among ( "ical\u0103", -1, 4, "", methodObject ),
new Among ( "iciv\u0103", -1, 4, "", methodObject ),
new Among ( "ativ\u0103", -1, 5, "", methodObject ),
new Among ( "itiv\u0103", -1, 6, "", methodObject )
};
private final static Among a_3[] = {
new Among ( "ica", -1, 1, "", methodObject ),
new Among ( "abila", -1, 1, "", methodObject ),
new Among ( "ibila", -1, 1, "", methodObject ),
new Among ( "oasa", -1, 1, "", methodObject ),
new Among ( "ata", -1, 1, "", methodObject ),
new Among ( "ita", -1, 1, "", methodObject ),
new Among ( "anta", -1, 1, "", methodObject ),
new Among ( "ista", -1, 3, "", methodObject ),
new Among ( "uta", -1, 1, "", methodObject ),
new Among ( "iva", -1, 1, "", methodObject ),
new Among ( "ic", -1, 1, "", methodObject ),
new Among ( "ice", -1, 1, "", methodObject ),
new Among ( "abile", -1, 1, "", methodObject ),
new Among ( "ibile", -1, 1, "", methodObject ),
new Among ( "isme", -1, 3, "", methodObject ),
new Among ( "iune", -1, 2, "", methodObject ),
new Among ( "oase", -1, 1, "", methodObject ),
new Among ( "ate", -1, 1, "", methodObject ),
new Among ( "itate", 17, 1, "", methodObject ),
new Among ( "ite", -1, 1, "", methodObject ),
new Among ( "ante", -1, 1, "", methodObject ),
new Among ( "iste", -1, 3, "", methodObject ),
new Among ( "ute", -1, 1, "", methodObject ),
new Among ( "ive", -1, 1, "", methodObject ),
new Among ( "ici", -1, 1, "", methodObject ),
new Among ( "abili", -1, 1, "", methodObject ),
new Among ( "ibili", -1, 1, "", methodObject ),
new Among ( "iuni", -1, 2, "", methodObject ),
new Among ( "atori", -1, 1, "", methodObject ),
new Among ( "osi", -1, 1, "", methodObject ),
new Among ( "ati", -1, 1, "", methodObject ),
new Among ( "itati", 30, 1, "", methodObject ),
new Among ( "iti", -1, 1, "", methodObject ),
new Among ( "anti", -1, 1, "", methodObject ),
new Among ( "isti", -1, 3, "", methodObject ),
new Among ( "uti", -1, 1, "", methodObject ),
new Among ( "i\u015Fti", -1, 3, "", methodObject ),
new Among ( "ivi", -1, 1, "", methodObject ),
new Among ( "it\u0103i", -1, 1, "", methodObject ),
new Among ( "o\u015Fi", -1, 1, "", methodObject ),
new Among ( "it\u0103\u0163i", -1, 1, "", methodObject ),
new Among ( "abil", -1, 1, "", methodObject ),
new Among ( "ibil", -1, 1, "", methodObject ),
new Among ( "ism", -1, 3, "", methodObject ),
new Among ( "ator", -1, 1, "", methodObject ),
new Among ( "os", -1, 1, "", methodObject ),
new Among ( "at", -1, 1, "", methodObject ),
new Among ( "it", -1, 1, "", methodObject ),
new Among ( "ant", -1, 1, "", methodObject ),
new Among ( "ist", -1, 3, "", methodObject ),
new Among ( "ut", -1, 1, "", methodObject ),
new Among ( "iv", -1, 1, "", methodObject ),
new Among ( "ic\u0103", -1, 1, "", methodObject ),
new Among ( "abil\u0103", -1, 1, "", methodObject ),
new Among ( "ibil\u0103", -1, 1, "", methodObject ),
new Among ( "oas\u0103", -1, 1, "", methodObject ),
new Among ( "at\u0103", -1, 1, "", methodObject ),
new Among ( "it\u0103", -1, 1, "", methodObject ),
new Among ( "ant\u0103", -1, 1, "", methodObject ),
new Among ( "ist\u0103", -1, 3, "", methodObject ),
new Among ( "ut\u0103", -1, 1, "", methodObject ),
new Among ( "iv\u0103", -1, 1, "", methodObject )
};
private final static Among a_4[] = {
new Among ( "ea", -1, 1, "", methodObject ),
new Among ( "ia", -1, 1, "", methodObject ),
new Among ( "esc", -1, 1, "", methodObject ),
new Among ( "\u0103sc", -1, 1, "", methodObject ),
new Among ( "ind", -1, 1, "", methodObject ),
new Among ( "\u00E2nd", -1, 1, "", methodObject ),
new Among ( "are", -1, 1, "", methodObject ),
new Among ( "ere", -1, 1, "", methodObject ),
new Among ( "ire", -1, 1, "", methodObject ),
new Among ( "\u00E2re", -1, 1, "", methodObject ),
new Among ( "se", -1, 2, "", methodObject ),
new Among ( "ase", 10, 1, "", methodObject ),
new Among ( "sese", 10, 2, "", methodObject ),
new Among ( "ise", 10, 1, "", methodObject ),
new Among ( "use", 10, 1, "", methodObject ),
new Among ( "\u00E2se", 10, 1, "", methodObject ),
new Among ( "e\u015Fte", -1, 1, "", methodObject ),
new Among ( "\u0103\u015Fte", -1, 1, "", methodObject ),
new Among ( "eze", -1, 1, "", methodObject ),
new Among ( "ai", -1, 1, "", methodObject ),
new Among ( "eai", 19, 1, "", methodObject ),
new Among ( "iai", 19, 1, "", methodObject ),
new Among ( "sei", -1, 2, "", methodObject ),
new Among ( "e\u015Fti", -1, 1, "", methodObject ),
new Among ( "\u0103\u015Fti", -1, 1, "", methodObject ),
new Among ( "ui", -1, 1, "", methodObject ),
new Among ( "ezi", -1, 1, "", methodObject ),
new Among ( "\u00E2i", -1, 1, "", methodObject ),
new Among ( "a\u015Fi", -1, 1, "", methodObject ),
new Among ( "se\u015Fi", -1, 2, "", methodObject ),
new Among ( "ase\u015Fi", 29, 1, "", methodObject ),
new Among ( "sese\u015Fi", 29, 2, "", methodObject ),
new Among ( "ise\u015Fi", 29, 1, "", methodObject ),
new Among ( "use\u015Fi", 29, 1, "", methodObject ),
new Among ( "\u00E2se\u015Fi", 29, 1, "", methodObject ),
new Among ( "i\u015Fi", -1, 1, "", methodObject ),
new Among ( "u\u015Fi", -1, 1, "", methodObject ),
new Among ( "\u00E2\u015Fi", -1, 1, "", methodObject ),
new Among ( "a\u0163i", -1, 2, "", methodObject ),
new Among ( "ea\u0163i", 38, 1, "", methodObject ),
new Among ( "ia\u0163i", 38, 1, "", methodObject ),
new Among ( "e\u0163i", -1, 2, "", methodObject ),
new Among ( "i\u0163i", -1, 2, "", methodObject ),
new Among ( "\u00E2\u0163i", -1, 2, "", methodObject ),
new Among ( "ar\u0103\u0163i", -1, 1, "", methodObject ),
new Among ( "ser\u0103\u0163i", -1, 2, "", methodObject ),
new Among ( "aser\u0103\u0163i", 45, 1, "", methodObject ),
new Among ( "seser\u0103\u0163i", 45, 2, "", methodObject ),
new Among ( "iser\u0103\u0163i", 45, 1, "", methodObject ),
new Among ( "user\u0103\u0163i", 45, 1, "", methodObject ),
new Among ( "\u00E2ser\u0103\u0163i", 45, 1, "", methodObject ),
new Among ( "ir\u0103\u0163i", -1, 1, "", methodObject ),
new Among ( "ur\u0103\u0163i", -1, 1, "", methodObject ),
new Among ( "\u00E2r\u0103\u0163i", -1, 1, "", methodObject ),
new Among ( "am", -1, 1, "", methodObject ),
new Among ( "eam", 54, 1, "", methodObject ),
new Among ( "iam", 54, 1, "", methodObject ),
new Among ( "em", -1, 2, "", methodObject ),
new Among ( "asem", 57, 1, "", methodObject ),
new Among ( "sesem", 57, 2, "", methodObject ),
new Among ( "isem", 57, 1, "", methodObject ),
new Among ( "usem", 57, 1, "", methodObject ),
new Among ( "\u00E2sem", 57, 1, "", methodObject ),
new Among ( "im", -1, 2, "", methodObject ),
new Among ( "\u00E2m", -1, 2, "", methodObject ),
new Among ( "\u0103m", -1, 2, "", methodObject ),
new Among ( "ar\u0103m", 65, 1, "", methodObject ),
new Among ( "ser\u0103m", 65, 2, "", methodObject ),
new Among ( "aser\u0103m", 67, 1, "", methodObject ),
new Among ( "seser\u0103m", 67, 2, "", methodObject ),
new Among ( "iser\u0103m", 67, 1, "", methodObject ),
new Among ( "user\u0103m", 67, 1, "", methodObject ),
new Among ( "\u00E2ser\u0103m", 67, 1, "", methodObject ),
new Among ( "ir\u0103m", 65, 1, "", methodObject ),
new Among ( "ur\u0103m", 65, 1, "", methodObject ),
new Among ( "\u00E2r\u0103m", 65, 1, "", methodObject ),
new Among ( "au", -1, 1, "", methodObject ),
new Among ( "eau", 76, 1, "", methodObject ),
new Among ( "iau", 76, 1, "", methodObject ),
new Among ( "indu", -1, 1, "", methodObject ),
new Among ( "\u00E2ndu", -1, 1, "", methodObject ),
new Among ( "ez", -1, 1, "", methodObject ),
new Among ( "easc\u0103", -1, 1, "", methodObject ),
new Among ( "ar\u0103", -1, 1, "", methodObject ),
new Among ( "ser\u0103", -1, 2, "", methodObject ),
new Among ( "aser\u0103", 84, 1, "", methodObject ),
new Among ( "seser\u0103", 84, 2, "", methodObject ),
new Among ( "iser\u0103", 84, 1, "", methodObject ),
new Among ( "user\u0103", 84, 1, "", methodObject ),
new Among ( "\u00E2ser\u0103", 84, 1, "", methodObject ),
new Among ( "ir\u0103", -1, 1, "", methodObject ),
new Among ( "ur\u0103", -1, 1, "", methodObject ),
new Among ( "\u00E2r\u0103", -1, 1, "", methodObject ),
new Among ( "eaz\u0103", -1, 1, "", methodObject )
};
private final static Among a_5[] = {
new Among ( "a", -1, 1, "", methodObject ),
new Among ( "e", -1, 1, "", methodObject ),
new Among ( "ie", 1, 1, "", methodObject ),
new Among ( "i", -1, 1, "", methodObject ),
new Among ( "\u0103", -1, 1, "", methodObject )
};
private static final char g_v[] = {17, 65, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 32, 0, 0, 4 };
private boolean B_standard_suffix_removed;
private int I_p2;
private int I_p1;
private int I_pV;
private void copy_from(romanianStemmer other) {
B_standard_suffix_removed = other.B_standard_suffix_removed;
I_p2 = other.I_p2;
I_p1 = other.I_p1;
I_pV = other.I_pV;
super.copy_from(other);
}
private boolean r_prelude() {
int v_1;
int v_2;
int v_3;
// (, line 31
// repeat, line 32
replab0: while(true)
{
v_1 = cursor;
lab1: do {
// goto, line 32
golab2: while(true)
{
v_2 = cursor;
lab3: do {
// (, line 32
if (!(in_grouping(g_v, 97, 259)))
{
break lab3;
}
// [, line 33
bra = cursor;
// or, line 33
lab4: do {
v_3 = cursor;
lab5: do {
// (, line 33
// literal, line 33
if (!(eq_s(1, "u")))
{
break lab5;
}
// ], line 33
ket = cursor;
if (!(in_grouping(g_v, 97, 259)))
{
break lab5;
}
// <-, line 33
slice_from("U");
break lab4;
} while (false);
cursor = v_3;
// (, line 34
// literal, line 34
if (!(eq_s(1, "i")))
{
break lab3;
}
// ], line 34
ket = cursor;
if (!(in_grouping(g_v, 97, 259)))
{
break lab3;
}
// <-, line 34
slice_from("I");
} while (false);
cursor = v_2;
break golab2;
} while (false);
cursor = v_2;
if (cursor >= limit)
{
break lab1;
}
cursor++;
}
continue replab0;
} while (false);
cursor = v_1;
break replab0;
}
return true;
}
private boolean r_mark_regions() {
int v_1;
int v_2;
int v_3;
int v_6;
int v_8;
// (, line 38
I_pV = limit;
I_p1 = limit;
I_p2 = limit;
// do, line 44
v_1 = cursor;
lab0: do {
// (, line 44
// or, line 46
lab1: do {
v_2 = cursor;
lab2: do {
// (, line 45
if (!(in_grouping(g_v, 97, 259)))
{
break lab2;
}
// or, line 45
lab3: do {
v_3 = cursor;
lab4: do {
// (, line 45
if (!(out_grouping(g_v, 97, 259)))
{
break lab4;
}
// gopast, line 45
golab5: while(true)
{
lab6: do {
if (!(in_grouping(g_v, 97, 259)))
{
break lab6;
}
break golab5;
} while (false);
if (cursor >= limit)
{
break lab4;
}
cursor++;
}
break lab3;
} while (false);
cursor = v_3;
// (, line 45
if (!(in_grouping(g_v, 97, 259)))
{
break lab2;
}
// gopast, line 45
golab7: while(true)
{
lab8: do {
if (!(out_grouping(g_v, 97, 259)))
{
break lab8;
}
break golab7;
} while (false);
if (cursor >= limit)
{
break lab2;
}
cursor++;
}
} while (false);
break lab1;
} while (false);
cursor = v_2;
// (, line 47
if (!(out_grouping(g_v, 97, 259)))
{
break lab0;
}
// or, line 47
lab9: do {
v_6 = cursor;
lab10: do {
// (, line 47
if (!(out_grouping(g_v, 97, 259)))
{
break lab10;
}
// gopast, line 47
golab11: while(true)
{
lab12: do {
if (!(in_grouping(g_v, 97, 259)))
{
break lab12;
}
break golab11;
} while (false);
if (cursor >= limit)
{
break lab10;
}
cursor++;
}
break lab9;
} while (false);
cursor = v_6;
// (, line 47
if (!(in_grouping(g_v, 97, 259)))
{
break lab0;
}
// next, line 47
if (cursor >= limit)
{
break lab0;
}
cursor++;
} while (false);
} while (false);
// setmark pV, line 48
I_pV = cursor;
} while (false);
cursor = v_1;
// do, line 50
v_8 = cursor;
lab13: do {
// (, line 50
// gopast, line 51
golab14: while(true)
{
lab15: do {
if (!(in_grouping(g_v, 97, 259)))
{
break lab15;
}
break golab14;
} while (false);
if (cursor >= limit)
{
break lab13;
}
cursor++;
}
// gopast, line 51
golab16: while(true)
{
lab17: do {
if (!(out_grouping(g_v, 97, 259)))
{
break lab17;
}
break golab16;
} while (false);
if (cursor >= limit)
{
break lab13;
}
cursor++;
}
// setmark p1, line 51
I_p1 = cursor;
// gopast, line 52
golab18: while(true)
{
lab19: do {
if (!(in_grouping(g_v, 97, 259)))
{
break lab19;
}
break golab18;
} while (false);
if (cursor >= limit)
{
break lab13;
}
cursor++;
}
// gopast, line 52
golab20: while(true)
{
lab21: do {
if (!(out_grouping(g_v, 97, 259)))
{
break lab21;
}
break golab20;
} while (false);
if (cursor >= limit)
{
break lab13;
}
cursor++;
}
// setmark p2, line 52
I_p2 = cursor;
} while (false);
cursor = v_8;
return true;
}
private boolean r_postlude() {
int among_var;
int v_1;
// repeat, line 56
replab0: while(true)
{
v_1 = cursor;
lab1: do {
// (, line 56
// [, line 58
bra = cursor;
// substring, line 58
among_var = find_among(a_0, 3);
if (among_var == 0)
{
break lab1;
}
// ], line 58
ket = cursor;
switch(among_var) {
case 0:
break lab1;
case 1:
// (, line 59
// <-, line 59
slice_from("i");
break;
case 2:
// (, line 60
// <-, line 60
slice_from("u");
break;
case 3:
// (, line 61
// next, line 61
if (cursor >= limit)
{
break lab1;
}
cursor++;
break;
}
continue replab0;
} while (false);
cursor = v_1;
break replab0;
}
return true;
}
private boolean r_RV() {
if (!(I_pV <= cursor))
{
return false;
}
return true;
}
private boolean r_R1() {
if (!(I_p1 <= cursor))
{
return false;
}
return true;
}
private boolean r_R2() {
if (!(I_p2 <= cursor))
{
return false;
}
return true;
}
private boolean r_step_0() {
int among_var;
int v_1;
// (, line 72
// [, line 73
ket = cursor;
// substring, line 73
among_var = find_among_b(a_1, 16);
if (among_var == 0)
{
return false;
}
// ], line 73
bra = cursor;
// call R1, line 73
if (!r_R1())
{
return false;
}
switch(among_var) {
case 0:
return false;
case 1:
// (, line 75
// delete, line 75
slice_del();
break;
case 2:
// (, line 77
// <-, line 77
slice_from("a");
break;
case 3:
// (, line 79
// <-, line 79
slice_from("e");
break;
case 4:
// (, line 81
// <-, line 81
slice_from("i");
break;
case 5:
// (, line 83
// not, line 83
{
v_1 = limit - cursor;
lab0: do {
// literal, line 83
if (!(eq_s_b(2, "ab")))
{
break lab0;
}
return false;
} while (false);
cursor = limit - v_1;
}
// <-, line 83
slice_from("i");
break;
case 6:
// (, line 85
// <-, line 85
slice_from("at");
break;
case 7:
// (, line 87
// <-, line 87
slice_from("a\u0163i");
break;
}
return true;
}
private boolean r_combo_suffix() {
int among_var;
int v_1;
// test, line 91
v_1 = limit - cursor;
// (, line 91
// [, line 92
ket = cursor;
// substring, line 92
among_var = find_among_b(a_2, 46);
if (among_var == 0)
{
return false;
}
// ], line 92
bra = cursor;
// call R1, line 92
if (!r_R1())
{
return false;
}
// (, line 92
switch(among_var) {
case 0:
return false;
case 1:
// (, line 100
// <-, line 101
slice_from("abil");
break;
case 2:
// (, line 103
// <-, line 104
slice_from("ibil");
break;
case 3:
// (, line 106
// <-, line 107
slice_from("iv");
break;
case 4:
// (, line 112
// <-, line 113
slice_from("ic");
break;
case 5:
// (, line 117
// <-, line 118
slice_from("at");
break;
case 6:
// (, line 121
// <-, line 122
slice_from("it");
break;
}
// set standard_suffix_removed, line 125
B_standard_suffix_removed = true;
cursor = limit - v_1;
return true;
}
private boolean r_standard_suffix() {
int among_var;
int v_1;
// (, line 129
// unset standard_suffix_removed, line 130
B_standard_suffix_removed = false;
// repeat, line 131
replab0: while(true)
{
v_1 = limit - cursor;
lab1: do {
// call combo_suffix, line 131
if (!r_combo_suffix())
{
break lab1;
}
continue replab0;
} while (false);
cursor = limit - v_1;
break replab0;
}
// [, line 132
ket = cursor;
// substring, line 132
among_var = find_among_b(a_3, 62);
if (among_var == 0)
{
return false;
}
// ], line 132
bra = cursor;
// call R2, line 132
if (!r_R2())
{
return false;
}
// (, line 132
switch(among_var) {
case 0:
return false;
case 1:
// (, line 148
// delete, line 149
slice_del();
break;
case 2:
// (, line 151
// literal, line 152
if (!(eq_s_b(1, "\u0163")))
{
return false;
}
// ], line 152
bra = cursor;
// <-, line 152
slice_from("t");
break;
case 3:
// (, line 155
// <-, line 156
slice_from("ist");
break;
}
// set standard_suffix_removed, line 160
B_standard_suffix_removed = true;
return true;
}
private boolean r_verb_suffix() {
int among_var;
int v_1;
int v_2;
int v_3;
// setlimit, line 164
v_1 = limit - cursor;
// tomark, line 164
if (cursor < I_pV)
{
return false;
}
cursor = I_pV;
v_2 = limit_backward;
limit_backward = cursor;
cursor = limit - v_1;
// (, line 164
// [, line 165
ket = cursor;
// substring, line 165
among_var = find_among_b(a_4, 94);
if (among_var == 0)
{
limit_backward = v_2;
return false;
}
// ], line 165
bra = cursor;
switch(among_var) {
case 0:
limit_backward = v_2;
return false;
case 1:
// (, line 200
// or, line 200
lab0: do {
v_3 = limit - cursor;
lab1: do {
if (!(out_grouping_b(g_v, 97, 259)))
{
break lab1;
}
break lab0;
} while (false);
cursor = limit - v_3;
// literal, line 200
if (!(eq_s_b(1, "u")))
{
limit_backward = v_2;
return false;
}
} while (false);
// delete, line 200
slice_del();
break;
case 2:
// (, line 214
// delete, line 214
slice_del();
break;
}
limit_backward = v_2;
return true;
}
private boolean r_vowel_suffix() {
int among_var;
// (, line 218
// [, line 219
ket = cursor;
// substring, line 219
among_var = find_among_b(a_5, 5);
if (among_var == 0)
{
return false;
}
// ], line 219
bra = cursor;
// call RV, line 219
if (!r_RV())
{
return false;
}
switch(among_var) {
case 0:
return false;
case 1:
// (, line 220
// delete, line 220
slice_del();
break;
}
return true;
}
public boolean stem() {
int v_1;
int v_2;
int v_3;
int v_4;
int v_5;
int v_6;
int v_7;
int v_8;
// (, line 225
// do, line 226
v_1 = cursor;
lab0: do {
// call prelude, line 226
if (!r_prelude())
{
break lab0;
}
} while (false);
cursor = v_1;
// do, line 227
v_2 = cursor;
lab1: do {
// call mark_regions, line 227
if (!r_mark_regions())
{
break lab1;
}
} while (false);
cursor = v_2;
// backwards, line 228
limit_backward = cursor; cursor = limit;
// (, line 228
// do, line 229
v_3 = limit - cursor;
lab2: do {
// call step_0, line 229
if (!r_step_0())
{
break lab2;
}
} while (false);
cursor = limit - v_3;
// do, line 230
v_4 = limit - cursor;
lab3: do {
// call standard_suffix, line 230
if (!r_standard_suffix())
{
break lab3;
}
} while (false);
cursor = limit - v_4;
// do, line 231
v_5 = limit - cursor;
lab4: do {
// (, line 231
// or, line 231
lab5: do {
v_6 = limit - cursor;
lab6: do {
// Boolean test standard_suffix_removed, line 231
if (!(B_standard_suffix_removed))
{
break lab6;
}
break lab5;
} while (false);
cursor = limit - v_6;
// call verb_suffix, line 231
if (!r_verb_suffix())
{
break lab4;
}
} while (false);
} while (false);
cursor = limit - v_5;
// do, line 232
v_7 = limit - cursor;
lab7: do {
// call vowel_suffix, line 232
if (!r_vowel_suffix())
{
break lab7;
}
} while (false);
cursor = limit - v_7;
cursor = limit_backward; // do, line 234
v_8 = cursor;
lab8: do {
// call postlude, line 234
if (!r_postlude())
{
break lab8;
}
} while (false);
cursor = v_8;
return true;
}
public boolean equals( Object o ) {
return o instanceof romanianStemmer;
}
public int hashCode() {
return romanianStemmer.class.getName().hashCode();
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/stemmer
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/stemmer/snowball/russianStemmer.java
|
// CHECKSTYLE:OFF
/*
Copyright (c) 2001, Dr Martin Porter
Copyright (c) 2002, Richard Boulton
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* Neither the name of the copyright holders nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
// This file was generated automatically by the Snowball to Java compiler
package opennlp.tools.stemmer.snowball;
/**
* This class was automatically generated by a Snowball to Java compiler
* It implements the stemming algorithm defined by a snowball script.
*/
class russianStemmer extends opennlp.tools.stemmer.snowball.AbstractSnowballStemmer {
private final static russianStemmer methodObject = new russianStemmer ();
private final static Among a_0[] = {
new Among ( "\u0432", -1, 1, "", methodObject ),
new Among ( "\u0438\u0432", 0, 2, "", methodObject ),
new Among ( "\u044B\u0432", 0, 2, "", methodObject ),
new Among ( "\u0432\u0448\u0438", -1, 1, "", methodObject ),
new Among ( "\u0438\u0432\u0448\u0438", 3, 2, "", methodObject ),
new Among ( "\u044B\u0432\u0448\u0438", 3, 2, "", methodObject ),
new Among ( "\u0432\u0448\u0438\u0441\u044C", -1, 1, "", methodObject ),
new Among ( "\u0438\u0432\u0448\u0438\u0441\u044C", 6, 2, "", methodObject ),
new Among ( "\u044B\u0432\u0448\u0438\u0441\u044C", 6, 2, "", methodObject )
};
private final static Among a_1[] = {
new Among ( "\u0435\u0435", -1, 1, "", methodObject ),
new Among ( "\u0438\u0435", -1, 1, "", methodObject ),
new Among ( "\u043E\u0435", -1, 1, "", methodObject ),
new Among ( "\u044B\u0435", -1, 1, "", methodObject ),
new Among ( "\u0438\u043C\u0438", -1, 1, "", methodObject ),
new Among ( "\u044B\u043C\u0438", -1, 1, "", methodObject ),
new Among ( "\u0435\u0439", -1, 1, "", methodObject ),
new Among ( "\u0438\u0439", -1, 1, "", methodObject ),
new Among ( "\u043E\u0439", -1, 1, "", methodObject ),
new Among ( "\u044B\u0439", -1, 1, "", methodObject ),
new Among ( "\u0435\u043C", -1, 1, "", methodObject ),
new Among ( "\u0438\u043C", -1, 1, "", methodObject ),
new Among ( "\u043E\u043C", -1, 1, "", methodObject ),
new Among ( "\u044B\u043C", -1, 1, "", methodObject ),
new Among ( "\u0435\u0433\u043E", -1, 1, "", methodObject ),
new Among ( "\u043E\u0433\u043E", -1, 1, "", methodObject ),
new Among ( "\u0435\u043C\u0443", -1, 1, "", methodObject ),
new Among ( "\u043E\u043C\u0443", -1, 1, "", methodObject ),
new Among ( "\u0438\u0445", -1, 1, "", methodObject ),
new Among ( "\u044B\u0445", -1, 1, "", methodObject ),
new Among ( "\u0435\u044E", -1, 1, "", methodObject ),
new Among ( "\u043E\u044E", -1, 1, "", methodObject ),
new Among ( "\u0443\u044E", -1, 1, "", methodObject ),
new Among ( "\u044E\u044E", -1, 1, "", methodObject ),
new Among ( "\u0430\u044F", -1, 1, "", methodObject ),
new Among ( "\u044F\u044F", -1, 1, "", methodObject )
};
private final static Among a_2[] = {
new Among ( "\u0435\u043C", -1, 1, "", methodObject ),
new Among ( "\u043D\u043D", -1, 1, "", methodObject ),
new Among ( "\u0432\u0448", -1, 1, "", methodObject ),
new Among ( "\u0438\u0432\u0448", 2, 2, "", methodObject ),
new Among ( "\u044B\u0432\u0448", 2, 2, "", methodObject ),
new Among ( "\u0449", -1, 1, "", methodObject ),
new Among ( "\u044E\u0449", 5, 1, "", methodObject ),
new Among ( "\u0443\u044E\u0449", 6, 2, "", methodObject )
};
private final static Among a_3[] = {
new Among ( "\u0441\u044C", -1, 1, "", methodObject ),
new Among ( "\u0441\u044F", -1, 1, "", methodObject )
};
private final static Among a_4[] = {
new Among ( "\u043B\u0430", -1, 1, "", methodObject ),
new Among ( "\u0438\u043B\u0430", 0, 2, "", methodObject ),
new Among ( "\u044B\u043B\u0430", 0, 2, "", methodObject ),
new Among ( "\u043D\u0430", -1, 1, "", methodObject ),
new Among ( "\u0435\u043D\u0430", 3, 2, "", methodObject ),
new Among ( "\u0435\u0442\u0435", -1, 1, "", methodObject ),
new Among ( "\u0438\u0442\u0435", -1, 2, "", methodObject ),
new Among ( "\u0439\u0442\u0435", -1, 1, "", methodObject ),
new Among ( "\u0435\u0439\u0442\u0435", 7, 2, "", methodObject ),
new Among ( "\u0443\u0439\u0442\u0435", 7, 2, "", methodObject ),
new Among ( "\u043B\u0438", -1, 1, "", methodObject ),
new Among ( "\u0438\u043B\u0438", 10, 2, "", methodObject ),
new Among ( "\u044B\u043B\u0438", 10, 2, "", methodObject ),
new Among ( "\u0439", -1, 1, "", methodObject ),
new Among ( "\u0435\u0439", 13, 2, "", methodObject ),
new Among ( "\u0443\u0439", 13, 2, "", methodObject ),
new Among ( "\u043B", -1, 1, "", methodObject ),
new Among ( "\u0438\u043B", 16, 2, "", methodObject ),
new Among ( "\u044B\u043B", 16, 2, "", methodObject ),
new Among ( "\u0435\u043C", -1, 1, "", methodObject ),
new Among ( "\u0438\u043C", -1, 2, "", methodObject ),
new Among ( "\u044B\u043C", -1, 2, "", methodObject ),
new Among ( "\u043D", -1, 1, "", methodObject ),
new Among ( "\u0435\u043D", 22, 2, "", methodObject ),
new Among ( "\u043B\u043E", -1, 1, "", methodObject ),
new Among ( "\u0438\u043B\u043E", 24, 2, "", methodObject ),
new Among ( "\u044B\u043B\u043E", 24, 2, "", methodObject ),
new Among ( "\u043D\u043E", -1, 1, "", methodObject ),
new Among ( "\u0435\u043D\u043E", 27, 2, "", methodObject ),
new Among ( "\u043D\u043D\u043E", 27, 1, "", methodObject ),
new Among ( "\u0435\u0442", -1, 1, "", methodObject ),
new Among ( "\u0443\u0435\u0442", 30, 2, "", methodObject ),
new Among ( "\u0438\u0442", -1, 2, "", methodObject ),
new Among ( "\u044B\u0442", -1, 2, "", methodObject ),
new Among ( "\u044E\u0442", -1, 1, "", methodObject ),
new Among ( "\u0443\u044E\u0442", 34, 2, "", methodObject ),
new Among ( "\u044F\u0442", -1, 2, "", methodObject ),
new Among ( "\u043D\u044B", -1, 1, "", methodObject ),
new Among ( "\u0435\u043D\u044B", 37, 2, "", methodObject ),
new Among ( "\u0442\u044C", -1, 1, "", methodObject ),
new Among ( "\u0438\u0442\u044C", 39, 2, "", methodObject ),
new Among ( "\u044B\u0442\u044C", 39, 2, "", methodObject ),
new Among ( "\u0435\u0448\u044C", -1, 1, "", methodObject ),
new Among ( "\u0438\u0448\u044C", -1, 2, "", methodObject ),
new Among ( "\u044E", -1, 2, "", methodObject ),
new Among ( "\u0443\u044E", 44, 2, "", methodObject )
};
private final static Among a_5[] = {
new Among ( "\u0430", -1, 1, "", methodObject ),
new Among ( "\u0435\u0432", -1, 1, "", methodObject ),
new Among ( "\u043E\u0432", -1, 1, "", methodObject ),
new Among ( "\u0435", -1, 1, "", methodObject ),
new Among ( "\u0438\u0435", 3, 1, "", methodObject ),
new Among ( "\u044C\u0435", 3, 1, "", methodObject ),
new Among ( "\u0438", -1, 1, "", methodObject ),
new Among ( "\u0435\u0438", 6, 1, "", methodObject ),
new Among ( "\u0438\u0438", 6, 1, "", methodObject ),
new Among ( "\u0430\u043C\u0438", 6, 1, "", methodObject ),
new Among ( "\u044F\u043C\u0438", 6, 1, "", methodObject ),
new Among ( "\u0438\u044F\u043C\u0438", 10, 1, "", methodObject ),
new Among ( "\u0439", -1, 1, "", methodObject ),
new Among ( "\u0435\u0439", 12, 1, "", methodObject ),
new Among ( "\u0438\u0435\u0439", 13, 1, "", methodObject ),
new Among ( "\u0438\u0439", 12, 1, "", methodObject ),
new Among ( "\u043E\u0439", 12, 1, "", methodObject ),
new Among ( "\u0430\u043C", -1, 1, "", methodObject ),
new Among ( "\u0435\u043C", -1, 1, "", methodObject ),
new Among ( "\u0438\u0435\u043C", 18, 1, "", methodObject ),
new Among ( "\u043E\u043C", -1, 1, "", methodObject ),
new Among ( "\u044F\u043C", -1, 1, "", methodObject ),
new Among ( "\u0438\u044F\u043C", 21, 1, "", methodObject ),
new Among ( "\u043E", -1, 1, "", methodObject ),
new Among ( "\u0443", -1, 1, "", methodObject ),
new Among ( "\u0430\u0445", -1, 1, "", methodObject ),
new Among ( "\u044F\u0445", -1, 1, "", methodObject ),
new Among ( "\u0438\u044F\u0445", 26, 1, "", methodObject ),
new Among ( "\u044B", -1, 1, "", methodObject ),
new Among ( "\u044C", -1, 1, "", methodObject ),
new Among ( "\u044E", -1, 1, "", methodObject ),
new Among ( "\u0438\u044E", 30, 1, "", methodObject ),
new Among ( "\u044C\u044E", 30, 1, "", methodObject ),
new Among ( "\u044F", -1, 1, "", methodObject ),
new Among ( "\u0438\u044F", 33, 1, "", methodObject ),
new Among ( "\u044C\u044F", 33, 1, "", methodObject )
};
private final static Among a_6[] = {
new Among ( "\u043E\u0441\u0442", -1, 1, "", methodObject ),
new Among ( "\u043E\u0441\u0442\u044C", -1, 1, "", methodObject )
};
private final static Among a_7[] = {
new Among ( "\u0435\u0439\u0448\u0435", -1, 1, "", methodObject ),
new Among ( "\u043D", -1, 2, "", methodObject ),
new Among ( "\u0435\u0439\u0448", -1, 1, "", methodObject ),
new Among ( "\u044C", -1, 3, "", methodObject )
};
private static final char g_v[] = {33, 65, 8, 232 };
private int I_p2;
private int I_pV;
private void copy_from(russianStemmer other) {
I_p2 = other.I_p2;
I_pV = other.I_pV;
super.copy_from(other);
}
private boolean r_mark_regions() {
int v_1;
// (, line 57
I_pV = limit;
I_p2 = limit;
// do, line 61
v_1 = cursor;
lab0: do {
// (, line 61
// gopast, line 62
golab1: while(true)
{
lab2: do {
if (!(in_grouping(g_v, 1072, 1103)))
{
break lab2;
}
break golab1;
} while (false);
if (cursor >= limit)
{
break lab0;
}
cursor++;
}
// setmark pV, line 62
I_pV = cursor;
// gopast, line 62
golab3: while(true)
{
lab4: do {
if (!(out_grouping(g_v, 1072, 1103)))
{
break lab4;
}
break golab3;
} while (false);
if (cursor >= limit)
{
break lab0;
}
cursor++;
}
// gopast, line 63
golab5: while(true)
{
lab6: do {
if (!(in_grouping(g_v, 1072, 1103)))
{
break lab6;
}
break golab5;
} while (false);
if (cursor >= limit)
{
break lab0;
}
cursor++;
}
// gopast, line 63
golab7: while(true)
{
lab8: do {
if (!(out_grouping(g_v, 1072, 1103)))
{
break lab8;
}
break golab7;
} while (false);
if (cursor >= limit)
{
break lab0;
}
cursor++;
}
// setmark p2, line 63
I_p2 = cursor;
} while (false);
cursor = v_1;
return true;
}
private boolean r_R2() {
if (!(I_p2 <= cursor))
{
return false;
}
return true;
}
private boolean r_perfective_gerund() {
int among_var;
int v_1;
// (, line 71
// [, line 72
ket = cursor;
// substring, line 72
among_var = find_among_b(a_0, 9);
if (among_var == 0)
{
return false;
}
// ], line 72
bra = cursor;
switch(among_var) {
case 0:
return false;
case 1:
// (, line 76
// or, line 76
lab0: do {
v_1 = limit - cursor;
lab1: do {
// literal, line 76
if (!(eq_s_b(1, "\u0430")))
{
break lab1;
}
break lab0;
} while (false);
cursor = limit - v_1;
// literal, line 76
if (!(eq_s_b(1, "\u044F")))
{
return false;
}
} while (false);
// delete, line 76
slice_del();
break;
case 2:
// (, line 83
// delete, line 83
slice_del();
break;
}
return true;
}
private boolean r_adjective() {
int among_var;
// (, line 87
// [, line 88
ket = cursor;
// substring, line 88
among_var = find_among_b(a_1, 26);
if (among_var == 0)
{
return false;
}
// ], line 88
bra = cursor;
switch(among_var) {
case 0:
return false;
case 1:
// (, line 97
// delete, line 97
slice_del();
break;
}
return true;
}
private boolean r_adjectival() {
int among_var;
int v_1;
int v_2;
// (, line 101
// call adjective, line 102
if (!r_adjective())
{
return false;
}
// try, line 109
v_1 = limit - cursor;
lab0: do {
// (, line 109
// [, line 110
ket = cursor;
// substring, line 110
among_var = find_among_b(a_2, 8);
if (among_var == 0)
{
cursor = limit - v_1;
break lab0;
}
// ], line 110
bra = cursor;
switch(among_var) {
case 0:
cursor = limit - v_1;
break lab0;
case 1:
// (, line 115
// or, line 115
lab1: do {
v_2 = limit - cursor;
lab2: do {
// literal, line 115
if (!(eq_s_b(1, "\u0430")))
{
break lab2;
}
break lab1;
} while (false);
cursor = limit - v_2;
// literal, line 115
if (!(eq_s_b(1, "\u044F")))
{
cursor = limit - v_1;
break lab0;
}
} while (false);
// delete, line 115
slice_del();
break;
case 2:
// (, line 122
// delete, line 122
slice_del();
break;
}
} while (false);
return true;
}
private boolean r_reflexive() {
int among_var;
// (, line 128
// [, line 129
ket = cursor;
// substring, line 129
among_var = find_among_b(a_3, 2);
if (among_var == 0)
{
return false;
}
// ], line 129
bra = cursor;
switch(among_var) {
case 0:
return false;
case 1:
// (, line 132
// delete, line 132
slice_del();
break;
}
return true;
}
private boolean r_verb() {
int among_var;
int v_1;
// (, line 136
// [, line 137
ket = cursor;
// substring, line 137
among_var = find_among_b(a_4, 46);
if (among_var == 0)
{
return false;
}
// ], line 137
bra = cursor;
switch(among_var) {
case 0:
return false;
case 1:
// (, line 143
// or, line 143
lab0: do {
v_1 = limit - cursor;
lab1: do {
// literal, line 143
if (!(eq_s_b(1, "\u0430")))
{
break lab1;
}
break lab0;
} while (false);
cursor = limit - v_1;
// literal, line 143
if (!(eq_s_b(1, "\u044F")))
{
return false;
}
} while (false);
// delete, line 143
slice_del();
break;
case 2:
// (, line 151
// delete, line 151
slice_del();
break;
}
return true;
}
private boolean r_noun() {
int among_var;
// (, line 159
// [, line 160
ket = cursor;
// substring, line 160
among_var = find_among_b(a_5, 36);
if (among_var == 0)
{
return false;
}
// ], line 160
bra = cursor;
switch(among_var) {
case 0:
return false;
case 1:
// (, line 167
// delete, line 167
slice_del();
break;
}
return true;
}
private boolean r_derivational() {
int among_var;
// (, line 175
// [, line 176
ket = cursor;
// substring, line 176
among_var = find_among_b(a_6, 2);
if (among_var == 0)
{
return false;
}
// ], line 176
bra = cursor;
// call R2, line 176
if (!r_R2())
{
return false;
}
switch(among_var) {
case 0:
return false;
case 1:
// (, line 179
// delete, line 179
slice_del();
break;
}
return true;
}
private boolean r_tidy_up() {
int among_var;
// (, line 183
// [, line 184
ket = cursor;
// substring, line 184
among_var = find_among_b(a_7, 4);
if (among_var == 0)
{
return false;
}
// ], line 184
bra = cursor;
switch(among_var) {
case 0:
return false;
case 1:
// (, line 188
// delete, line 188
slice_del();
// [, line 189
ket = cursor;
// literal, line 189
if (!(eq_s_b(1, "\u043D")))
{
return false;
}
// ], line 189
bra = cursor;
// literal, line 189
if (!(eq_s_b(1, "\u043D")))
{
return false;
}
// delete, line 189
slice_del();
break;
case 2:
// (, line 192
// literal, line 192
if (!(eq_s_b(1, "\u043D")))
{
return false;
}
// delete, line 192
slice_del();
break;
case 3:
// (, line 194
// delete, line 194
slice_del();
break;
}
return true;
}
public boolean stem() {
int v_1;
int v_2;
int v_3;
int v_4;
int v_5;
int v_6;
int v_7;
int v_8;
int v_9;
int v_10;
// (, line 199
// do, line 201
v_1 = cursor;
lab0: do {
// call mark_regions, line 201
if (!r_mark_regions())
{
break lab0;
}
} while (false);
cursor = v_1;
// backwards, line 202
limit_backward = cursor; cursor = limit;
// setlimit, line 202
v_2 = limit - cursor;
// tomark, line 202
if (cursor < I_pV)
{
return false;
}
cursor = I_pV;
v_3 = limit_backward;
limit_backward = cursor;
cursor = limit - v_2;
// (, line 202
// do, line 203
v_4 = limit - cursor;
lab1: do {
// (, line 203
// or, line 204
lab2: do {
v_5 = limit - cursor;
lab3: do {
// call perfective_gerund, line 204
if (!r_perfective_gerund())
{
break lab3;
}
break lab2;
} while (false);
cursor = limit - v_5;
// (, line 205
// try, line 205
v_6 = limit - cursor;
lab4: do {
// call reflexive, line 205
if (!r_reflexive())
{
cursor = limit - v_6;
break lab4;
}
} while (false);
// or, line 206
lab5: do {
v_7 = limit - cursor;
lab6: do {
// call adjectival, line 206
if (!r_adjectival())
{
break lab6;
}
break lab5;
} while (false);
cursor = limit - v_7;
lab7: do {
// call verb, line 206
if (!r_verb())
{
break lab7;
}
break lab5;
} while (false);
cursor = limit - v_7;
// call noun, line 206
if (!r_noun())
{
break lab1;
}
} while (false);
} while (false);
} while (false);
cursor = limit - v_4;
// try, line 209
v_8 = limit - cursor;
lab8: do {
// (, line 209
// [, line 209
ket = cursor;
// literal, line 209
if (!(eq_s_b(1, "\u0438")))
{
cursor = limit - v_8;
break lab8;
}
// ], line 209
bra = cursor;
// delete, line 209
slice_del();
} while (false);
// do, line 212
v_9 = limit - cursor;
lab9: do {
// call derivational, line 212
if (!r_derivational())
{
break lab9;
}
} while (false);
cursor = limit - v_9;
// do, line 213
v_10 = limit - cursor;
lab10: do {
// call tidy_up, line 213
if (!r_tidy_up())
{
break lab10;
}
} while (false);
cursor = limit - v_10;
limit_backward = v_3;
cursor = limit_backward; return true;
}
public boolean equals( Object o ) {
return o instanceof russianStemmer;
}
public int hashCode() {
return russianStemmer.class.getName().hashCode();
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/stemmer
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/stemmer/snowball/spanishStemmer.java
|
// CHECKSTYLE:OFF
/*
Copyright (c) 2001, Dr Martin Porter
Copyright (c) 2002, Richard Boulton
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* Neither the name of the copyright holders nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
// This file was generated automatically by the Snowball to Java compiler
package opennlp.tools.stemmer.snowball;
/**
* This class was automatically generated by a Snowball to Java compiler
* It implements the stemming algorithm defined by a snowball script.
*/
class spanishStemmer extends opennlp.tools.stemmer.snowball.AbstractSnowballStemmer {
private final static spanishStemmer methodObject = new spanishStemmer ();
private final static Among a_0[] = {
new Among ( "", -1, 6, "", methodObject ),
new Among ( "\u00E1", 0, 1, "", methodObject ),
new Among ( "\u00E9", 0, 2, "", methodObject ),
new Among ( "\u00ED", 0, 3, "", methodObject ),
new Among ( "\u00F3", 0, 4, "", methodObject ),
new Among ( "\u00FA", 0, 5, "", methodObject )
};
private final static Among a_1[] = {
new Among ( "la", -1, -1, "", methodObject ),
new Among ( "sela", 0, -1, "", methodObject ),
new Among ( "le", -1, -1, "", methodObject ),
new Among ( "me", -1, -1, "", methodObject ),
new Among ( "se", -1, -1, "", methodObject ),
new Among ( "lo", -1, -1, "", methodObject ),
new Among ( "selo", 5, -1, "", methodObject ),
new Among ( "las", -1, -1, "", methodObject ),
new Among ( "selas", 7, -1, "", methodObject ),
new Among ( "les", -1, -1, "", methodObject ),
new Among ( "los", -1, -1, "", methodObject ),
new Among ( "selos", 10, -1, "", methodObject ),
new Among ( "nos", -1, -1, "", methodObject )
};
private final static Among a_2[] = {
new Among ( "ando", -1, 6, "", methodObject ),
new Among ( "iendo", -1, 6, "", methodObject ),
new Among ( "yendo", -1, 7, "", methodObject ),
new Among ( "\u00E1ndo", -1, 2, "", methodObject ),
new Among ( "i\u00E9ndo", -1, 1, "", methodObject ),
new Among ( "ar", -1, 6, "", methodObject ),
new Among ( "er", -1, 6, "", methodObject ),
new Among ( "ir", -1, 6, "", methodObject ),
new Among ( "\u00E1r", -1, 3, "", methodObject ),
new Among ( "\u00E9r", -1, 4, "", methodObject ),
new Among ( "\u00EDr", -1, 5, "", methodObject )
};
private final static Among a_3[] = {
new Among ( "ic", -1, -1, "", methodObject ),
new Among ( "ad", -1, -1, "", methodObject ),
new Among ( "os", -1, -1, "", methodObject ),
new Among ( "iv", -1, 1, "", methodObject )
};
private final static Among a_4[] = {
new Among ( "able", -1, 1, "", methodObject ),
new Among ( "ible", -1, 1, "", methodObject ),
new Among ( "ante", -1, 1, "", methodObject )
};
private final static Among a_5[] = {
new Among ( "ic", -1, 1, "", methodObject ),
new Among ( "abil", -1, 1, "", methodObject ),
new Among ( "iv", -1, 1, "", methodObject )
};
private final static Among a_6[] = {
new Among ( "ica", -1, 1, "", methodObject ),
new Among ( "ancia", -1, 2, "", methodObject ),
new Among ( "encia", -1, 5, "", methodObject ),
new Among ( "adora", -1, 2, "", methodObject ),
new Among ( "osa", -1, 1, "", methodObject ),
new Among ( "ista", -1, 1, "", methodObject ),
new Among ( "iva", -1, 9, "", methodObject ),
new Among ( "anza", -1, 1, "", methodObject ),
new Among ( "log\u00EDa", -1, 3, "", methodObject ),
new Among ( "idad", -1, 8, "", methodObject ),
new Among ( "able", -1, 1, "", methodObject ),
new Among ( "ible", -1, 1, "", methodObject ),
new Among ( "ante", -1, 2, "", methodObject ),
new Among ( "mente", -1, 7, "", methodObject ),
new Among ( "amente", 13, 6, "", methodObject ),
new Among ( "aci\u00F3n", -1, 2, "", methodObject ),
new Among ( "uci\u00F3n", -1, 4, "", methodObject ),
new Among ( "ico", -1, 1, "", methodObject ),
new Among ( "ismo", -1, 1, "", methodObject ),
new Among ( "oso", -1, 1, "", methodObject ),
new Among ( "amiento", -1, 1, "", methodObject ),
new Among ( "imiento", -1, 1, "", methodObject ),
new Among ( "ivo", -1, 9, "", methodObject ),
new Among ( "ador", -1, 2, "", methodObject ),
new Among ( "icas", -1, 1, "", methodObject ),
new Among ( "ancias", -1, 2, "", methodObject ),
new Among ( "encias", -1, 5, "", methodObject ),
new Among ( "adoras", -1, 2, "", methodObject ),
new Among ( "osas", -1, 1, "", methodObject ),
new Among ( "istas", -1, 1, "", methodObject ),
new Among ( "ivas", -1, 9, "", methodObject ),
new Among ( "anzas", -1, 1, "", methodObject ),
new Among ( "log\u00EDas", -1, 3, "", methodObject ),
new Among ( "idades", -1, 8, "", methodObject ),
new Among ( "ables", -1, 1, "", methodObject ),
new Among ( "ibles", -1, 1, "", methodObject ),
new Among ( "aciones", -1, 2, "", methodObject ),
new Among ( "uciones", -1, 4, "", methodObject ),
new Among ( "adores", -1, 2, "", methodObject ),
new Among ( "antes", -1, 2, "", methodObject ),
new Among ( "icos", -1, 1, "", methodObject ),
new Among ( "ismos", -1, 1, "", methodObject ),
new Among ( "osos", -1, 1, "", methodObject ),
new Among ( "amientos", -1, 1, "", methodObject ),
new Among ( "imientos", -1, 1, "", methodObject ),
new Among ( "ivos", -1, 9, "", methodObject )
};
private final static Among a_7[] = {
new Among ( "ya", -1, 1, "", methodObject ),
new Among ( "ye", -1, 1, "", methodObject ),
new Among ( "yan", -1, 1, "", methodObject ),
new Among ( "yen", -1, 1, "", methodObject ),
new Among ( "yeron", -1, 1, "", methodObject ),
new Among ( "yendo", -1, 1, "", methodObject ),
new Among ( "yo", -1, 1, "", methodObject ),
new Among ( "yas", -1, 1, "", methodObject ),
new Among ( "yes", -1, 1, "", methodObject ),
new Among ( "yais", -1, 1, "", methodObject ),
new Among ( "yamos", -1, 1, "", methodObject ),
new Among ( "y\u00F3", -1, 1, "", methodObject )
};
private final static Among a_8[] = {
new Among ( "aba", -1, 2, "", methodObject ),
new Among ( "ada", -1, 2, "", methodObject ),
new Among ( "ida", -1, 2, "", methodObject ),
new Among ( "ara", -1, 2, "", methodObject ),
new Among ( "iera", -1, 2, "", methodObject ),
new Among ( "\u00EDa", -1, 2, "", methodObject ),
new Among ( "ar\u00EDa", 5, 2, "", methodObject ),
new Among ( "er\u00EDa", 5, 2, "", methodObject ),
new Among ( "ir\u00EDa", 5, 2, "", methodObject ),
new Among ( "ad", -1, 2, "", methodObject ),
new Among ( "ed", -1, 2, "", methodObject ),
new Among ( "id", -1, 2, "", methodObject ),
new Among ( "ase", -1, 2, "", methodObject ),
new Among ( "iese", -1, 2, "", methodObject ),
new Among ( "aste", -1, 2, "", methodObject ),
new Among ( "iste", -1, 2, "", methodObject ),
new Among ( "an", -1, 2, "", methodObject ),
new Among ( "aban", 16, 2, "", methodObject ),
new Among ( "aran", 16, 2, "", methodObject ),
new Among ( "ieran", 16, 2, "", methodObject ),
new Among ( "\u00EDan", 16, 2, "", methodObject ),
new Among ( "ar\u00EDan", 20, 2, "", methodObject ),
new Among ( "er\u00EDan", 20, 2, "", methodObject ),
new Among ( "ir\u00EDan", 20, 2, "", methodObject ),
new Among ( "en", -1, 1, "", methodObject ),
new Among ( "asen", 24, 2, "", methodObject ),
new Among ( "iesen", 24, 2, "", methodObject ),
new Among ( "aron", -1, 2, "", methodObject ),
new Among ( "ieron", -1, 2, "", methodObject ),
new Among ( "ar\u00E1n", -1, 2, "", methodObject ),
new Among ( "er\u00E1n", -1, 2, "", methodObject ),
new Among ( "ir\u00E1n", -1, 2, "", methodObject ),
new Among ( "ado", -1, 2, "", methodObject ),
new Among ( "ido", -1, 2, "", methodObject ),
new Among ( "ando", -1, 2, "", methodObject ),
new Among ( "iendo", -1, 2, "", methodObject ),
new Among ( "ar", -1, 2, "", methodObject ),
new Among ( "er", -1, 2, "", methodObject ),
new Among ( "ir", -1, 2, "", methodObject ),
new Among ( "as", -1, 2, "", methodObject ),
new Among ( "abas", 39, 2, "", methodObject ),
new Among ( "adas", 39, 2, "", methodObject ),
new Among ( "idas", 39, 2, "", methodObject ),
new Among ( "aras", 39, 2, "", methodObject ),
new Among ( "ieras", 39, 2, "", methodObject ),
new Among ( "\u00EDas", 39, 2, "", methodObject ),
new Among ( "ar\u00EDas", 45, 2, "", methodObject ),
new Among ( "er\u00EDas", 45, 2, "", methodObject ),
new Among ( "ir\u00EDas", 45, 2, "", methodObject ),
new Among ( "es", -1, 1, "", methodObject ),
new Among ( "ases", 49, 2, "", methodObject ),
new Among ( "ieses", 49, 2, "", methodObject ),
new Among ( "abais", -1, 2, "", methodObject ),
new Among ( "arais", -1, 2, "", methodObject ),
new Among ( "ierais", -1, 2, "", methodObject ),
new Among ( "\u00EDais", -1, 2, "", methodObject ),
new Among ( "ar\u00EDais", 55, 2, "", methodObject ),
new Among ( "er\u00EDais", 55, 2, "", methodObject ),
new Among ( "ir\u00EDais", 55, 2, "", methodObject ),
new Among ( "aseis", -1, 2, "", methodObject ),
new Among ( "ieseis", -1, 2, "", methodObject ),
new Among ( "asteis", -1, 2, "", methodObject ),
new Among ( "isteis", -1, 2, "", methodObject ),
new Among ( "\u00E1is", -1, 2, "", methodObject ),
new Among ( "\u00E9is", -1, 1, "", methodObject ),
new Among ( "ar\u00E9is", 64, 2, "", methodObject ),
new Among ( "er\u00E9is", 64, 2, "", methodObject ),
new Among ( "ir\u00E9is", 64, 2, "", methodObject ),
new Among ( "ados", -1, 2, "", methodObject ),
new Among ( "idos", -1, 2, "", methodObject ),
new Among ( "amos", -1, 2, "", methodObject ),
new Among ( "\u00E1bamos", 70, 2, "", methodObject ),
new Among ( "\u00E1ramos", 70, 2, "", methodObject ),
new Among ( "i\u00E9ramos", 70, 2, "", methodObject ),
new Among ( "\u00EDamos", 70, 2, "", methodObject ),
new Among ( "ar\u00EDamos", 74, 2, "", methodObject ),
new Among ( "er\u00EDamos", 74, 2, "", methodObject ),
new Among ( "ir\u00EDamos", 74, 2, "", methodObject ),
new Among ( "emos", -1, 1, "", methodObject ),
new Among ( "aremos", 78, 2, "", methodObject ),
new Among ( "eremos", 78, 2, "", methodObject ),
new Among ( "iremos", 78, 2, "", methodObject ),
new Among ( "\u00E1semos", 78, 2, "", methodObject ),
new Among ( "i\u00E9semos", 78, 2, "", methodObject ),
new Among ( "imos", -1, 2, "", methodObject ),
new Among ( "ar\u00E1s", -1, 2, "", methodObject ),
new Among ( "er\u00E1s", -1, 2, "", methodObject ),
new Among ( "ir\u00E1s", -1, 2, "", methodObject ),
new Among ( "\u00EDs", -1, 2, "", methodObject ),
new Among ( "ar\u00E1", -1, 2, "", methodObject ),
new Among ( "er\u00E1", -1, 2, "", methodObject ),
new Among ( "ir\u00E1", -1, 2, "", methodObject ),
new Among ( "ar\u00E9", -1, 2, "", methodObject ),
new Among ( "er\u00E9", -1, 2, "", methodObject ),
new Among ( "ir\u00E9", -1, 2, "", methodObject ),
new Among ( "i\u00F3", -1, 2, "", methodObject )
};
private final static Among a_9[] = {
new Among ( "a", -1, 1, "", methodObject ),
new Among ( "e", -1, 2, "", methodObject ),
new Among ( "o", -1, 1, "", methodObject ),
new Among ( "os", -1, 1, "", methodObject ),
new Among ( "\u00E1", -1, 1, "", methodObject ),
new Among ( "\u00E9", -1, 2, "", methodObject ),
new Among ( "\u00ED", -1, 1, "", methodObject ),
new Among ( "\u00F3", -1, 1, "", methodObject )
};
private static final char g_v[] = {17, 65, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 17, 4, 10 };
private int I_p2;
private int I_p1;
private int I_pV;
private void copy_from(spanishStemmer other) {
I_p2 = other.I_p2;
I_p1 = other.I_p1;
I_pV = other.I_pV;
super.copy_from(other);
}
private boolean r_mark_regions() {
int v_1;
int v_2;
int v_3;
int v_6;
int v_8;
// (, line 31
I_pV = limit;
I_p1 = limit;
I_p2 = limit;
// do, line 37
v_1 = cursor;
lab0: do {
// (, line 37
// or, line 39
lab1: do {
v_2 = cursor;
lab2: do {
// (, line 38
if (!(in_grouping(g_v, 97, 252)))
{
break lab2;
}
// or, line 38
lab3: do {
v_3 = cursor;
lab4: do {
// (, line 38
if (!(out_grouping(g_v, 97, 252)))
{
break lab4;
}
// gopast, line 38
golab5: while(true)
{
lab6: do {
if (!(in_grouping(g_v, 97, 252)))
{
break lab6;
}
break golab5;
} while (false);
if (cursor >= limit)
{
break lab4;
}
cursor++;
}
break lab3;
} while (false);
cursor = v_3;
// (, line 38
if (!(in_grouping(g_v, 97, 252)))
{
break lab2;
}
// gopast, line 38
golab7: while(true)
{
lab8: do {
if (!(out_grouping(g_v, 97, 252)))
{
break lab8;
}
break golab7;
} while (false);
if (cursor >= limit)
{
break lab2;
}
cursor++;
}
} while (false);
break lab1;
} while (false);
cursor = v_2;
// (, line 40
if (!(out_grouping(g_v, 97, 252)))
{
break lab0;
}
// or, line 40
lab9: do {
v_6 = cursor;
lab10: do {
// (, line 40
if (!(out_grouping(g_v, 97, 252)))
{
break lab10;
}
// gopast, line 40
golab11: while(true)
{
lab12: do {
if (!(in_grouping(g_v, 97, 252)))
{
break lab12;
}
break golab11;
} while (false);
if (cursor >= limit)
{
break lab10;
}
cursor++;
}
break lab9;
} while (false);
cursor = v_6;
// (, line 40
if (!(in_grouping(g_v, 97, 252)))
{
break lab0;
}
// next, line 40
if (cursor >= limit)
{
break lab0;
}
cursor++;
} while (false);
} while (false);
// setmark pV, line 41
I_pV = cursor;
} while (false);
cursor = v_1;
// do, line 43
v_8 = cursor;
lab13: do {
// (, line 43
// gopast, line 44
golab14: while(true)
{
lab15: do {
if (!(in_grouping(g_v, 97, 252)))
{
break lab15;
}
break golab14;
} while (false);
if (cursor >= limit)
{
break lab13;
}
cursor++;
}
// gopast, line 44
golab16: while(true)
{
lab17: do {
if (!(out_grouping(g_v, 97, 252)))
{
break lab17;
}
break golab16;
} while (false);
if (cursor >= limit)
{
break lab13;
}
cursor++;
}
// setmark p1, line 44
I_p1 = cursor;
// gopast, line 45
golab18: while(true)
{
lab19: do {
if (!(in_grouping(g_v, 97, 252)))
{
break lab19;
}
break golab18;
} while (false);
if (cursor >= limit)
{
break lab13;
}
cursor++;
}
// gopast, line 45
golab20: while(true)
{
lab21: do {
if (!(out_grouping(g_v, 97, 252)))
{
break lab21;
}
break golab20;
} while (false);
if (cursor >= limit)
{
break lab13;
}
cursor++;
}
// setmark p2, line 45
I_p2 = cursor;
} while (false);
cursor = v_8;
return true;
}
private boolean r_postlude() {
int among_var;
int v_1;
// repeat, line 49
replab0: while(true)
{
v_1 = cursor;
lab1: do {
// (, line 49
// [, line 50
bra = cursor;
// substring, line 50
among_var = find_among(a_0, 6);
if (among_var == 0)
{
break lab1;
}
// ], line 50
ket = cursor;
switch(among_var) {
case 0:
break lab1;
case 1:
// (, line 51
// <-, line 51
slice_from("a");
break;
case 2:
// (, line 52
// <-, line 52
slice_from("e");
break;
case 3:
// (, line 53
// <-, line 53
slice_from("i");
break;
case 4:
// (, line 54
// <-, line 54
slice_from("o");
break;
case 5:
// (, line 55
// <-, line 55
slice_from("u");
break;
case 6:
// (, line 57
// next, line 57
if (cursor >= limit)
{
break lab1;
}
cursor++;
break;
}
continue replab0;
} while (false);
cursor = v_1;
break replab0;
}
return true;
}
private boolean r_RV() {
if (!(I_pV <= cursor))
{
return false;
}
return true;
}
private boolean r_R1() {
if (!(I_p1 <= cursor))
{
return false;
}
return true;
}
private boolean r_R2() {
if (!(I_p2 <= cursor))
{
return false;
}
return true;
}
private boolean r_attached_pronoun() {
int among_var;
// (, line 67
// [, line 68
ket = cursor;
// substring, line 68
if (find_among_b(a_1, 13) == 0)
{
return false;
}
// ], line 68
bra = cursor;
// substring, line 72
among_var = find_among_b(a_2, 11);
if (among_var == 0)
{
return false;
}
// call RV, line 72
if (!r_RV())
{
return false;
}
switch(among_var) {
case 0:
return false;
case 1:
// (, line 73
// ], line 73
bra = cursor;
// <-, line 73
slice_from("iendo");
break;
case 2:
// (, line 74
// ], line 74
bra = cursor;
// <-, line 74
slice_from("ando");
break;
case 3:
// (, line 75
// ], line 75
bra = cursor;
// <-, line 75
slice_from("ar");
break;
case 4:
// (, line 76
// ], line 76
bra = cursor;
// <-, line 76
slice_from("er");
break;
case 5:
// (, line 77
// ], line 77
bra = cursor;
// <-, line 77
slice_from("ir");
break;
case 6:
// (, line 81
// delete, line 81
slice_del();
break;
case 7:
// (, line 82
// literal, line 82
if (!(eq_s_b(1, "u")))
{
return false;
}
// delete, line 82
slice_del();
break;
}
return true;
}
private boolean r_standard_suffix() {
int among_var;
int v_1;
int v_2;
int v_3;
int v_4;
int v_5;
// (, line 86
// [, line 87
ket = cursor;
// substring, line 87
among_var = find_among_b(a_6, 46);
if (among_var == 0)
{
return false;
}
// ], line 87
bra = cursor;
switch(among_var) {
case 0:
return false;
case 1:
// (, line 98
// call R2, line 99
if (!r_R2())
{
return false;
}
// delete, line 99
slice_del();
break;
case 2:
// (, line 104
// call R2, line 105
if (!r_R2())
{
return false;
}
// delete, line 105
slice_del();
// try, line 106
v_1 = limit - cursor;
lab0: do {
// (, line 106
// [, line 106
ket = cursor;
// literal, line 106
if (!(eq_s_b(2, "ic")))
{
cursor = limit - v_1;
break lab0;
}
// ], line 106
bra = cursor;
// call R2, line 106
if (!r_R2())
{
cursor = limit - v_1;
break lab0;
}
// delete, line 106
slice_del();
} while (false);
break;
case 3:
// (, line 110
// call R2, line 111
if (!r_R2())
{
return false;
}
// <-, line 111
slice_from("log");
break;
case 4:
// (, line 114
// call R2, line 115
if (!r_R2())
{
return false;
}
// <-, line 115
slice_from("u");
break;
case 5:
// (, line 118
// call R2, line 119
if (!r_R2())
{
return false;
}
// <-, line 119
slice_from("ente");
break;
case 6:
// (, line 122
// call R1, line 123
if (!r_R1())
{
return false;
}
// delete, line 123
slice_del();
// try, line 124
v_2 = limit - cursor;
lab1: do {
// (, line 124
// [, line 125
ket = cursor;
// substring, line 125
among_var = find_among_b(a_3, 4);
if (among_var == 0)
{
cursor = limit - v_2;
break lab1;
}
// ], line 125
bra = cursor;
// call R2, line 125
if (!r_R2())
{
cursor = limit - v_2;
break lab1;
}
// delete, line 125
slice_del();
switch(among_var) {
case 0:
cursor = limit - v_2;
break lab1;
case 1:
// (, line 126
// [, line 126
ket = cursor;
// literal, line 126
if (!(eq_s_b(2, "at")))
{
cursor = limit - v_2;
break lab1;
}
// ], line 126
bra = cursor;
// call R2, line 126
if (!r_R2())
{
cursor = limit - v_2;
break lab1;
}
// delete, line 126
slice_del();
break;
}
} while (false);
break;
case 7:
// (, line 134
// call R2, line 135
if (!r_R2())
{
return false;
}
// delete, line 135
slice_del();
// try, line 136
v_3 = limit - cursor;
lab2: do {
// (, line 136
// [, line 137
ket = cursor;
// substring, line 137
among_var = find_among_b(a_4, 3);
if (among_var == 0)
{
cursor = limit - v_3;
break lab2;
}
// ], line 137
bra = cursor;
switch(among_var) {
case 0:
cursor = limit - v_3;
break lab2;
case 1:
// (, line 140
// call R2, line 140
if (!r_R2())
{
cursor = limit - v_3;
break lab2;
}
// delete, line 140
slice_del();
break;
}
} while (false);
break;
case 8:
// (, line 146
// call R2, line 147
if (!r_R2())
{
return false;
}
// delete, line 147
slice_del();
// try, line 148
v_4 = limit - cursor;
lab3: do {
// (, line 148
// [, line 149
ket = cursor;
// substring, line 149
among_var = find_among_b(a_5, 3);
if (among_var == 0)
{
cursor = limit - v_4;
break lab3;
}
// ], line 149
bra = cursor;
switch(among_var) {
case 0:
cursor = limit - v_4;
break lab3;
case 1:
// (, line 152
// call R2, line 152
if (!r_R2())
{
cursor = limit - v_4;
break lab3;
}
// delete, line 152
slice_del();
break;
}
} while (false);
break;
case 9:
// (, line 158
// call R2, line 159
if (!r_R2())
{
return false;
}
// delete, line 159
slice_del();
// try, line 160
v_5 = limit - cursor;
lab4: do {
// (, line 160
// [, line 161
ket = cursor;
// literal, line 161
if (!(eq_s_b(2, "at")))
{
cursor = limit - v_5;
break lab4;
}
// ], line 161
bra = cursor;
// call R2, line 161
if (!r_R2())
{
cursor = limit - v_5;
break lab4;
}
// delete, line 161
slice_del();
} while (false);
break;
}
return true;
}
private boolean r_y_verb_suffix() {
int among_var;
int v_1;
int v_2;
// (, line 167
// setlimit, line 168
v_1 = limit - cursor;
// tomark, line 168
if (cursor < I_pV)
{
return false;
}
cursor = I_pV;
v_2 = limit_backward;
limit_backward = cursor;
cursor = limit - v_1;
// (, line 168
// [, line 168
ket = cursor;
// substring, line 168
among_var = find_among_b(a_7, 12);
if (among_var == 0)
{
limit_backward = v_2;
return false;
}
// ], line 168
bra = cursor;
limit_backward = v_2;
switch(among_var) {
case 0:
return false;
case 1:
// (, line 171
// literal, line 171
if (!(eq_s_b(1, "u")))
{
return false;
}
// delete, line 171
slice_del();
break;
}
return true;
}
private boolean r_verb_suffix() {
int among_var;
int v_1;
int v_2;
int v_3;
int v_4;
// (, line 175
// setlimit, line 176
v_1 = limit - cursor;
// tomark, line 176
if (cursor < I_pV)
{
return false;
}
cursor = I_pV;
v_2 = limit_backward;
limit_backward = cursor;
cursor = limit - v_1;
// (, line 176
// [, line 176
ket = cursor;
// substring, line 176
among_var = find_among_b(a_8, 96);
if (among_var == 0)
{
limit_backward = v_2;
return false;
}
// ], line 176
bra = cursor;
limit_backward = v_2;
switch(among_var) {
case 0:
return false;
case 1:
// (, line 179
// try, line 179
v_3 = limit - cursor;
lab0: do {
// (, line 179
// literal, line 179
if (!(eq_s_b(1, "u")))
{
cursor = limit - v_3;
break lab0;
}
// test, line 179
v_4 = limit - cursor;
// literal, line 179
if (!(eq_s_b(1, "g")))
{
cursor = limit - v_3;
break lab0;
}
cursor = limit - v_4;
} while (false);
// ], line 179
bra = cursor;
// delete, line 179
slice_del();
break;
case 2:
// (, line 200
// delete, line 200
slice_del();
break;
}
return true;
}
private boolean r_residual_suffix() {
int among_var;
int v_1;
int v_2;
// (, line 204
// [, line 205
ket = cursor;
// substring, line 205
among_var = find_among_b(a_9, 8);
if (among_var == 0)
{
return false;
}
// ], line 205
bra = cursor;
switch(among_var) {
case 0:
return false;
case 1:
// (, line 208
// call RV, line 208
if (!r_RV())
{
return false;
}
// delete, line 208
slice_del();
break;
case 2:
// (, line 210
// call RV, line 210
if (!r_RV())
{
return false;
}
// delete, line 210
slice_del();
// try, line 210
v_1 = limit - cursor;
lab0: do {
// (, line 210
// [, line 210
ket = cursor;
// literal, line 210
if (!(eq_s_b(1, "u")))
{
cursor = limit - v_1;
break lab0;
}
// ], line 210
bra = cursor;
// test, line 210
v_2 = limit - cursor;
// literal, line 210
if (!(eq_s_b(1, "g")))
{
cursor = limit - v_1;
break lab0;
}
cursor = limit - v_2;
// call RV, line 210
if (!r_RV())
{
cursor = limit - v_1;
break lab0;
}
// delete, line 210
slice_del();
} while (false);
break;
}
return true;
}
public boolean stem() {
int v_1;
int v_2;
int v_3;
int v_4;
int v_5;
int v_6;
// (, line 215
// do, line 216
v_1 = cursor;
lab0: do {
// call mark_regions, line 216
if (!r_mark_regions())
{
break lab0;
}
} while (false);
cursor = v_1;
// backwards, line 217
limit_backward = cursor; cursor = limit;
// (, line 217
// do, line 218
v_2 = limit - cursor;
lab1: do {
// call attached_pronoun, line 218
if (!r_attached_pronoun())
{
break lab1;
}
} while (false);
cursor = limit - v_2;
// do, line 219
v_3 = limit - cursor;
lab2: do {
// (, line 219
// or, line 219
lab3: do {
v_4 = limit - cursor;
lab4: do {
// call standard_suffix, line 219
if (!r_standard_suffix())
{
break lab4;
}
break lab3;
} while (false);
cursor = limit - v_4;
lab5: do {
// call y_verb_suffix, line 220
if (!r_y_verb_suffix())
{
break lab5;
}
break lab3;
} while (false);
cursor = limit - v_4;
// call verb_suffix, line 221
if (!r_verb_suffix())
{
break lab2;
}
} while (false);
} while (false);
cursor = limit - v_3;
// do, line 223
v_5 = limit - cursor;
lab6: do {
// call residual_suffix, line 223
if (!r_residual_suffix())
{
break lab6;
}
} while (false);
cursor = limit - v_5;
cursor = limit_backward; // do, line 225
v_6 = cursor;
lab7: do {
// call postlude, line 225
if (!r_postlude())
{
break lab7;
}
} while (false);
cursor = v_6;
return true;
}
public boolean equals( Object o ) {
return o instanceof spanishStemmer;
}
public int hashCode() {
return spanishStemmer.class.getName().hashCode();
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/stemmer
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/stemmer/snowball/swedishStemmer.java
|
// CHECKSTYLE:OFF
/*
Copyright (c) 2001, Dr Martin Porter
Copyright (c) 2002, Richard Boulton
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* Neither the name of the copyright holders nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
// This file was generated automatically by the Snowball to Java compiler
package opennlp.tools.stemmer.snowball;
/**
* This class was automatically generated by a Snowball to Java compiler
* It implements the stemming algorithm defined by a snowball script.
*/
class swedishStemmer extends opennlp.tools.stemmer.snowball.AbstractSnowballStemmer {
private final static swedishStemmer methodObject = new swedishStemmer ();
private final static Among a_0[] = {
new Among ( "a", -1, 1, "", methodObject ),
new Among ( "arna", 0, 1, "", methodObject ),
new Among ( "erna", 0, 1, "", methodObject ),
new Among ( "heterna", 2, 1, "", methodObject ),
new Among ( "orna", 0, 1, "", methodObject ),
new Among ( "ad", -1, 1, "", methodObject ),
new Among ( "e", -1, 1, "", methodObject ),
new Among ( "ade", 6, 1, "", methodObject ),
new Among ( "ande", 6, 1, "", methodObject ),
new Among ( "arne", 6, 1, "", methodObject ),
new Among ( "are", 6, 1, "", methodObject ),
new Among ( "aste", 6, 1, "", methodObject ),
new Among ( "en", -1, 1, "", methodObject ),
new Among ( "anden", 12, 1, "", methodObject ),
new Among ( "aren", 12, 1, "", methodObject ),
new Among ( "heten", 12, 1, "", methodObject ),
new Among ( "ern", -1, 1, "", methodObject ),
new Among ( "ar", -1, 1, "", methodObject ),
new Among ( "er", -1, 1, "", methodObject ),
new Among ( "heter", 18, 1, "", methodObject ),
new Among ( "or", -1, 1, "", methodObject ),
new Among ( "s", -1, 2, "", methodObject ),
new Among ( "as", 21, 1, "", methodObject ),
new Among ( "arnas", 22, 1, "", methodObject ),
new Among ( "ernas", 22, 1, "", methodObject ),
new Among ( "ornas", 22, 1, "", methodObject ),
new Among ( "es", 21, 1, "", methodObject ),
new Among ( "ades", 26, 1, "", methodObject ),
new Among ( "andes", 26, 1, "", methodObject ),
new Among ( "ens", 21, 1, "", methodObject ),
new Among ( "arens", 29, 1, "", methodObject ),
new Among ( "hetens", 29, 1, "", methodObject ),
new Among ( "erns", 21, 1, "", methodObject ),
new Among ( "at", -1, 1, "", methodObject ),
new Among ( "andet", -1, 1, "", methodObject ),
new Among ( "het", -1, 1, "", methodObject ),
new Among ( "ast", -1, 1, "", methodObject )
};
private final static Among a_1[] = {
new Among ( "dd", -1, -1, "", methodObject ),
new Among ( "gd", -1, -1, "", methodObject ),
new Among ( "nn", -1, -1, "", methodObject ),
new Among ( "dt", -1, -1, "", methodObject ),
new Among ( "gt", -1, -1, "", methodObject ),
new Among ( "kt", -1, -1, "", methodObject ),
new Among ( "tt", -1, -1, "", methodObject )
};
private final static Among a_2[] = {
new Among ( "ig", -1, 1, "", methodObject ),
new Among ( "lig", 0, 1, "", methodObject ),
new Among ( "els", -1, 1, "", methodObject ),
new Among ( "fullt", -1, 3, "", methodObject ),
new Among ( "l\u00F6st", -1, 2, "", methodObject )
};
private static final char g_v[] = {17, 65, 16, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 24, 0, 32 };
private static final char g_s_ending[] = {119, 127, 149 };
private int I_x;
private int I_p1;
private void copy_from(swedishStemmer other) {
I_x = other.I_x;
I_p1 = other.I_p1;
super.copy_from(other);
}
private boolean r_mark_regions() {
int v_1;
int v_2;
// (, line 26
I_p1 = limit;
// test, line 29
v_1 = cursor;
// (, line 29
// hop, line 29
{
int c = cursor + 3;
if (0 > c || c > limit)
{
return false;
}
cursor = c;
}
// setmark x, line 29
I_x = cursor;
cursor = v_1;
// goto, line 30
golab0: while(true)
{
v_2 = cursor;
lab1: do {
if (!(in_grouping(g_v, 97, 246)))
{
break lab1;
}
cursor = v_2;
break golab0;
} while (false);
cursor = v_2;
if (cursor >= limit)
{
return false;
}
cursor++;
}
// gopast, line 30
golab2: while(true)
{
lab3: do {
if (!(out_grouping(g_v, 97, 246)))
{
break lab3;
}
break golab2;
} while (false);
if (cursor >= limit)
{
return false;
}
cursor++;
}
// setmark p1, line 30
I_p1 = cursor;
// try, line 31
lab4: do {
// (, line 31
if (!(I_p1 < I_x))
{
break lab4;
}
I_p1 = I_x;
} while (false);
return true;
}
private boolean r_main_suffix() {
int among_var;
int v_1;
int v_2;
// (, line 36
// setlimit, line 37
v_1 = limit - cursor;
// tomark, line 37
if (cursor < I_p1)
{
return false;
}
cursor = I_p1;
v_2 = limit_backward;
limit_backward = cursor;
cursor = limit - v_1;
// (, line 37
// [, line 37
ket = cursor;
// substring, line 37
among_var = find_among_b(a_0, 37);
if (among_var == 0)
{
limit_backward = v_2;
return false;
}
// ], line 37
bra = cursor;
limit_backward = v_2;
switch(among_var) {
case 0:
return false;
case 1:
// (, line 44
// delete, line 44
slice_del();
break;
case 2:
// (, line 46
if (!(in_grouping_b(g_s_ending, 98, 121)))
{
return false;
}
// delete, line 46
slice_del();
break;
}
return true;
}
private boolean r_consonant_pair() {
int v_1;
int v_2;
int v_3;
// setlimit, line 50
v_1 = limit - cursor;
// tomark, line 50
if (cursor < I_p1)
{
return false;
}
cursor = I_p1;
v_2 = limit_backward;
limit_backward = cursor;
cursor = limit - v_1;
// (, line 50
// and, line 52
v_3 = limit - cursor;
// among, line 51
if (find_among_b(a_1, 7) == 0)
{
limit_backward = v_2;
return false;
}
cursor = limit - v_3;
// (, line 52
// [, line 52
ket = cursor;
// next, line 52
if (cursor <= limit_backward)
{
limit_backward = v_2;
return false;
}
cursor--;
// ], line 52
bra = cursor;
// delete, line 52
slice_del();
limit_backward = v_2;
return true;
}
private boolean r_other_suffix() {
int among_var;
int v_1;
int v_2;
// setlimit, line 55
v_1 = limit - cursor;
// tomark, line 55
if (cursor < I_p1)
{
return false;
}
cursor = I_p1;
v_2 = limit_backward;
limit_backward = cursor;
cursor = limit - v_1;
// (, line 55
// [, line 56
ket = cursor;
// substring, line 56
among_var = find_among_b(a_2, 5);
if (among_var == 0)
{
limit_backward = v_2;
return false;
}
// ], line 56
bra = cursor;
switch(among_var) {
case 0:
limit_backward = v_2;
return false;
case 1:
// (, line 57
// delete, line 57
slice_del();
break;
case 2:
// (, line 58
// <-, line 58
slice_from("l\u00F6s");
break;
case 3:
// (, line 59
// <-, line 59
slice_from("full");
break;
}
limit_backward = v_2;
return true;
}
public boolean stem() {
int v_1;
int v_2;
int v_3;
int v_4;
// (, line 64
// do, line 66
v_1 = cursor;
lab0: do {
// call mark_regions, line 66
if (!r_mark_regions())
{
break lab0;
}
} while (false);
cursor = v_1;
// backwards, line 67
limit_backward = cursor; cursor = limit;
// (, line 67
// do, line 68
v_2 = limit - cursor;
lab1: do {
// call main_suffix, line 68
if (!r_main_suffix())
{
break lab1;
}
} while (false);
cursor = limit - v_2;
// do, line 69
v_3 = limit - cursor;
lab2: do {
// call consonant_pair, line 69
if (!r_consonant_pair())
{
break lab2;
}
} while (false);
cursor = limit - v_3;
// do, line 70
v_4 = limit - cursor;
lab3: do {
// call other_suffix, line 70
if (!r_other_suffix())
{
break lab3;
}
} while (false);
cursor = limit - v_4;
cursor = limit_backward; return true;
}
public boolean equals( Object o ) {
return o instanceof swedishStemmer;
}
public int hashCode() {
return swedishStemmer.class.getName().hashCode();
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/stemmer
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/stemmer/snowball/turkishStemmer.java
|
// CHECKSTYLE:OFF
/*
Copyright (c) 2001, Dr Martin Porter
Copyright (c) 2002, Richard Boulton
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* Neither the name of the copyright holders nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
// This file was generated automatically by the Snowball to Java compiler
package opennlp.tools.stemmer.snowball;
/**
* This class was automatically generated by a Snowball to Java compiler
* It implements the stemming algorithm defined by a snowball script.
*/
class turkishStemmer extends opennlp.tools.stemmer.snowball.AbstractSnowballStemmer {
private final static turkishStemmer methodObject = new turkishStemmer ();
private final static Among a_0[] = {
new Among ( "m", -1, -1, "", methodObject ),
new Among ( "n", -1, -1, "", methodObject ),
new Among ( "miz", -1, -1, "", methodObject ),
new Among ( "niz", -1, -1, "", methodObject ),
new Among ( "muz", -1, -1, "", methodObject ),
new Among ( "nuz", -1, -1, "", methodObject ),
new Among ( "m\u00FCz", -1, -1, "", methodObject ),
new Among ( "n\u00FCz", -1, -1, "", methodObject ),
new Among ( "m\u0131z", -1, -1, "", methodObject ),
new Among ( "n\u0131z", -1, -1, "", methodObject )
};
private final static Among a_1[] = {
new Among ( "leri", -1, -1, "", methodObject ),
new Among ( "lar\u0131", -1, -1, "", methodObject )
};
private final static Among a_2[] = {
new Among ( "ni", -1, -1, "", methodObject ),
new Among ( "nu", -1, -1, "", methodObject ),
new Among ( "n\u00FC", -1, -1, "", methodObject ),
new Among ( "n\u0131", -1, -1, "", methodObject )
};
private final static Among a_3[] = {
new Among ( "in", -1, -1, "", methodObject ),
new Among ( "un", -1, -1, "", methodObject ),
new Among ( "\u00FCn", -1, -1, "", methodObject ),
new Among ( "\u0131n", -1, -1, "", methodObject )
};
private final static Among a_4[] = {
new Among ( "a", -1, -1, "", methodObject ),
new Among ( "e", -1, -1, "", methodObject )
};
private final static Among a_5[] = {
new Among ( "na", -1, -1, "", methodObject ),
new Among ( "ne", -1, -1, "", methodObject )
};
private final static Among a_6[] = {
new Among ( "da", -1, -1, "", methodObject ),
new Among ( "ta", -1, -1, "", methodObject ),
new Among ( "de", -1, -1, "", methodObject ),
new Among ( "te", -1, -1, "", methodObject )
};
private final static Among a_7[] = {
new Among ( "nda", -1, -1, "", methodObject ),
new Among ( "nde", -1, -1, "", methodObject )
};
private final static Among a_8[] = {
new Among ( "dan", -1, -1, "", methodObject ),
new Among ( "tan", -1, -1, "", methodObject ),
new Among ( "den", -1, -1, "", methodObject ),
new Among ( "ten", -1, -1, "", methodObject )
};
private final static Among a_9[] = {
new Among ( "ndan", -1, -1, "", methodObject ),
new Among ( "nden", -1, -1, "", methodObject )
};
private final static Among a_10[] = {
new Among ( "la", -1, -1, "", methodObject ),
new Among ( "le", -1, -1, "", methodObject )
};
private final static Among a_11[] = {
new Among ( "ca", -1, -1, "", methodObject ),
new Among ( "ce", -1, -1, "", methodObject )
};
private final static Among a_12[] = {
new Among ( "im", -1, -1, "", methodObject ),
new Among ( "um", -1, -1, "", methodObject ),
new Among ( "\u00FCm", -1, -1, "", methodObject ),
new Among ( "\u0131m", -1, -1, "", methodObject )
};
private final static Among a_13[] = {
new Among ( "sin", -1, -1, "", methodObject ),
new Among ( "sun", -1, -1, "", methodObject ),
new Among ( "s\u00FCn", -1, -1, "", methodObject ),
new Among ( "s\u0131n", -1, -1, "", methodObject )
};
private final static Among a_14[] = {
new Among ( "iz", -1, -1, "", methodObject ),
new Among ( "uz", -1, -1, "", methodObject ),
new Among ( "\u00FCz", -1, -1, "", methodObject ),
new Among ( "\u0131z", -1, -1, "", methodObject )
};
private final static Among a_15[] = {
new Among ( "siniz", -1, -1, "", methodObject ),
new Among ( "sunuz", -1, -1, "", methodObject ),
new Among ( "s\u00FCn\u00FCz", -1, -1, "", methodObject ),
new Among ( "s\u0131n\u0131z", -1, -1, "", methodObject )
};
private final static Among a_16[] = {
new Among ( "lar", -1, -1, "", methodObject ),
new Among ( "ler", -1, -1, "", methodObject )
};
private final static Among a_17[] = {
new Among ( "niz", -1, -1, "", methodObject ),
new Among ( "nuz", -1, -1, "", methodObject ),
new Among ( "n\u00FCz", -1, -1, "", methodObject ),
new Among ( "n\u0131z", -1, -1, "", methodObject )
};
private final static Among a_18[] = {
new Among ( "dir", -1, -1, "", methodObject ),
new Among ( "tir", -1, -1, "", methodObject ),
new Among ( "dur", -1, -1, "", methodObject ),
new Among ( "tur", -1, -1, "", methodObject ),
new Among ( "d\u00FCr", -1, -1, "", methodObject ),
new Among ( "t\u00FCr", -1, -1, "", methodObject ),
new Among ( "d\u0131r", -1, -1, "", methodObject ),
new Among ( "t\u0131r", -1, -1, "", methodObject )
};
private final static Among a_19[] = {
new Among ( "cas\u0131na", -1, -1, "", methodObject ),
new Among ( "cesine", -1, -1, "", methodObject )
};
private final static Among a_20[] = {
new Among ( "di", -1, -1, "", methodObject ),
new Among ( "ti", -1, -1, "", methodObject ),
new Among ( "dik", -1, -1, "", methodObject ),
new Among ( "tik", -1, -1, "", methodObject ),
new Among ( "duk", -1, -1, "", methodObject ),
new Among ( "tuk", -1, -1, "", methodObject ),
new Among ( "d\u00FCk", -1, -1, "", methodObject ),
new Among ( "t\u00FCk", -1, -1, "", methodObject ),
new Among ( "d\u0131k", -1, -1, "", methodObject ),
new Among ( "t\u0131k", -1, -1, "", methodObject ),
new Among ( "dim", -1, -1, "", methodObject ),
new Among ( "tim", -1, -1, "", methodObject ),
new Among ( "dum", -1, -1, "", methodObject ),
new Among ( "tum", -1, -1, "", methodObject ),
new Among ( "d\u00FCm", -1, -1, "", methodObject ),
new Among ( "t\u00FCm", -1, -1, "", methodObject ),
new Among ( "d\u0131m", -1, -1, "", methodObject ),
new Among ( "t\u0131m", -1, -1, "", methodObject ),
new Among ( "din", -1, -1, "", methodObject ),
new Among ( "tin", -1, -1, "", methodObject ),
new Among ( "dun", -1, -1, "", methodObject ),
new Among ( "tun", -1, -1, "", methodObject ),
new Among ( "d\u00FCn", -1, -1, "", methodObject ),
new Among ( "t\u00FCn", -1, -1, "", methodObject ),
new Among ( "d\u0131n", -1, -1, "", methodObject ),
new Among ( "t\u0131n", -1, -1, "", methodObject ),
new Among ( "du", -1, -1, "", methodObject ),
new Among ( "tu", -1, -1, "", methodObject ),
new Among ( "d\u00FC", -1, -1, "", methodObject ),
new Among ( "t\u00FC", -1, -1, "", methodObject ),
new Among ( "d\u0131", -1, -1, "", methodObject ),
new Among ( "t\u0131", -1, -1, "", methodObject )
};
private final static Among a_21[] = {
new Among ( "sa", -1, -1, "", methodObject ),
new Among ( "se", -1, -1, "", methodObject ),
new Among ( "sak", -1, -1, "", methodObject ),
new Among ( "sek", -1, -1, "", methodObject ),
new Among ( "sam", -1, -1, "", methodObject ),
new Among ( "sem", -1, -1, "", methodObject ),
new Among ( "san", -1, -1, "", methodObject ),
new Among ( "sen", -1, -1, "", methodObject )
};
private final static Among a_22[] = {
new Among ( "mi\u015F", -1, -1, "", methodObject ),
new Among ( "mu\u015F", -1, -1, "", methodObject ),
new Among ( "m\u00FC\u015F", -1, -1, "", methodObject ),
new Among ( "m\u0131\u015F", -1, -1, "", methodObject )
};
private final static Among a_23[] = {
new Among ( "b", -1, 1, "", methodObject ),
new Among ( "c", -1, 2, "", methodObject ),
new Among ( "d", -1, 3, "", methodObject ),
new Among ( "\u011F", -1, 4, "", methodObject )
};
private static final char g_vowel[] = {17, 65, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 32, 8, 0, 0, 0, 0, 0, 0, 1 };
private static final char g_U[] = {1, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 0, 0, 0, 0, 0, 0, 1 };
private static final char g_vowel1[] = {1, 64, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1 };
private static final char g_vowel2[] = {17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 130 };
private static final char g_vowel3[] = {1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1 };
private static final char g_vowel4[] = {17 };
private static final char g_vowel5[] = {65 };
private static final char g_vowel6[] = {65 };
private boolean B_continue_stemming_noun_suffixes;
private int I_strlen;
private void copy_from(turkishStemmer other) {
B_continue_stemming_noun_suffixes = other.B_continue_stemming_noun_suffixes;
I_strlen = other.I_strlen;
super.copy_from(other);
}
private boolean r_check_vowel_harmony() {
int v_1;
int v_2;
int v_3;
int v_4;
int v_5;
int v_6;
int v_7;
int v_8;
int v_9;
int v_10;
int v_11;
// (, line 111
// test, line 112
v_1 = limit - cursor;
// (, line 113
// (, line 114
// goto, line 114
golab0: while(true)
{
v_2 = limit - cursor;
lab1: do {
if (!(in_grouping_b(g_vowel, 97, 305)))
{
break lab1;
}
cursor = limit - v_2;
break golab0;
} while (false);
cursor = limit - v_2;
if (cursor <= limit_backward)
{
return false;
}
cursor--;
}
// (, line 115
// or, line 116
lab2: do {
v_3 = limit - cursor;
lab3: do {
// (, line 116
// literal, line 116
if (!(eq_s_b(1, "a")))
{
break lab3;
}
// goto, line 116
golab4: while(true)
{
v_4 = limit - cursor;
lab5: do {
if (!(in_grouping_b(g_vowel1, 97, 305)))
{
break lab5;
}
cursor = limit - v_4;
break golab4;
} while (false);
cursor = limit - v_4;
if (cursor <= limit_backward)
{
break lab3;
}
cursor--;
}
break lab2;
} while (false);
cursor = limit - v_3;
lab6: do {
// (, line 117
// literal, line 117
if (!(eq_s_b(1, "e")))
{
break lab6;
}
// goto, line 117
golab7: while(true)
{
v_5 = limit - cursor;
lab8: do {
if (!(in_grouping_b(g_vowel2, 101, 252)))
{
break lab8;
}
cursor = limit - v_5;
break golab7;
} while (false);
cursor = limit - v_5;
if (cursor <= limit_backward)
{
break lab6;
}
cursor--;
}
break lab2;
} while (false);
cursor = limit - v_3;
lab9: do {
// (, line 118
// literal, line 118
if (!(eq_s_b(1, "\u0131")))
{
break lab9;
}
// goto, line 118
golab10: while(true)
{
v_6 = limit - cursor;
lab11: do {
if (!(in_grouping_b(g_vowel3, 97, 305)))
{
break lab11;
}
cursor = limit - v_6;
break golab10;
} while (false);
cursor = limit - v_6;
if (cursor <= limit_backward)
{
break lab9;
}
cursor--;
}
break lab2;
} while (false);
cursor = limit - v_3;
lab12: do {
// (, line 119
// literal, line 119
if (!(eq_s_b(1, "i")))
{
break lab12;
}
// goto, line 119
golab13: while(true)
{
v_7 = limit - cursor;
lab14: do {
if (!(in_grouping_b(g_vowel4, 101, 105)))
{
break lab14;
}
cursor = limit - v_7;
break golab13;
} while (false);
cursor = limit - v_7;
if (cursor <= limit_backward)
{
break lab12;
}
cursor--;
}
break lab2;
} while (false);
cursor = limit - v_3;
lab15: do {
// (, line 120
// literal, line 120
if (!(eq_s_b(1, "o")))
{
break lab15;
}
// goto, line 120
golab16: while(true)
{
v_8 = limit - cursor;
lab17: do {
if (!(in_grouping_b(g_vowel5, 111, 117)))
{
break lab17;
}
cursor = limit - v_8;
break golab16;
} while (false);
cursor = limit - v_8;
if (cursor <= limit_backward)
{
break lab15;
}
cursor--;
}
break lab2;
} while (false);
cursor = limit - v_3;
lab18: do {
// (, line 121
// literal, line 121
if (!(eq_s_b(1, "\u00F6")))
{
break lab18;
}
// goto, line 121
golab19: while(true)
{
v_9 = limit - cursor;
lab20: do {
if (!(in_grouping_b(g_vowel6, 246, 252)))
{
break lab20;
}
cursor = limit - v_9;
break golab19;
} while (false);
cursor = limit - v_9;
if (cursor <= limit_backward)
{
break lab18;
}
cursor--;
}
break lab2;
} while (false);
cursor = limit - v_3;
lab21: do {
// (, line 122
// literal, line 122
if (!(eq_s_b(1, "u")))
{
break lab21;
}
// goto, line 122
golab22: while(true)
{
v_10 = limit - cursor;
lab23: do {
if (!(in_grouping_b(g_vowel5, 111, 117)))
{
break lab23;
}
cursor = limit - v_10;
break golab22;
} while (false);
cursor = limit - v_10;
if (cursor <= limit_backward)
{
break lab21;
}
cursor--;
}
break lab2;
} while (false);
cursor = limit - v_3;
// (, line 123
// literal, line 123
if (!(eq_s_b(1, "\u00FC")))
{
return false;
}
// goto, line 123
golab24: while(true)
{
v_11 = limit - cursor;
lab25: do {
if (!(in_grouping_b(g_vowel6, 246, 252)))
{
break lab25;
}
cursor = limit - v_11;
break golab24;
} while (false);
cursor = limit - v_11;
if (cursor <= limit_backward)
{
return false;
}
cursor--;
}
} while (false);
cursor = limit - v_1;
return true;
}
private boolean r_mark_suffix_with_optional_n_consonant() {
int v_1;
int v_2;
int v_3;
int v_4;
int v_5;
int v_6;
int v_7;
// (, line 132
// or, line 134
lab0: do {
v_1 = limit - cursor;
lab1: do {
// (, line 133
// (, line 133
// test, line 133
v_2 = limit - cursor;
// literal, line 133
if (!(eq_s_b(1, "n")))
{
break lab1;
}
cursor = limit - v_2;
// next, line 133
if (cursor <= limit_backward)
{
break lab1;
}
cursor--;
// (, line 133
// test, line 133
v_3 = limit - cursor;
if (!(in_grouping_b(g_vowel, 97, 305)))
{
break lab1;
}
cursor = limit - v_3;
break lab0;
} while (false);
cursor = limit - v_1;
// (, line 135
// (, line 135
// not, line 135
{
v_4 = limit - cursor;
lab2: do {
// (, line 135
// test, line 135
v_5 = limit - cursor;
// literal, line 135
if (!(eq_s_b(1, "n")))
{
break lab2;
}
cursor = limit - v_5;
return false;
} while (false);
cursor = limit - v_4;
}
// test, line 135
v_6 = limit - cursor;
// (, line 135
// next, line 135
if (cursor <= limit_backward)
{
return false;
}
cursor--;
// (, line 135
// test, line 135
v_7 = limit - cursor;
if (!(in_grouping_b(g_vowel, 97, 305)))
{
return false;
}
cursor = limit - v_7;
cursor = limit - v_6;
} while (false);
return true;
}
private boolean r_mark_suffix_with_optional_s_consonant() {
int v_1;
int v_2;
int v_3;
int v_4;
int v_5;
int v_6;
int v_7;
// (, line 143
// or, line 145
lab0: do {
v_1 = limit - cursor;
lab1: do {
// (, line 144
// (, line 144
// test, line 144
v_2 = limit - cursor;
// literal, line 144
if (!(eq_s_b(1, "s")))
{
break lab1;
}
cursor = limit - v_2;
// next, line 144
if (cursor <= limit_backward)
{
break lab1;
}
cursor--;
// (, line 144
// test, line 144
v_3 = limit - cursor;
if (!(in_grouping_b(g_vowel, 97, 305)))
{
break lab1;
}
cursor = limit - v_3;
break lab0;
} while (false);
cursor = limit - v_1;
// (, line 146
// (, line 146
// not, line 146
{
v_4 = limit - cursor;
lab2: do {
// (, line 146
// test, line 146
v_5 = limit - cursor;
// literal, line 146
if (!(eq_s_b(1, "s")))
{
break lab2;
}
cursor = limit - v_5;
return false;
} while (false);
cursor = limit - v_4;
}
// test, line 146
v_6 = limit - cursor;
// (, line 146
// next, line 146
if (cursor <= limit_backward)
{
return false;
}
cursor--;
// (, line 146
// test, line 146
v_7 = limit - cursor;
if (!(in_grouping_b(g_vowel, 97, 305)))
{
return false;
}
cursor = limit - v_7;
cursor = limit - v_6;
} while (false);
return true;
}
private boolean r_mark_suffix_with_optional_y_consonant() {
int v_1;
int v_2;
int v_3;
int v_4;
int v_5;
int v_6;
int v_7;
// (, line 153
// or, line 155
lab0: do {
v_1 = limit - cursor;
lab1: do {
// (, line 154
// (, line 154
// test, line 154
v_2 = limit - cursor;
// literal, line 154
if (!(eq_s_b(1, "y")))
{
break lab1;
}
cursor = limit - v_2;
// next, line 154
if (cursor <= limit_backward)
{
break lab1;
}
cursor--;
// (, line 154
// test, line 154
v_3 = limit - cursor;
if (!(in_grouping_b(g_vowel, 97, 305)))
{
break lab1;
}
cursor = limit - v_3;
break lab0;
} while (false);
cursor = limit - v_1;
// (, line 156
// (, line 156
// not, line 156
{
v_4 = limit - cursor;
lab2: do {
// (, line 156
// test, line 156
v_5 = limit - cursor;
// literal, line 156
if (!(eq_s_b(1, "y")))
{
break lab2;
}
cursor = limit - v_5;
return false;
} while (false);
cursor = limit - v_4;
}
// test, line 156
v_6 = limit - cursor;
// (, line 156
// next, line 156
if (cursor <= limit_backward)
{
return false;
}
cursor--;
// (, line 156
// test, line 156
v_7 = limit - cursor;
if (!(in_grouping_b(g_vowel, 97, 305)))
{
return false;
}
cursor = limit - v_7;
cursor = limit - v_6;
} while (false);
return true;
}
private boolean r_mark_suffix_with_optional_U_vowel() {
int v_1;
int v_2;
int v_3;
int v_4;
int v_5;
int v_6;
int v_7;
// (, line 159
// or, line 161
lab0: do {
v_1 = limit - cursor;
lab1: do {
// (, line 160
// (, line 160
// test, line 160
v_2 = limit - cursor;
if (!(in_grouping_b(g_U, 105, 305)))
{
break lab1;
}
cursor = limit - v_2;
// next, line 160
if (cursor <= limit_backward)
{
break lab1;
}
cursor--;
// (, line 160
// test, line 160
v_3 = limit - cursor;
if (!(out_grouping_b(g_vowel, 97, 305)))
{
break lab1;
}
cursor = limit - v_3;
break lab0;
} while (false);
cursor = limit - v_1;
// (, line 162
// (, line 162
// not, line 162
{
v_4 = limit - cursor;
lab2: do {
// (, line 162
// test, line 162
v_5 = limit - cursor;
if (!(in_grouping_b(g_U, 105, 305)))
{
break lab2;
}
cursor = limit - v_5;
return false;
} while (false);
cursor = limit - v_4;
}
// test, line 162
v_6 = limit - cursor;
// (, line 162
// next, line 162
if (cursor <= limit_backward)
{
return false;
}
cursor--;
// (, line 162
// test, line 162
v_7 = limit - cursor;
if (!(out_grouping_b(g_vowel, 97, 305)))
{
return false;
}
cursor = limit - v_7;
cursor = limit - v_6;
} while (false);
return true;
}
private boolean r_mark_possessives() {
// (, line 166
// among, line 167
if (find_among_b(a_0, 10) == 0)
{
return false;
}
// (, line 169
// call mark_suffix_with_optional_U_vowel, line 169
if (!r_mark_suffix_with_optional_U_vowel())
{
return false;
}
return true;
}
private boolean r_mark_sU() {
// (, line 172
// call check_vowel_harmony, line 173
if (!r_check_vowel_harmony())
{
return false;
}
if (!(in_grouping_b(g_U, 105, 305)))
{
return false;
}
// (, line 175
// call mark_suffix_with_optional_s_consonant, line 175
if (!r_mark_suffix_with_optional_s_consonant())
{
return false;
}
return true;
}
private boolean r_mark_lArI() {
// (, line 178
// among, line 179
if (find_among_b(a_1, 2) == 0)
{
return false;
}
return true;
}
private boolean r_mark_yU() {
// (, line 182
// call check_vowel_harmony, line 183
if (!r_check_vowel_harmony())
{
return false;
}
if (!(in_grouping_b(g_U, 105, 305)))
{
return false;
}
// (, line 185
// call mark_suffix_with_optional_y_consonant, line 185
if (!r_mark_suffix_with_optional_y_consonant())
{
return false;
}
return true;
}
private boolean r_mark_nU() {
// (, line 188
// call check_vowel_harmony, line 189
if (!r_check_vowel_harmony())
{
return false;
}
// among, line 190
if (find_among_b(a_2, 4) == 0)
{
return false;
}
return true;
}
private boolean r_mark_nUn() {
// (, line 193
// call check_vowel_harmony, line 194
if (!r_check_vowel_harmony())
{
return false;
}
// among, line 195
if (find_among_b(a_3, 4) == 0)
{
return false;
}
// (, line 196
// call mark_suffix_with_optional_n_consonant, line 196
if (!r_mark_suffix_with_optional_n_consonant())
{
return false;
}
return true;
}
private boolean r_mark_yA() {
// (, line 199
// call check_vowel_harmony, line 200
if (!r_check_vowel_harmony())
{
return false;
}
// among, line 201
if (find_among_b(a_4, 2) == 0)
{
return false;
}
// (, line 202
// call mark_suffix_with_optional_y_consonant, line 202
if (!r_mark_suffix_with_optional_y_consonant())
{
return false;
}
return true;
}
private boolean r_mark_nA() {
// (, line 205
// call check_vowel_harmony, line 206
if (!r_check_vowel_harmony())
{
return false;
}
// among, line 207
if (find_among_b(a_5, 2) == 0)
{
return false;
}
return true;
}
private boolean r_mark_DA() {
// (, line 210
// call check_vowel_harmony, line 211
if (!r_check_vowel_harmony())
{
return false;
}
// among, line 212
if (find_among_b(a_6, 4) == 0)
{
return false;
}
return true;
}
private boolean r_mark_ndA() {
// (, line 215
// call check_vowel_harmony, line 216
if (!r_check_vowel_harmony())
{
return false;
}
// among, line 217
if (find_among_b(a_7, 2) == 0)
{
return false;
}
return true;
}
private boolean r_mark_DAn() {
// (, line 220
// call check_vowel_harmony, line 221
if (!r_check_vowel_harmony())
{
return false;
}
// among, line 222
if (find_among_b(a_8, 4) == 0)
{
return false;
}
return true;
}
private boolean r_mark_ndAn() {
// (, line 225
// call check_vowel_harmony, line 226
if (!r_check_vowel_harmony())
{
return false;
}
// among, line 227
if (find_among_b(a_9, 2) == 0)
{
return false;
}
return true;
}
private boolean r_mark_ylA() {
// (, line 230
// call check_vowel_harmony, line 231
if (!r_check_vowel_harmony())
{
return false;
}
// among, line 232
if (find_among_b(a_10, 2) == 0)
{
return false;
}
// (, line 233
// call mark_suffix_with_optional_y_consonant, line 233
if (!r_mark_suffix_with_optional_y_consonant())
{
return false;
}
return true;
}
private boolean r_mark_ki() {
// (, line 236
// literal, line 237
if (!(eq_s_b(2, "ki")))
{
return false;
}
return true;
}
private boolean r_mark_ncA() {
// (, line 240
// call check_vowel_harmony, line 241
if (!r_check_vowel_harmony())
{
return false;
}
// among, line 242
if (find_among_b(a_11, 2) == 0)
{
return false;
}
// (, line 243
// call mark_suffix_with_optional_n_consonant, line 243
if (!r_mark_suffix_with_optional_n_consonant())
{
return false;
}
return true;
}
private boolean r_mark_yUm() {
// (, line 246
// call check_vowel_harmony, line 247
if (!r_check_vowel_harmony())
{
return false;
}
// among, line 248
if (find_among_b(a_12, 4) == 0)
{
return false;
}
// (, line 249
// call mark_suffix_with_optional_y_consonant, line 249
if (!r_mark_suffix_with_optional_y_consonant())
{
return false;
}
return true;
}
private boolean r_mark_sUn() {
// (, line 252
// call check_vowel_harmony, line 253
if (!r_check_vowel_harmony())
{
return false;
}
// among, line 254
if (find_among_b(a_13, 4) == 0)
{
return false;
}
return true;
}
private boolean r_mark_yUz() {
// (, line 257
// call check_vowel_harmony, line 258
if (!r_check_vowel_harmony())
{
return false;
}
// among, line 259
if (find_among_b(a_14, 4) == 0)
{
return false;
}
// (, line 260
// call mark_suffix_with_optional_y_consonant, line 260
if (!r_mark_suffix_with_optional_y_consonant())
{
return false;
}
return true;
}
private boolean r_mark_sUnUz() {
// (, line 263
// among, line 264
if (find_among_b(a_15, 4) == 0)
{
return false;
}
return true;
}
private boolean r_mark_lAr() {
// (, line 267
// call check_vowel_harmony, line 268
if (!r_check_vowel_harmony())
{
return false;
}
// among, line 269
if (find_among_b(a_16, 2) == 0)
{
return false;
}
return true;
}
private boolean r_mark_nUz() {
// (, line 272
// call check_vowel_harmony, line 273
if (!r_check_vowel_harmony())
{
return false;
}
// among, line 274
if (find_among_b(a_17, 4) == 0)
{
return false;
}
return true;
}
private boolean r_mark_DUr() {
// (, line 277
// call check_vowel_harmony, line 278
if (!r_check_vowel_harmony())
{
return false;
}
// among, line 279
if (find_among_b(a_18, 8) == 0)
{
return false;
}
return true;
}
private boolean r_mark_cAsInA() {
// (, line 282
// among, line 283
if (find_among_b(a_19, 2) == 0)
{
return false;
}
return true;
}
private boolean r_mark_yDU() {
// (, line 286
// call check_vowel_harmony, line 287
if (!r_check_vowel_harmony())
{
return false;
}
// among, line 288
if (find_among_b(a_20, 32) == 0)
{
return false;
}
// (, line 292
// call mark_suffix_with_optional_y_consonant, line 292
if (!r_mark_suffix_with_optional_y_consonant())
{
return false;
}
return true;
}
private boolean r_mark_ysA() {
// (, line 296
// among, line 297
if (find_among_b(a_21, 8) == 0)
{
return false;
}
// (, line 298
// call mark_suffix_with_optional_y_consonant, line 298
if (!r_mark_suffix_with_optional_y_consonant())
{
return false;
}
return true;
}
private boolean r_mark_ymUs_() {
// (, line 301
// call check_vowel_harmony, line 302
if (!r_check_vowel_harmony())
{
return false;
}
// among, line 303
if (find_among_b(a_22, 4) == 0)
{
return false;
}
// (, line 304
// call mark_suffix_with_optional_y_consonant, line 304
if (!r_mark_suffix_with_optional_y_consonant())
{
return false;
}
return true;
}
private boolean r_mark_yken() {
// (, line 307
// literal, line 308
if (!(eq_s_b(3, "ken")))
{
return false;
}
// (, line 308
// call mark_suffix_with_optional_y_consonant, line 308
if (!r_mark_suffix_with_optional_y_consonant())
{
return false;
}
return true;
}
private boolean r_stem_nominal_verb_suffixes() {
int v_1;
int v_2;
int v_3;
int v_4;
int v_5;
int v_6;
int v_7;
int v_8;
int v_9;
int v_10;
// (, line 311
// [, line 312
ket = cursor;
// set continue_stemming_noun_suffixes, line 313
B_continue_stemming_noun_suffixes = true;
// or, line 315
lab0: do {
v_1 = limit - cursor;
lab1: do {
// (, line 314
// or, line 314
lab2: do {
v_2 = limit - cursor;
lab3: do {
// call mark_ymUs_, line 314
if (!r_mark_ymUs_())
{
break lab3;
}
break lab2;
} while (false);
cursor = limit - v_2;
lab4: do {
// call mark_yDU, line 314
if (!r_mark_yDU())
{
break lab4;
}
break lab2;
} while (false);
cursor = limit - v_2;
lab5: do {
// call mark_ysA, line 314
if (!r_mark_ysA())
{
break lab5;
}
break lab2;
} while (false);
cursor = limit - v_2;
// call mark_yken, line 314
if (!r_mark_yken())
{
break lab1;
}
} while (false);
break lab0;
} while (false);
cursor = limit - v_1;
lab6: do {
// (, line 316
// call mark_cAsInA, line 316
if (!r_mark_cAsInA())
{
break lab6;
}
// (, line 316
// or, line 316
lab7: do {
v_3 = limit - cursor;
lab8: do {
// call mark_sUnUz, line 316
if (!r_mark_sUnUz())
{
break lab8;
}
break lab7;
} while (false);
cursor = limit - v_3;
lab9: do {
// call mark_lAr, line 316
if (!r_mark_lAr())
{
break lab9;
}
break lab7;
} while (false);
cursor = limit - v_3;
lab10: do {
// call mark_yUm, line 316
if (!r_mark_yUm())
{
break lab10;
}
break lab7;
} while (false);
cursor = limit - v_3;
lab11: do {
// call mark_sUn, line 316
if (!r_mark_sUn())
{
break lab11;
}
break lab7;
} while (false);
cursor = limit - v_3;
lab12: do {
// call mark_yUz, line 316
if (!r_mark_yUz())
{
break lab12;
}
break lab7;
} while (false);
cursor = limit - v_3;
} while (false);
// call mark_ymUs_, line 316
if (!r_mark_ymUs_())
{
break lab6;
}
break lab0;
} while (false);
cursor = limit - v_1;
lab13: do {
// (, line 318
// call mark_lAr, line 319
if (!r_mark_lAr())
{
break lab13;
}
// ], line 319
bra = cursor;
// delete, line 319
slice_del();
// try, line 319
v_4 = limit - cursor;
lab14: do {
// (, line 319
// [, line 319
ket = cursor;
// (, line 319
// or, line 319
lab15: do {
v_5 = limit - cursor;
lab16: do {
// call mark_DUr, line 319
if (!r_mark_DUr())
{
break lab16;
}
break lab15;
} while (false);
cursor = limit - v_5;
lab17: do {
// call mark_yDU, line 319
if (!r_mark_yDU())
{
break lab17;
}
break lab15;
} while (false);
cursor = limit - v_5;
lab18: do {
// call mark_ysA, line 319
if (!r_mark_ysA())
{
break lab18;
}
break lab15;
} while (false);
cursor = limit - v_5;
// call mark_ymUs_, line 319
if (!r_mark_ymUs_())
{
cursor = limit - v_4;
break lab14;
}
} while (false);
} while (false);
// unset continue_stemming_noun_suffixes, line 320
B_continue_stemming_noun_suffixes = false;
break lab0;
} while (false);
cursor = limit - v_1;
lab19: do {
// (, line 323
// call mark_nUz, line 323
if (!r_mark_nUz())
{
break lab19;
}
// (, line 323
// or, line 323
lab20: do {
v_6 = limit - cursor;
lab21: do {
// call mark_yDU, line 323
if (!r_mark_yDU())
{
break lab21;
}
break lab20;
} while (false);
cursor = limit - v_6;
// call mark_ysA, line 323
if (!r_mark_ysA())
{
break lab19;
}
} while (false);
break lab0;
} while (false);
cursor = limit - v_1;
lab22: do {
// (, line 325
// (, line 325
// or, line 325
lab23: do {
v_7 = limit - cursor;
lab24: do {
// call mark_sUnUz, line 325
if (!r_mark_sUnUz())
{
break lab24;
}
break lab23;
} while (false);
cursor = limit - v_7;
lab25: do {
// call mark_yUz, line 325
if (!r_mark_yUz())
{
break lab25;
}
break lab23;
} while (false);
cursor = limit - v_7;
lab26: do {
// call mark_sUn, line 325
if (!r_mark_sUn())
{
break lab26;
}
break lab23;
} while (false);
cursor = limit - v_7;
// call mark_yUm, line 325
if (!r_mark_yUm())
{
break lab22;
}
} while (false);
// ], line 325
bra = cursor;
// delete, line 325
slice_del();
// try, line 325
v_8 = limit - cursor;
lab27: do {
// (, line 325
// [, line 325
ket = cursor;
// call mark_ymUs_, line 325
if (!r_mark_ymUs_())
{
cursor = limit - v_8;
break lab27;
}
} while (false);
break lab0;
} while (false);
cursor = limit - v_1;
// (, line 327
// call mark_DUr, line 327
if (!r_mark_DUr())
{
return false;
}
// ], line 327
bra = cursor;
// delete, line 327
slice_del();
// try, line 327
v_9 = limit - cursor;
lab28: do {
// (, line 327
// [, line 327
ket = cursor;
// (, line 327
// or, line 327
lab29: do {
v_10 = limit - cursor;
lab30: do {
// call mark_sUnUz, line 327
if (!r_mark_sUnUz())
{
break lab30;
}
break lab29;
} while (false);
cursor = limit - v_10;
lab31: do {
// call mark_lAr, line 327
if (!r_mark_lAr())
{
break lab31;
}
break lab29;
} while (false);
cursor = limit - v_10;
lab32: do {
// call mark_yUm, line 327
if (!r_mark_yUm())
{
break lab32;
}
break lab29;
} while (false);
cursor = limit - v_10;
lab33: do {
// call mark_sUn, line 327
if (!r_mark_sUn())
{
break lab33;
}
break lab29;
} while (false);
cursor = limit - v_10;
lab34: do {
// call mark_yUz, line 327
if (!r_mark_yUz())
{
break lab34;
}
break lab29;
} while (false);
cursor = limit - v_10;
} while (false);
// call mark_ymUs_, line 327
if (!r_mark_ymUs_())
{
cursor = limit - v_9;
break lab28;
}
} while (false);
} while (false);
// ], line 328
bra = cursor;
// delete, line 328
slice_del();
return true;
}
private boolean r_stem_suffix_chain_before_ki() {
int v_1;
int v_2;
int v_3;
int v_4;
int v_5;
int v_6;
int v_7;
int v_8;
int v_9;
int v_10;
int v_11;
// (, line 332
// [, line 333
ket = cursor;
// call mark_ki, line 334
if (!r_mark_ki())
{
return false;
}
// (, line 335
// or, line 342
lab0: do {
v_1 = limit - cursor;
lab1: do {
// (, line 336
// call mark_DA, line 336
if (!r_mark_DA())
{
break lab1;
}
// ], line 336
bra = cursor;
// delete, line 336
slice_del();
// try, line 336
v_2 = limit - cursor;
lab2: do {
// (, line 336
// [, line 336
ket = cursor;
// or, line 338
lab3: do {
v_3 = limit - cursor;
lab4: do {
// (, line 337
// call mark_lAr, line 337
if (!r_mark_lAr())
{
break lab4;
}
// ], line 337
bra = cursor;
// delete, line 337
slice_del();
// try, line 337
v_4 = limit - cursor;
lab5: do {
// (, line 337
// call stem_suffix_chain_before_ki, line 337
if (!r_stem_suffix_chain_before_ki())
{
cursor = limit - v_4;
break lab5;
}
} while (false);
break lab3;
} while (false);
cursor = limit - v_3;
// (, line 339
// call mark_possessives, line 339
if (!r_mark_possessives())
{
cursor = limit - v_2;
break lab2;
}
// ], line 339
bra = cursor;
// delete, line 339
slice_del();
// try, line 339
v_5 = limit - cursor;
lab6: do {
// (, line 339
// [, line 339
ket = cursor;
// call mark_lAr, line 339
if (!r_mark_lAr())
{
cursor = limit - v_5;
break lab6;
}
// ], line 339
bra = cursor;
// delete, line 339
slice_del();
// call stem_suffix_chain_before_ki, line 339
if (!r_stem_suffix_chain_before_ki())
{
cursor = limit - v_5;
break lab6;
}
} while (false);
} while (false);
} while (false);
break lab0;
} while (false);
cursor = limit - v_1;
lab7: do {
// (, line 343
// call mark_nUn, line 343
if (!r_mark_nUn())
{
break lab7;
}
// ], line 343
bra = cursor;
// delete, line 343
slice_del();
// try, line 343
v_6 = limit - cursor;
lab8: do {
// (, line 343
// [, line 343
ket = cursor;
// or, line 345
lab9: do {
v_7 = limit - cursor;
lab10: do {
// (, line 344
// call mark_lArI, line 344
if (!r_mark_lArI())
{
break lab10;
}
// ], line 344
bra = cursor;
// delete, line 344
slice_del();
break lab9;
} while (false);
cursor = limit - v_7;
lab11: do {
// (, line 346
// [, line 346
ket = cursor;
// or, line 346
lab12: do {
v_8 = limit - cursor;
lab13: do {
// call mark_possessives, line 346
if (!r_mark_possessives())
{
break lab13;
}
break lab12;
} while (false);
cursor = limit - v_8;
// call mark_sU, line 346
if (!r_mark_sU())
{
break lab11;
}
} while (false);
// ], line 346
bra = cursor;
// delete, line 346
slice_del();
// try, line 346
v_9 = limit - cursor;
lab14: do {
// (, line 346
// [, line 346
ket = cursor;
// call mark_lAr, line 346
if (!r_mark_lAr())
{
cursor = limit - v_9;
break lab14;
}
// ], line 346
bra = cursor;
// delete, line 346
slice_del();
// call stem_suffix_chain_before_ki, line 346
if (!r_stem_suffix_chain_before_ki())
{
cursor = limit - v_9;
break lab14;
}
} while (false);
break lab9;
} while (false);
cursor = limit - v_7;
// (, line 348
// call stem_suffix_chain_before_ki, line 348
if (!r_stem_suffix_chain_before_ki())
{
cursor = limit - v_6;
break lab8;
}
} while (false);
} while (false);
break lab0;
} while (false);
cursor = limit - v_1;
// (, line 351
// call mark_ndA, line 351
if (!r_mark_ndA())
{
return false;
}
// (, line 351
// or, line 353
lab15: do {
v_10 = limit - cursor;
lab16: do {
// (, line 352
// call mark_lArI, line 352
if (!r_mark_lArI())
{
break lab16;
}
// ], line 352
bra = cursor;
// delete, line 352
slice_del();
break lab15;
} while (false);
cursor = limit - v_10;
lab17: do {
// (, line 354
// (, line 354
// call mark_sU, line 354
if (!r_mark_sU())
{
break lab17;
}
// ], line 354
bra = cursor;
// delete, line 354
slice_del();
// try, line 354
v_11 = limit - cursor;
lab18: do {
// (, line 354
// [, line 354
ket = cursor;
// call mark_lAr, line 354
if (!r_mark_lAr())
{
cursor = limit - v_11;
break lab18;
}
// ], line 354
bra = cursor;
// delete, line 354
slice_del();
// call stem_suffix_chain_before_ki, line 354
if (!r_stem_suffix_chain_before_ki())
{
cursor = limit - v_11;
break lab18;
}
} while (false);
break lab15;
} while (false);
cursor = limit - v_10;
// (, line 356
// call stem_suffix_chain_before_ki, line 356
if (!r_stem_suffix_chain_before_ki())
{
return false;
}
} while (false);
} while (false);
return true;
}
private boolean r_stem_noun_suffixes() {
int v_1;
int v_2;
int v_3;
int v_4;
int v_5;
int v_6;
int v_7;
int v_8;
int v_9;
int v_10;
int v_11;
int v_12;
int v_13;
int v_14;
int v_15;
int v_16;
int v_17;
int v_18;
int v_19;
int v_20;
int v_21;
int v_22;
int v_23;
int v_24;
int v_25;
int v_26;
int v_27;
// (, line 361
// or, line 363
lab0: do {
v_1 = limit - cursor;
lab1: do {
// (, line 362
// [, line 362
ket = cursor;
// call mark_lAr, line 362
if (!r_mark_lAr())
{
break lab1;
}
// ], line 362
bra = cursor;
// delete, line 362
slice_del();
// try, line 362
v_2 = limit - cursor;
lab2: do {
// (, line 362
// call stem_suffix_chain_before_ki, line 362
if (!r_stem_suffix_chain_before_ki())
{
cursor = limit - v_2;
break lab2;
}
} while (false);
break lab0;
} while (false);
cursor = limit - v_1;
lab3: do {
// (, line 364
// [, line 364
ket = cursor;
// call mark_ncA, line 364
if (!r_mark_ncA())
{
break lab3;
}
// ], line 364
bra = cursor;
// delete, line 364
slice_del();
// try, line 365
v_3 = limit - cursor;
lab4: do {
// (, line 365
// or, line 367
lab5: do {
v_4 = limit - cursor;
lab6: do {
// (, line 366
// [, line 366
ket = cursor;
// call mark_lArI, line 366
if (!r_mark_lArI())
{
break lab6;
}
// ], line 366
bra = cursor;
// delete, line 366
slice_del();
break lab5;
} while (false);
cursor = limit - v_4;
lab7: do {
// (, line 368
// [, line 368
ket = cursor;
// or, line 368
lab8: do {
v_5 = limit - cursor;
lab9: do {
// call mark_possessives, line 368
if (!r_mark_possessives())
{
break lab9;
}
break lab8;
} while (false);
cursor = limit - v_5;
// call mark_sU, line 368
if (!r_mark_sU())
{
break lab7;
}
} while (false);
// ], line 368
bra = cursor;
// delete, line 368
slice_del();
// try, line 368
v_6 = limit - cursor;
lab10: do {
// (, line 368
// [, line 368
ket = cursor;
// call mark_lAr, line 368
if (!r_mark_lAr())
{
cursor = limit - v_6;
break lab10;
}
// ], line 368
bra = cursor;
// delete, line 368
slice_del();
// call stem_suffix_chain_before_ki, line 368
if (!r_stem_suffix_chain_before_ki())
{
cursor = limit - v_6;
break lab10;
}
} while (false);
break lab5;
} while (false);
cursor = limit - v_4;
// (, line 370
// [, line 370
ket = cursor;
// call mark_lAr, line 370
if (!r_mark_lAr())
{
cursor = limit - v_3;
break lab4;
}
// ], line 370
bra = cursor;
// delete, line 370
slice_del();
// call stem_suffix_chain_before_ki, line 370
if (!r_stem_suffix_chain_before_ki())
{
cursor = limit - v_3;
break lab4;
}
} while (false);
} while (false);
break lab0;
} while (false);
cursor = limit - v_1;
lab11: do {
// (, line 374
// [, line 374
ket = cursor;
// (, line 374
// or, line 374
lab12: do {
v_7 = limit - cursor;
lab13: do {
// call mark_ndA, line 374
if (!r_mark_ndA())
{
break lab13;
}
break lab12;
} while (false);
cursor = limit - v_7;
// call mark_nA, line 374
if (!r_mark_nA())
{
break lab11;
}
} while (false);
// (, line 375
// or, line 377
lab14: do {
v_8 = limit - cursor;
lab15: do {
// (, line 376
// call mark_lArI, line 376
if (!r_mark_lArI())
{
break lab15;
}
// ], line 376
bra = cursor;
// delete, line 376
slice_del();
break lab14;
} while (false);
cursor = limit - v_8;
lab16: do {
// (, line 378
// call mark_sU, line 378
if (!r_mark_sU())
{
break lab16;
}
// ], line 378
bra = cursor;
// delete, line 378
slice_del();
// try, line 378
v_9 = limit - cursor;
lab17: do {
// (, line 378
// [, line 378
ket = cursor;
// call mark_lAr, line 378
if (!r_mark_lAr())
{
cursor = limit - v_9;
break lab17;
}
// ], line 378
bra = cursor;
// delete, line 378
slice_del();
// call stem_suffix_chain_before_ki, line 378
if (!r_stem_suffix_chain_before_ki())
{
cursor = limit - v_9;
break lab17;
}
} while (false);
break lab14;
} while (false);
cursor = limit - v_8;
// (, line 380
// call stem_suffix_chain_before_ki, line 380
if (!r_stem_suffix_chain_before_ki())
{
break lab11;
}
} while (false);
break lab0;
} while (false);
cursor = limit - v_1;
lab18: do {
// (, line 384
// [, line 384
ket = cursor;
// (, line 384
// or, line 384
lab19: do {
v_10 = limit - cursor;
lab20: do {
// call mark_ndAn, line 384
if (!r_mark_ndAn())
{
break lab20;
}
break lab19;
} while (false);
cursor = limit - v_10;
// call mark_nU, line 384
if (!r_mark_nU())
{
break lab18;
}
} while (false);
// (, line 384
// or, line 384
lab21: do {
v_11 = limit - cursor;
lab22: do {
// (, line 384
// call mark_sU, line 384
if (!r_mark_sU())
{
break lab22;
}
// ], line 384
bra = cursor;
// delete, line 384
slice_del();
// try, line 384
v_12 = limit - cursor;
lab23: do {
// (, line 384
// [, line 384
ket = cursor;
// call mark_lAr, line 384
if (!r_mark_lAr())
{
cursor = limit - v_12;
break lab23;
}
// ], line 384
bra = cursor;
// delete, line 384
slice_del();
// call stem_suffix_chain_before_ki, line 384
if (!r_stem_suffix_chain_before_ki())
{
cursor = limit - v_12;
break lab23;
}
} while (false);
break lab21;
} while (false);
cursor = limit - v_11;
// (, line 384
// call mark_lArI, line 384
if (!r_mark_lArI())
{
break lab18;
}
} while (false);
break lab0;
} while (false);
cursor = limit - v_1;
lab24: do {
// (, line 386
// [, line 386
ket = cursor;
// call mark_DAn, line 386
if (!r_mark_DAn())
{
break lab24;
}
// ], line 386
bra = cursor;
// delete, line 386
slice_del();
// try, line 386
v_13 = limit - cursor;
lab25: do {
// (, line 386
// [, line 386
ket = cursor;
// (, line 387
// or, line 389
lab26: do {
v_14 = limit - cursor;
lab27: do {
// (, line 388
// call mark_possessives, line 388
if (!r_mark_possessives())
{
break lab27;
}
// ], line 388
bra = cursor;
// delete, line 388
slice_del();
// try, line 388
v_15 = limit - cursor;
lab28: do {
// (, line 388
// [, line 388
ket = cursor;
// call mark_lAr, line 388
if (!r_mark_lAr())
{
cursor = limit - v_15;
break lab28;
}
// ], line 388
bra = cursor;
// delete, line 388
slice_del();
// call stem_suffix_chain_before_ki, line 388
if (!r_stem_suffix_chain_before_ki())
{
cursor = limit - v_15;
break lab28;
}
} while (false);
break lab26;
} while (false);
cursor = limit - v_14;
lab29: do {
// (, line 390
// call mark_lAr, line 390
if (!r_mark_lAr())
{
break lab29;
}
// ], line 390
bra = cursor;
// delete, line 390
slice_del();
// try, line 390
v_16 = limit - cursor;
lab30: do {
// (, line 390
// call stem_suffix_chain_before_ki, line 390
if (!r_stem_suffix_chain_before_ki())
{
cursor = limit - v_16;
break lab30;
}
} while (false);
break lab26;
} while (false);
cursor = limit - v_14;
// (, line 392
// call stem_suffix_chain_before_ki, line 392
if (!r_stem_suffix_chain_before_ki())
{
cursor = limit - v_13;
break lab25;
}
} while (false);
} while (false);
break lab0;
} while (false);
cursor = limit - v_1;
lab31: do {
// (, line 396
// [, line 396
ket = cursor;
// or, line 396
lab32: do {
v_17 = limit - cursor;
lab33: do {
// call mark_nUn, line 396
if (!r_mark_nUn())
{
break lab33;
}
break lab32;
} while (false);
cursor = limit - v_17;
// call mark_ylA, line 396
if (!r_mark_ylA())
{
break lab31;
}
} while (false);
// ], line 396
bra = cursor;
// delete, line 396
slice_del();
// try, line 397
v_18 = limit - cursor;
lab34: do {
// (, line 397
// or, line 399
lab35: do {
v_19 = limit - cursor;
lab36: do {
// (, line 398
// [, line 398
ket = cursor;
// call mark_lAr, line 398
if (!r_mark_lAr())
{
break lab36;
}
// ], line 398
bra = cursor;
// delete, line 398
slice_del();
// call stem_suffix_chain_before_ki, line 398
if (!r_stem_suffix_chain_before_ki())
{
break lab36;
}
break lab35;
} while (false);
cursor = limit - v_19;
lab37: do {
// (, line 400
// [, line 400
ket = cursor;
// or, line 400
lab38: do {
v_20 = limit - cursor;
lab39: do {
// call mark_possessives, line 400
if (!r_mark_possessives())
{
break lab39;
}
break lab38;
} while (false);
cursor = limit - v_20;
// call mark_sU, line 400
if (!r_mark_sU())
{
break lab37;
}
} while (false);
// ], line 400
bra = cursor;
// delete, line 400
slice_del();
// try, line 400
v_21 = limit - cursor;
lab40: do {
// (, line 400
// [, line 400
ket = cursor;
// call mark_lAr, line 400
if (!r_mark_lAr())
{
cursor = limit - v_21;
break lab40;
}
// ], line 400
bra = cursor;
// delete, line 400
slice_del();
// call stem_suffix_chain_before_ki, line 400
if (!r_stem_suffix_chain_before_ki())
{
cursor = limit - v_21;
break lab40;
}
} while (false);
break lab35;
} while (false);
cursor = limit - v_19;
// call stem_suffix_chain_before_ki, line 402
if (!r_stem_suffix_chain_before_ki())
{
cursor = limit - v_18;
break lab34;
}
} while (false);
} while (false);
break lab0;
} while (false);
cursor = limit - v_1;
lab41: do {
// (, line 406
// [, line 406
ket = cursor;
// call mark_lArI, line 406
if (!r_mark_lArI())
{
break lab41;
}
// ], line 406
bra = cursor;
// delete, line 406
slice_del();
break lab0;
} while (false);
cursor = limit - v_1;
lab42: do {
// (, line 408
// call stem_suffix_chain_before_ki, line 408
if (!r_stem_suffix_chain_before_ki())
{
break lab42;
}
break lab0;
} while (false);
cursor = limit - v_1;
lab43: do {
// (, line 410
// [, line 410
ket = cursor;
// or, line 410
lab44: do {
v_22 = limit - cursor;
lab45: do {
// call mark_DA, line 410
if (!r_mark_DA())
{
break lab45;
}
break lab44;
} while (false);
cursor = limit - v_22;
lab46: do {
// call mark_yU, line 410
if (!r_mark_yU())
{
break lab46;
}
break lab44;
} while (false);
cursor = limit - v_22;
// call mark_yA, line 410
if (!r_mark_yA())
{
break lab43;
}
} while (false);
// ], line 410
bra = cursor;
// delete, line 410
slice_del();
// try, line 410
v_23 = limit - cursor;
lab47: do {
// (, line 410
// [, line 410
ket = cursor;
// (, line 410
// or, line 410
lab48: do {
v_24 = limit - cursor;
lab49: do {
// (, line 410
// call mark_possessives, line 410
if (!r_mark_possessives())
{
break lab49;
}
// ], line 410
bra = cursor;
// delete, line 410
slice_del();
// try, line 410
v_25 = limit - cursor;
lab50: do {
// (, line 410
// [, line 410
ket = cursor;
// call mark_lAr, line 410
if (!r_mark_lAr())
{
cursor = limit - v_25;
break lab50;
}
} while (false);
break lab48;
} while (false);
cursor = limit - v_24;
// call mark_lAr, line 410
if (!r_mark_lAr())
{
cursor = limit - v_23;
break lab47;
}
} while (false);
// ], line 410
bra = cursor;
// delete, line 410
slice_del();
// [, line 410
ket = cursor;
// call stem_suffix_chain_before_ki, line 410
if (!r_stem_suffix_chain_before_ki())
{
cursor = limit - v_23;
break lab47;
}
} while (false);
break lab0;
} while (false);
cursor = limit - v_1;
// (, line 412
// [, line 412
ket = cursor;
// or, line 412
lab51: do {
v_26 = limit - cursor;
lab52: do {
// call mark_possessives, line 412
if (!r_mark_possessives())
{
break lab52;
}
break lab51;
} while (false);
cursor = limit - v_26;
// call mark_sU, line 412
if (!r_mark_sU())
{
return false;
}
} while (false);
// ], line 412
bra = cursor;
// delete, line 412
slice_del();
// try, line 412
v_27 = limit - cursor;
lab53: do {
// (, line 412
// [, line 412
ket = cursor;
// call mark_lAr, line 412
if (!r_mark_lAr())
{
cursor = limit - v_27;
break lab53;
}
// ], line 412
bra = cursor;
// delete, line 412
slice_del();
// call stem_suffix_chain_before_ki, line 412
if (!r_stem_suffix_chain_before_ki())
{
cursor = limit - v_27;
break lab53;
}
} while (false);
} while (false);
return true;
}
private boolean r_post_process_last_consonants() {
int among_var;
// (, line 415
// [, line 416
ket = cursor;
// substring, line 416
among_var = find_among_b(a_23, 4);
if (among_var == 0)
{
return false;
}
// ], line 416
bra = cursor;
switch(among_var) {
case 0:
return false;
case 1:
// (, line 417
// <-, line 417
slice_from("p");
break;
case 2:
// (, line 418
// <-, line 418
slice_from("\u00E7");
break;
case 3:
// (, line 419
// <-, line 419
slice_from("t");
break;
case 4:
// (, line 420
// <-, line 420
slice_from("k");
break;
}
return true;
}
private boolean r_append_U_to_stems_ending_with_d_or_g() {
int v_1;
int v_2;
int v_3;
int v_4;
int v_5;
int v_6;
int v_7;
int v_8;
int v_9;
int v_10;
int v_11;
int v_12;
int v_13;
int v_14;
int v_15;
// (, line 430
// test, line 431
v_1 = limit - cursor;
// (, line 431
// or, line 431
lab0: do {
v_2 = limit - cursor;
lab1: do {
// literal, line 431
if (!(eq_s_b(1, "d")))
{
break lab1;
}
break lab0;
} while (false);
cursor = limit - v_2;
// literal, line 431
if (!(eq_s_b(1, "g")))
{
return false;
}
} while (false);
cursor = limit - v_1;
// or, line 433
lab2: do {
v_3 = limit - cursor;
lab3: do {
// (, line 432
// test, line 432
v_4 = limit - cursor;
// (, line 432
// (, line 432
// goto, line 432
golab4: while(true)
{
v_5 = limit - cursor;
lab5: do {
if (!(in_grouping_b(g_vowel, 97, 305)))
{
break lab5;
}
cursor = limit - v_5;
break golab4;
} while (false);
cursor = limit - v_5;
if (cursor <= limit_backward)
{
break lab3;
}
cursor--;
}
// or, line 432
lab6: do {
v_6 = limit - cursor;
lab7: do {
// literal, line 432
if (!(eq_s_b(1, "a")))
{
break lab7;
}
break lab6;
} while (false);
cursor = limit - v_6;
// literal, line 432
if (!(eq_s_b(1, "\u0131")))
{
break lab3;
}
} while (false);
cursor = limit - v_4;
// <+, line 432
{
int c = cursor;
insert(cursor, cursor, "\u0131");
cursor = c;
}
break lab2;
} while (false);
cursor = limit - v_3;
lab8: do {
// (, line 434
// test, line 434
v_7 = limit - cursor;
// (, line 434
// (, line 434
// goto, line 434
golab9: while(true)
{
v_8 = limit - cursor;
lab10: do {
if (!(in_grouping_b(g_vowel, 97, 305)))
{
break lab10;
}
cursor = limit - v_8;
break golab9;
} while (false);
cursor = limit - v_8;
if (cursor <= limit_backward)
{
break lab8;
}
cursor--;
}
// or, line 434
lab11: do {
v_9 = limit - cursor;
lab12: do {
// literal, line 434
if (!(eq_s_b(1, "e")))
{
break lab12;
}
break lab11;
} while (false);
cursor = limit - v_9;
// literal, line 434
if (!(eq_s_b(1, "i")))
{
break lab8;
}
} while (false);
cursor = limit - v_7;
// <+, line 434
{
int c = cursor;
insert(cursor, cursor, "i");
cursor = c;
}
break lab2;
} while (false);
cursor = limit - v_3;
lab13: do {
// (, line 436
// test, line 436
v_10 = limit - cursor;
// (, line 436
// (, line 436
// goto, line 436
golab14: while(true)
{
v_11 = limit - cursor;
lab15: do {
if (!(in_grouping_b(g_vowel, 97, 305)))
{
break lab15;
}
cursor = limit - v_11;
break golab14;
} while (false);
cursor = limit - v_11;
if (cursor <= limit_backward)
{
break lab13;
}
cursor--;
}
// or, line 436
lab16: do {
v_12 = limit - cursor;
lab17: do {
// literal, line 436
if (!(eq_s_b(1, "o")))
{
break lab17;
}
break lab16;
} while (false);
cursor = limit - v_12;
// literal, line 436
if (!(eq_s_b(1, "u")))
{
break lab13;
}
} while (false);
cursor = limit - v_10;
// <+, line 436
{
int c = cursor;
insert(cursor, cursor, "u");
cursor = c;
}
break lab2;
} while (false);
cursor = limit - v_3;
// (, line 438
// test, line 438
v_13 = limit - cursor;
// (, line 438
// (, line 438
// goto, line 438
golab18: while(true)
{
v_14 = limit - cursor;
lab19: do {
if (!(in_grouping_b(g_vowel, 97, 305)))
{
break lab19;
}
cursor = limit - v_14;
break golab18;
} while (false);
cursor = limit - v_14;
if (cursor <= limit_backward)
{
return false;
}
cursor--;
}
// or, line 438
lab20: do {
v_15 = limit - cursor;
lab21: do {
// literal, line 438
if (!(eq_s_b(1, "\u00F6")))
{
break lab21;
}
break lab20;
} while (false);
cursor = limit - v_15;
// literal, line 438
if (!(eq_s_b(1, "\u00FC")))
{
return false;
}
} while (false);
cursor = limit - v_13;
// <+, line 438
{
int c = cursor;
insert(cursor, cursor, "\u00FC");
cursor = c;
}
} while (false);
return true;
}
private boolean r_more_than_one_syllable_word() {
int v_1;
int v_3;
// (, line 445
// test, line 446
v_1 = cursor;
// (, line 446
// atleast, line 446
{
int v_2 = 2;
// atleast, line 446
replab0: while(true)
{
v_3 = cursor;
lab1: do {
// (, line 446
// gopast, line 446
golab2: while(true)
{
lab3: do {
if (!(in_grouping(g_vowel, 97, 305)))
{
break lab3;
}
break golab2;
} while (false);
if (cursor >= limit)
{
break lab1;
}
cursor++;
}
v_2--;
continue replab0;
} while (false);
cursor = v_3;
break replab0;
}
if (v_2 > 0)
{
return false;
}
}
cursor = v_1;
return true;
}
private boolean r_is_reserved_word() {
int v_1;
int v_2;
int v_4;
// (, line 449
// or, line 451
lab0: do {
v_1 = cursor;
lab1: do {
// test, line 450
v_2 = cursor;
// (, line 450
// gopast, line 450
golab2: while(true)
{
lab3: do {
// literal, line 450
if (!(eq_s(2, "ad")))
{
break lab3;
}
break golab2;
} while (false);
if (cursor >= limit)
{
break lab1;
}
cursor++;
}
// (, line 450
I_strlen = 2;
// (, line 450
if (!(I_strlen == limit))
{
break lab1;
}
cursor = v_2;
break lab0;
} while (false);
cursor = v_1;
// test, line 452
v_4 = cursor;
// (, line 452
// gopast, line 452
golab4: while(true)
{
lab5: do {
// literal, line 452
if (!(eq_s(5, "soyad")))
{
break lab5;
}
break golab4;
} while (false);
if (cursor >= limit)
{
return false;
}
cursor++;
}
// (, line 452
I_strlen = 5;
// (, line 452
if (!(I_strlen == limit))
{
return false;
}
cursor = v_4;
} while (false);
return true;
}
private boolean r_postlude() {
int v_1;
int v_2;
int v_3;
// (, line 455
// not, line 456
{
v_1 = cursor;
lab0: do {
// (, line 456
// call is_reserved_word, line 456
if (!r_is_reserved_word())
{
break lab0;
}
return false;
} while (false);
cursor = v_1;
}
// backwards, line 457
limit_backward = cursor; cursor = limit;
// (, line 457
// do, line 458
v_2 = limit - cursor;
lab1: do {
// call append_U_to_stems_ending_with_d_or_g, line 458
if (!r_append_U_to_stems_ending_with_d_or_g())
{
break lab1;
}
} while (false);
cursor = limit - v_2;
// do, line 459
v_3 = limit - cursor;
lab2: do {
// call post_process_last_consonants, line 459
if (!r_post_process_last_consonants())
{
break lab2;
}
} while (false);
cursor = limit - v_3;
cursor = limit_backward; return true;
}
public boolean stem() {
int v_1;
int v_2;
// (, line 464
// (, line 465
// call more_than_one_syllable_word, line 465
if (!r_more_than_one_syllable_word())
{
return false;
}
// (, line 466
// backwards, line 467
limit_backward = cursor; cursor = limit;
// (, line 467
// do, line 468
v_1 = limit - cursor;
lab0: do {
// call stem_nominal_verb_suffixes, line 468
if (!r_stem_nominal_verb_suffixes())
{
break lab0;
}
} while (false);
cursor = limit - v_1;
// Boolean test continue_stemming_noun_suffixes, line 469
if (!(B_continue_stemming_noun_suffixes))
{
return false;
}
// do, line 470
v_2 = limit - cursor;
lab1: do {
// call stem_noun_suffixes, line 470
if (!r_stem_noun_suffixes())
{
break lab1;
}
} while (false);
cursor = limit - v_2;
cursor = limit_backward; // call postlude, line 473
if (!r_postlude())
{
return false;
}
return true;
}
public boolean equals( Object o ) {
return o instanceof turkishStemmer;
}
public int hashCode() {
return turkishStemmer.class.getName().hashCode();
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/tokenize/AbstractTokenizer.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.tokenize;
import opennlp.tools.util.Span;
abstract class AbstractTokenizer implements Tokenizer {
public String[] tokenize(String s) {
return Span.spansToStrings(tokenizePos(s), s);
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/tokenize/DefaultTokenContextGenerator.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.tokenize;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Set;
import opennlp.tools.util.StringUtil;
/**
* Generate events for maxent decisions for tokenization.
*/
public class DefaultTokenContextGenerator implements TokenContextGenerator {
protected final Set<String> inducedAbbreviations;
/**
* Creates a default context generator for tokenizer.
*/
public DefaultTokenContextGenerator() {
this(Collections.emptySet());
}
/**
* Creates a default context generator for tokenizer.
*
* @param inducedAbbreviations the induced abbreviations
*/
public DefaultTokenContextGenerator(Set<String> inducedAbbreviations) {
this.inducedAbbreviations = inducedAbbreviations;
}
/* (non-Javadoc)
* @see opennlp.tools.tokenize.TokenContextGenerator#getContext(java.lang.String, int)
*/
public String[] getContext(String sentence, int index) {
List<String> preds = createContext(sentence, index);
String[] context = new String[preds.size()];
preds.toArray(context);
return context;
}
/**
* Returns an {@link ArrayList} of features for the specified sentence string
* at the specified index. Extensions of this class can override this method
* to create a customized {@link TokenContextGenerator}
*
* @param sentence
* the token been analyzed
* @param index
* the index of the character been analyzed
* @return an {@link ArrayList} of features for the specified sentence string
* at the specified index.
*/
protected List<String> createContext(String sentence, int index) {
List<String> preds = new ArrayList<>();
String prefix = sentence.substring(0, index);
String suffix = sentence.substring(index);
preds.add("p=" + prefix);
preds.add("s=" + suffix);
if (index > 0) {
addCharPreds("p1", sentence.charAt(index - 1), preds);
if (index > 1) {
addCharPreds("p2", sentence.charAt(index - 2), preds);
preds.add("p21=" + sentence.charAt(index - 2) + sentence.charAt(index - 1));
}
else {
preds.add("p2=bok");
}
preds.add("p1f1=" + sentence.charAt(index - 1) + sentence.charAt(index));
}
else {
preds.add("p1=bok");
}
addCharPreds("f1", sentence.charAt(index), preds);
if (index + 1 < sentence.length()) {
addCharPreds("f2", sentence.charAt(index + 1), preds);
preds.add("f12=" + sentence.charAt(index) + sentence.charAt(index + 1));
}
else {
preds.add("f2=bok");
}
if (sentence.charAt(0) == '&' && sentence.charAt(sentence.length() - 1) == ';') {
preds.add("cc");//character code
}
if (index == sentence.length() - 1 && inducedAbbreviations.contains(sentence)) {
preds.add("pabb");
}
return preds;
}
/**
* Helper function for getContext.
*/
protected void addCharPreds(String key, char c, List<String> preds) {
preds.add(key + "=" + c);
if (Character.isLetter(c)) {
preds.add(key + "_alpha");
if (Character.isUpperCase(c)) {
preds.add(key + "_caps");
}
}
else if (Character.isDigit(c)) {
preds.add(key + "_num");
}
else if (StringUtil.isWhitespace(c)) {
preds.add(key + "_ws");
}
else {
if (c == '.' || c == '?' || c == '!') {
preds.add(key + "_eos");
}
else if (c == '`' || c == '"' || c == '\'') {
preds.add(key + "_quote");
}
else if (c == '[' || c == '{' || c == '(') {
preds.add(key + "_lp");
}
else if (c == ']' || c == '}' || c == ')') {
preds.add(key + "_rp");
}
}
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/tokenize/DetokenizationDictionary.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.tokenize;
import java.io.BufferedInputStream;
import java.io.File;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.util.HashMap;
import java.util.Iterator;
import java.util.Map;
import opennlp.tools.dictionary.serializer.Attributes;
import opennlp.tools.dictionary.serializer.DictionaryEntryPersistor;
import opennlp.tools.dictionary.serializer.Entry;
import opennlp.tools.util.InvalidFormatException;
import opennlp.tools.util.StringList;
public class DetokenizationDictionary {
public enum Operation {
/**
* Attaches the token to the token on the right side.
*/
MOVE_RIGHT,
/**
* Attaches the token to the token on the left side.
*/
MOVE_LEFT,
/**
* Attaches the token to the token on the left and right sides.
*/
MOVE_BOTH,
/**
* Attaches the token token to the right token on first occurrence, and
* to the token on the left side on the second occurrence.
*/
RIGHT_LEFT_MATCHING;
public static Operation parse(String operation) {
if (MOVE_RIGHT.toString().equals(operation)) {
return MOVE_RIGHT;
}
else if (MOVE_LEFT.toString().equals(operation)) {
return MOVE_LEFT;
}
else if (MOVE_BOTH.toString().equals(operation)) {
return MOVE_BOTH;
}
else if (RIGHT_LEFT_MATCHING.toString().equals(operation)) {
return RIGHT_LEFT_MATCHING;
}
else {
return null;
}
}
}
private final Map<String, DetokenizationDictionary.Operation> operationTable = new HashMap<>();
/**
* Initializes the current instance.
*
* @param tokens an array of tokens that should be detokenized according to an operation
* @param operations an array of operations which specifies which operation
* should be used for the provided tokens
*/
public DetokenizationDictionary(String[] tokens,
DetokenizationDictionary.Operation[] operations) {
if (tokens.length != operations.length)
throw new IllegalArgumentException("tokens and ops must have the same length: tokens=" +
tokens.length + ", operations=" + operations.length + "!");
for (int i = 0; i < tokens.length; i++) {
String token = tokens[i];
DetokenizationDictionary.Operation operation = operations[i];
if (token == null)
throw new IllegalArgumentException("token at index " + i + " must not be null!");
if (operation == null)
throw new IllegalArgumentException("operation at index " + i + " must not be null!");
operationTable.put(token, operation);
}
}
public DetokenizationDictionary(InputStream in) throws IOException {
init(in);
}
public DetokenizationDictionary(File file) throws IOException {
try (InputStream in = new BufferedInputStream(new FileInputStream(file))) {
init(in);
}
}
private void init(InputStream in) throws IOException {
DictionaryEntryPersistor.create(in, entry -> {
String operationString = entry.getAttributes().getValue("operation");
StringList word = entry.getTokens();
if (word.size() != 1)
throw new InvalidFormatException("Each entry must have exactly one token! " + word);
// parse operation
Operation operation = Operation.parse(operationString);
if (operation == null)
throw new InvalidFormatException("Unknown operation type: " + operationString);
operationTable.put(word.getToken(0), operation);
});
}
DetokenizationDictionary.Operation getOperation(String token) {
return operationTable.get(token);
}
// serialize method
public void serialize(OutputStream out) throws IOException {
Iterator<Entry> entries = new Iterator<Entry>() {
Iterator<String> iterator = operationTable.keySet().iterator();
public boolean hasNext() {
return iterator.hasNext();
}
public Entry next() {
String token = iterator.next();
Attributes attributes = new Attributes();
attributes.setValue("operation", getOperation(token).toString());
return new Entry(new StringList(token), attributes);
}
public void remove() {
throw new UnsupportedOperationException();
}
};
DictionaryEntryPersistor.serialize(out, entries, false);
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/tokenize/Detokenizer.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.tokenize;
/**
* A Detokenizer merges tokens back to their untokenized representation.
*
*/
public interface Detokenizer {
/**
* This enum contains an operation for every token to merge the
* tokens together to their detokenized form.
*/
enum DetokenizationOperation {
/**
* The current token should be attached to the begin token on the right side.
*/
MERGE_TO_RIGHT,
/**
* The current token should be attached to the string on the left side.
*/
MERGE_TO_LEFT,
/**
* The current token should be attached to the string on the left side, as
* well as to the begin token on the right side.
*/
MERGE_BOTH,
/**
* Do not perform a merge operation for this token, but is possible that another
* token can be attached to the left or right side of this one.
*/
NO_OPERATION
}
/**
* Detokenize the input tokens.
*
* @param tokens the tokens to detokenize.
* @return the merge operations to detokenize the input tokens.
*/
DetokenizationOperation[] detokenize(String[] tokens);
/**
* Detokenize the input tokens into a String. Tokens which
* are connected without a space inbetween can be separated by
* a split marker.
*
* @param tokens the token which should be concatenated
* @param splitMarker the split marker or null
*
* @return the concatenated tokens
*/
String detokenize(String[] tokens, String splitMarker);
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/tokenize/DictionaryDetokenizer.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.tokenize;
import java.util.HashSet;
import java.util.Set;
/**
* A rule based detokenizer. Simple rules which indicate in which direction a token should be
* moved are looked up in a {@link DetokenizationDictionary} object.
*
* @see Detokenizer
* @see DetokenizationDictionary
*/
public class DictionaryDetokenizer implements Detokenizer {
private final DetokenizationDictionary dict;
public DictionaryDetokenizer(DetokenizationDictionary dict) {
this.dict = dict;
}
public DetokenizationOperation[] detokenize(String[] tokens) {
DetokenizationOperation[] operations = new DetokenizationOperation[tokens.length];
Set<String> matchingTokens = new HashSet<>();
for (int i = 0; i < tokens.length; i++) {
DetokenizationDictionary.Operation dictOperation = dict.getOperation(tokens[i]);
if (dictOperation == null) {
operations[i] = Detokenizer.DetokenizationOperation.NO_OPERATION;
}
else if (DetokenizationDictionary.Operation.MOVE_LEFT.equals(dictOperation)) {
operations[i] = Detokenizer.DetokenizationOperation.MERGE_TO_LEFT;
}
else if (DetokenizationDictionary.Operation.MOVE_RIGHT.equals(dictOperation)) {
operations[i] = Detokenizer.DetokenizationOperation.MERGE_TO_RIGHT;
}
else if (DetokenizationDictionary.Operation.MOVE_BOTH.equals(dictOperation)) {
operations[i] = Detokenizer.DetokenizationOperation.MERGE_BOTH;
}
else if (DetokenizationDictionary.Operation.RIGHT_LEFT_MATCHING.equals(dictOperation)) {
if (matchingTokens.contains(tokens[i])) {
// The token already occurred once, move it to the left
// and clear the occurrence flag
operations[i] = Detokenizer.DetokenizationOperation.MERGE_TO_LEFT;
matchingTokens.remove(tokens[i]);
}
else {
// First time this token is seen, move it to the right
// and remember it
operations[i] = Detokenizer.DetokenizationOperation.MERGE_TO_RIGHT;
matchingTokens.add(tokens[i]);
}
}
else {
throw new IllegalStateException("Unknown operation: " + dictOperation);
}
}
return operations;
}
public String detokenize(String[] tokens, String splitMarker) {
DetokenizationOperation[] operations = detokenize(tokens);
if (tokens.length != operations.length)
throw new IllegalArgumentException("tokens and operations array must have same length: tokens=" +
tokens.length + ", operations=" + operations.length + "!");
StringBuilder untokenizedString = new StringBuilder();
for (int i = 0; i < tokens.length; i++) {
// attach token to string buffer
untokenizedString.append(tokens[i]);
boolean isAppendSpace;
boolean isAppendSplitMarker;
// if this token is the last token do not attach a space
if (i + 1 == operations.length) {
isAppendSpace = false;
isAppendSplitMarker = false;
}
// if next token move left, no space after this token,
// its safe to access next token
else if (operations[i + 1].equals(DetokenizationOperation.MERGE_TO_LEFT)
|| operations[i + 1].equals(DetokenizationOperation.MERGE_BOTH)) {
isAppendSpace = false;
isAppendSplitMarker = true;
}
// if this token is move right, no space
else if (operations[i].equals(DetokenizationOperation.MERGE_TO_RIGHT)
|| operations[i].equals(DetokenizationOperation.MERGE_BOTH)) {
isAppendSpace = false;
isAppendSplitMarker = true;
}
else {
isAppendSpace = true;
isAppendSplitMarker = false;
}
if (isAppendSpace) {
untokenizedString.append(' ');
}
if (isAppendSplitMarker && splitMarker != null) {
untokenizedString.append(splitMarker);
}
}
return untokenizedString.toString();
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/tokenize/SimpleTokenizer.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.tokenize;
import java.util.ArrayList;
import java.util.List;
import opennlp.tools.util.Span;
import opennlp.tools.util.StringUtil;
/**
* Performs tokenization using character classes.
*/
public class SimpleTokenizer extends AbstractTokenizer {
static class CharacterEnum {
static final CharacterEnum WHITESPACE = new CharacterEnum("whitespace");
static final CharacterEnum ALPHABETIC = new CharacterEnum("alphabetic");
static final CharacterEnum NUMERIC = new CharacterEnum("numeric");
static final CharacterEnum OTHER = new CharacterEnum("other");
private String name;
private CharacterEnum(String name) {
this.name = name;
}
@Override
public String toString() {
return name;
}
}
public static final SimpleTokenizer INSTANCE;
static {
INSTANCE = new SimpleTokenizer();
}
/**
* @deprecated Use INSTANCE field instead to obtain an instance, constructor
* will be made private in the future.
*/
@Deprecated
public SimpleTokenizer() {
}
public Span[] tokenizePos(String s) {
CharacterEnum charType = CharacterEnum.WHITESPACE;
CharacterEnum state = charType;
List<Span> tokens = new ArrayList<>();
int sl = s.length();
int start = -1;
char pc = 0;
for (int ci = 0; ci < sl; ci++) {
char c = s.charAt(ci);
if (StringUtil.isWhitespace(c)) {
charType = CharacterEnum.WHITESPACE;
}
else if (Character.isLetter(c)) {
charType = CharacterEnum.ALPHABETIC;
}
else if (Character.isDigit(c)) {
charType = CharacterEnum.NUMERIC;
}
else {
charType = CharacterEnum.OTHER;
}
if (state == CharacterEnum.WHITESPACE) {
if (charType != CharacterEnum.WHITESPACE) {
start = ci;
}
}
else {
if (charType != state || charType == CharacterEnum.OTHER && c != pc) {
tokens.add(new Span(start, ci));
start = ci;
}
}
state = charType;
pc = c;
}
if (charType != CharacterEnum.WHITESPACE) {
tokens.add(new Span(start, sl));
}
return tokens.toArray(new Span[tokens.size()]);
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/tokenize/TokSpanEventStream.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.tokenize;
import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;
import java.util.regex.Pattern;
import opennlp.tools.ml.model.Event;
import opennlp.tools.tokenize.lang.Factory;
import opennlp.tools.util.AbstractEventStream;
import opennlp.tools.util.ObjectStream;
import opennlp.tools.util.Span;
/**
* This class reads the {@link TokenSample}s from the given {@link Iterator}
* and converts the {@link TokenSample}s into {@link Event}s which
* can be used by the maxent library for training.
*/
public class TokSpanEventStream extends AbstractEventStream<TokenSample> {
private TokenContextGenerator cg;
private boolean skipAlphaNumerics;
private final Pattern alphaNumeric;
/**
* Initializes the current instance.
*
* @param tokenSamples
* @param skipAlphaNumerics
* @param cg
*/
public TokSpanEventStream(ObjectStream<TokenSample> tokenSamples,
boolean skipAlphaNumerics, Pattern alphaNumeric, TokenContextGenerator cg) {
super(tokenSamples);
this.alphaNumeric = alphaNumeric;
this.skipAlphaNumerics = skipAlphaNumerics;
this.cg = cg;
}
/**
* Initializes the current instance.
*
* @param tokenSamples
* @param skipAlphaNumerics
* @param cg
*/
public TokSpanEventStream(ObjectStream<TokenSample> tokenSamples,
boolean skipAlphaNumerics, TokenContextGenerator cg) {
super(tokenSamples);
Factory factory = new Factory();
this.alphaNumeric = factory.getAlphanumeric(null);
this.skipAlphaNumerics = skipAlphaNumerics;
this.cg = cg;
}
/**
* Initializes the current instance.
*
* @param tokenSamples
* @param skipAlphaNumerics
*/
public TokSpanEventStream(ObjectStream<TokenSample> tokenSamples,
boolean skipAlphaNumerics) {
this(tokenSamples, skipAlphaNumerics, new DefaultTokenContextGenerator());
}
/**
* Adds training events to the event stream for each of the specified tokens.
*
* @param tokenSample character offsets into the specified text.
* @return The text of the tokens.
*/
@Override
protected Iterator<Event> createEvents(TokenSample tokenSample) {
List<Event> events = new ArrayList<>(50);
Span[] tokens = tokenSample.getTokenSpans();
String text = tokenSample.getText();
if (tokens.length > 0) {
int start = tokens[0].getStart();
int end = tokens[tokens.length - 1].getEnd();
String sent = text.substring(start, end);
Span[] candTokens = WhitespaceTokenizer.INSTANCE.tokenizePos(sent);
int firstTrainingToken = -1;
int lastTrainingToken = -1;
for (Span candToken : candTokens) {
Span cSpan = candToken;
String ctok = sent.substring(cSpan.getStart(), cSpan.getEnd());
//adjust cSpan to text offsets
cSpan = new Span(cSpan.getStart() + start, cSpan.getEnd() + start);
//should we skip this token
if (ctok.length() > 1 && (!skipAlphaNumerics || !alphaNumeric.matcher(ctok).matches())) {
//find offsets of annotated tokens inside of candidate tokens
boolean foundTrainingTokens = false;
for (int ti = lastTrainingToken + 1; ti < tokens.length; ti++) {
if (cSpan.contains(tokens[ti])) {
if (!foundTrainingTokens) {
firstTrainingToken = ti;
foundTrainingTokens = true;
}
lastTrainingToken = ti;
}
else if (cSpan.getEnd() < tokens[ti].getEnd()) {
break;
}
else if (tokens[ti].getEnd() < cSpan.getStart()) {
//keep looking
}
else {
System.out.println("Bad training token: " + tokens[ti] + " cand: " + cSpan +
" token=" + text.substring(tokens[ti].getStart(), tokens[ti].getEnd()));
}
}
// create training data
if (foundTrainingTokens) {
for (int ti = firstTrainingToken; ti <= lastTrainingToken; ti++) {
Span tSpan = tokens[ti];
int cStart = cSpan.getStart();
for (int i = tSpan.getStart() + 1; i < tSpan.getEnd(); i++) {
String[] context = cg.getContext(ctok, i - cStart);
events.add(new Event(TokenizerME.NO_SPLIT, context));
}
if (tSpan.getEnd() != cSpan.getEnd()) {
String[] context = cg.getContext(ctok, tSpan.getEnd() - cStart);
events.add(new Event(TokenizerME.SPLIT, context));
}
}
}
}
}
}
return events.iterator();
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/tokenize/TokenContextGenerator.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.tokenize;
/**
* Interface for {@link TokenizerME} context generators.
*/
public interface TokenContextGenerator {
/**
* Returns an array of features for the specified sentence string at the specified index.
*
* @param sentence The string for a sentence.
* @param index The index to consider splitting as a token.
*
* @return an array of features for the specified sentence string at the
* specified index.
*/
String[] getContext(String sentence, int index);
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/tokenize/TokenSample.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.tokenize;
import java.io.Serializable;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.List;
import java.util.Objects;
import opennlp.tools.tokenize.Detokenizer.DetokenizationOperation;
import opennlp.tools.util.Span;
/**
* A {@link TokenSample} is text with token spans.
*/
public class TokenSample implements Serializable {
public static final String DEFAULT_SEPARATOR_CHARS = "<SPLIT>";
private static final String separatorChars = DEFAULT_SEPARATOR_CHARS;
private final String text;
private final List<Span> tokenSpans;
/**
* Initializes the current instance.
*
* @param text the text which contains the tokens.
* @param tokenSpans the spans which mark the begin and end of the tokens.
*/
public TokenSample(String text, Span[] tokenSpans) {
Objects.requireNonNull(tokenSpans, "tokenSpans must not be null");
this.text = Objects.requireNonNull(text, "text must not be null");
this.tokenSpans = Collections.unmodifiableList(new ArrayList<>(Arrays.asList(tokenSpans)));
for (Span tokenSpan : tokenSpans) {
if (tokenSpan.getStart() < 0 || tokenSpan.getStart() > text.length() ||
tokenSpan.getEnd() > text.length() || tokenSpan.getEnd() < 0) {
throw new IllegalArgumentException("Span " + tokenSpan.toString() +
" is out of bounds, text length: " + text.length() + "!");
}
}
}
public TokenSample(Detokenizer detokenizer, String[] tokens) {
StringBuilder sentence = new StringBuilder();
DetokenizationOperation[] operations = detokenizer.detokenize(tokens);
List<Span> mergedTokenSpans = new ArrayList<>();
for (int i = 0; i < operations.length; i++) {
boolean isSeparateFromPreviousToken = i > 0 &&
!isMergeToRight(operations[i - 1]) &&
!isMergeToLeft(operations[i]);
if (isSeparateFromPreviousToken) {
sentence.append(' ');
}
int beginIndex = sentence.length();
sentence.append(tokens[i]);
mergedTokenSpans.add(new Span(beginIndex, sentence.length()));
}
text = sentence.toString();
tokenSpans = Collections.unmodifiableList(mergedTokenSpans);
}
private boolean isMergeToRight(DetokenizationOperation operation) {
return DetokenizationOperation.MERGE_TO_RIGHT.equals(operation)
|| DetokenizationOperation.MERGE_BOTH.equals(operation);
}
private boolean isMergeToLeft(DetokenizationOperation operation) {
return DetokenizationOperation.MERGE_TO_LEFT.equals(operation)
|| DetokenizationOperation.MERGE_BOTH.equals(operation);
}
/**
* Retrieves the text.
*/
public String getText() {
return text;
}
/**
* Retrieves the token spans.
*/
public Span[] getTokenSpans() {
return tokenSpans.toArray(new Span[tokenSpans.size()]);
}
@Override
public String toString() {
StringBuilder sentence = new StringBuilder();
int lastEndIndex = -1;
for (Span token : tokenSpans) {
if (lastEndIndex != -1) {
// If there are no chars between last token
// and this token insert the separator chars
// otherwise insert a space
String separator;
if (lastEndIndex == token.getStart())
separator = separatorChars;
else
separator = " ";
sentence.append(separator);
}
sentence.append(token.getCoveredText(text));
lastEndIndex = token.getEnd();
}
return sentence.toString();
}
private static void addToken(StringBuilder sample, List<Span> tokenSpans,
String token, boolean isNextMerged) {
int tokenSpanStart = sample.length();
sample.append(token);
int tokenSpanEnd = sample.length();
tokenSpans.add(new Span(tokenSpanStart, tokenSpanEnd));
if (!isNextMerged)
sample.append(" ");
}
public static TokenSample parse(String sampleString, String separatorChars) {
Objects.requireNonNull(sampleString, "sampleString must not be null");
Objects.requireNonNull(separatorChars, "separatorChars must not be null");
Span[] whitespaceTokenSpans = WhitespaceTokenizer.INSTANCE.tokenizePos(sampleString);
// Pre-allocate 20% for newly created tokens
List<Span> realTokenSpans = new ArrayList<>((int) (whitespaceTokenSpans.length * 1.2d));
StringBuilder untaggedSampleString = new StringBuilder();
for (Span whiteSpaceTokenSpan : whitespaceTokenSpans) {
String whitespaceToken = whiteSpaceTokenSpan.getCoveredText(sampleString).toString();
boolean wasTokenReplaced = false;
int tokStart = 0;
int tokEnd;
while ((tokEnd = whitespaceToken.indexOf(separatorChars, tokStart)) > -1) {
String token = whitespaceToken.substring(tokStart, tokEnd);
addToken(untaggedSampleString, realTokenSpans, token, true);
tokStart = tokEnd + separatorChars.length();
wasTokenReplaced = true;
}
if (wasTokenReplaced) {
// If the token contains the split chars at least once
// a span for the last token must still be added
String token = whitespaceToken.substring(tokStart);
addToken(untaggedSampleString, realTokenSpans, token, false);
}
else {
// If it does not contain the split chars at lest once
// just copy the original token span
addToken(untaggedSampleString, realTokenSpans, whitespaceToken, false);
}
}
return new TokenSample(untaggedSampleString.toString(), realTokenSpans.toArray(
new Span[realTokenSpans.size()]));
}
@Override
public int hashCode() {
return Objects.hash(getText(), Arrays.hashCode(getTokenSpans()));
}
@Override
public boolean equals(Object obj) {
if (this == obj) {
return true;
}
if (obj instanceof TokenSample) {
TokenSample a = (TokenSample) obj;
return getText().equals(a.getText())
&& Arrays.equals(getTokenSpans(), a.getTokenSpans());
}
return false;
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/tokenize/TokenSampleStream.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.tokenize;
import java.io.IOException;
import java.util.Objects;
import opennlp.tools.util.FilterObjectStream;
import opennlp.tools.util.ObjectStream;
/**
* This class is a stream filter which reads in string encoded samples and creates
* {@link TokenSample}s out of them. The input string sample is tokenized if a
* whitespace or the special separator chars occur.
* <p>
* Sample:<br>
* "token1 token2 token3<SPLIT>token4"<br>
* The tokens token1 and token2 are separated by a whitespace, token3 and token3
* are separated by the special character sequence, in this case the default
* split sequence.
* <p>
* The sequence must be unique in the input string and is not escaped.
*/
public class TokenSampleStream extends FilterObjectStream<String, TokenSample> {
private final String separatorChars;
public TokenSampleStream(ObjectStream<String> sampleStrings, String separatorChars) {
super(Objects.requireNonNull(sampleStrings, "sampleStrings must not be null"));
this.separatorChars = Objects.requireNonNull(separatorChars,"separatorChars must not be null");
}
public TokenSampleStream(ObjectStream<String> sentences) {
this(sentences, TokenSample.DEFAULT_SEPARATOR_CHARS);
}
public TokenSample read() throws IOException {
String sampleString = samples.read();
if (sampleString != null) {
return TokenSample.parse(sampleString, separatorChars);
}
else {
return null;
}
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/tokenize/Tokenizer.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.tokenize;
import opennlp.tools.util.Span;
/**
* The interface for tokenizers, which segment a string into its tokens.
* <p>
* Tokenization is a necessary step before more complex NLP tasks can be applied,
* these usually process text on a token level. The quality of tokenization is
* important because it influences the performance of high-level task applied to it.
* <p>
* In segmented languages like English most words are segmented by white spaces
* expect for punctuations, etc. which is directly attached to the word without a white space
* in between, it is not possible to just split at all punctuations because in abbreviations dots
* are a part of the token itself. A tokenizer is now responsible to split these tokens
* correctly.
* <p>
* In non-segmented languages like Chinese tokenization is more difficult since words
* are not segmented by a whitespace.
* <p>
* Tokenizers can also be used to segment already identified tokens further into more
* atomic parts to get a deeper understanding. This approach helps more complex task
* to gain insight into tokens which do not represent words like numbers, units or tokens
* which are part of a special notation.
* <p>
* For most further task it is desirable to over tokenize rather than under tokenize.
*/
public interface Tokenizer {
/**
* Splits a string into its atomic parts
*
* @param s The string to be tokenized.
* @return The String[] with the individual tokens as the array
* elements.
*/
String[] tokenize(String s);
/**
* Finds the boundaries of atomic parts in a string.
*
* @param s The string to be tokenized.
* @return The Span[] with the spans (offsets into s) for each
* token as the individuals array elements.
*/
Span[] tokenizePos(String s);
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/tokenize/TokenizerCrossValidator.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.tokenize;
import java.io.IOException;
import opennlp.tools.util.ObjectStream;
import opennlp.tools.util.TrainingParameters;
import opennlp.tools.util.eval.CrossValidationPartitioner;
import opennlp.tools.util.eval.FMeasure;
public class TokenizerCrossValidator {
private final TrainingParameters params;
private FMeasure fmeasure = new FMeasure();
private TokenizerEvaluationMonitor[] listeners;
private final TokenizerFactory factory;
public TokenizerCrossValidator(TrainingParameters params,
TokenizerFactory factory, TokenizerEvaluationMonitor... listeners) {
this.params = params;
this.listeners = listeners;
this.factory = factory;
}
/**
* Starts the evaluation.
*
* @param samples
* the data to train and test
* @param nFolds
* number of folds
*
* @throws IOException
*/
public void evaluate(ObjectStream<TokenSample> samples, int nFolds) throws IOException {
CrossValidationPartitioner<TokenSample> partitioner =
new CrossValidationPartitioner<>(samples, nFolds);
while (partitioner.hasNext()) {
CrossValidationPartitioner.TrainingSampleStream<TokenSample> trainingSampleStream =
partitioner.next();
// Maybe throws IOException if temporary file handling fails ...
TokenizerModel model = TokenizerME.train(trainingSampleStream, this.factory, params);
TokenizerEvaluator evaluator = new TokenizerEvaluator(new TokenizerME(model), listeners);
evaluator.evaluate(trainingSampleStream.getTestSampleStream());
fmeasure.mergeInto(evaluator.getFMeasure());
}
}
public FMeasure getFMeasure() {
return fmeasure;
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/tokenize/TokenizerEvaluationMonitor.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.tokenize;
import opennlp.tools.util.eval.EvaluationMonitor;
public interface TokenizerEvaluationMonitor extends
EvaluationMonitor<TokenSample> {
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/tokenize/TokenizerEvaluator.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.tokenize;
import opennlp.tools.util.Span;
import opennlp.tools.util.eval.Evaluator;
import opennlp.tools.util.eval.FMeasure;
/**
* The {@link TokenizerEvaluator} measures the performance of
* the given {@link Tokenizer} with the provided reference
* {@link TokenSample}s.
*
* @see Evaluator
* @see Tokenizer
* @see TokenSample
*/
public class TokenizerEvaluator extends Evaluator<TokenSample> {
private FMeasure fmeasure = new FMeasure();
/**
* The {@link Tokenizer} used to create the
* predicted tokens.
*/
private Tokenizer tokenizer;
/**
* Initializes the current instance with the
* given {@link Tokenizer}.
*
* @param tokenizer the {@link Tokenizer} to evaluate.
* @param listeners evaluation sample listeners
*/
public TokenizerEvaluator(Tokenizer tokenizer, TokenizerEvaluationMonitor ... listeners) {
super(listeners);
this.tokenizer = tokenizer;
}
@Override
protected TokenSample processSample(TokenSample reference) {
Span[] predictions = tokenizer.tokenizePos(reference.getText());
fmeasure.updateScores(reference.getTokenSpans(), predictions);
return new TokenSample(reference.getText(), predictions);
}
public FMeasure getFMeasure() {
return fmeasure;
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/tokenize/TokenizerFactory.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.tokenize;
import java.util.Collections;
import java.util.Map;
import java.util.Set;
import java.util.regex.Pattern;
import opennlp.tools.dictionary.Dictionary;
import opennlp.tools.tokenize.lang.Factory;
import opennlp.tools.util.BaseToolFactory;
import opennlp.tools.util.InvalidFormatException;
import opennlp.tools.util.ext.ExtensionLoader;
/**
* The factory that provides {@link Tokenizer} default implementations and
* resources. Users can extend this class if their application requires
* overriding the {@link TokenContextGenerator}, {@link Dictionary} etc.
*/
public class TokenizerFactory extends BaseToolFactory {
private String languageCode;
private Dictionary abbreviationDictionary;
private Boolean useAlphaNumericOptimization = false;
private Pattern alphaNumericPattern;
private static final String ABBREVIATIONS_ENTRY_NAME = "abbreviations.dictionary";
private static final String USE_ALPHA_NUMERIC_OPTIMIZATION = "useAlphaNumericOptimization";
private static final String ALPHA_NUMERIC_PATTERN = "alphaNumericPattern";
/**
* Creates a {@link TokenizerFactory} that provides the default implementation
* of the resources.
*/
public TokenizerFactory() {
}
/**
* Creates a {@link TokenizerFactory}. Use this constructor to
* programmatically create a factory.
*
* @param languageCode
* the language of the natural text
* @param abbreviationDictionary
* an abbreviations dictionary
* @param useAlphaNumericOptimization
* if true alpha numerics are skipped
* @param alphaNumericPattern
* null or a custom alphanumeric pattern (default is:
* "^[A-Za-z0-9]+$", provided by {@link Factory#DEFAULT_ALPHANUMERIC}
*/
public TokenizerFactory(String languageCode,
Dictionary abbreviationDictionary, boolean useAlphaNumericOptimization,
Pattern alphaNumericPattern) {
this.init(languageCode, abbreviationDictionary,
useAlphaNumericOptimization, alphaNumericPattern);
}
protected void init(String languageCode, Dictionary abbreviationDictionary,
boolean useAlphaNumericOptimization, Pattern alphaNumericPattern) {
this.languageCode = languageCode;
this.useAlphaNumericOptimization = useAlphaNumericOptimization;
this.alphaNumericPattern = alphaNumericPattern;
this.abbreviationDictionary = abbreviationDictionary;
}
@Override
public void validateArtifactMap() throws InvalidFormatException {
if (this.artifactProvider.getManifestProperty(USE_ALPHA_NUMERIC_OPTIMIZATION) == null)
throw new InvalidFormatException(USE_ALPHA_NUMERIC_OPTIMIZATION
+ " is a mandatory property!");
Object abbreviationsEntry = this.artifactProvider.getArtifact(ABBREVIATIONS_ENTRY_NAME);
if (abbreviationsEntry != null && !(abbreviationsEntry instanceof Dictionary)) {
throw new InvalidFormatException("Abbreviations dictionary '" + abbreviationsEntry +
"' has wrong type, needs to be of type Dictionary!");
}
}
@Override
public Map<String, Object> createArtifactMap() {
Map<String, Object> artifactMap = super.createArtifactMap();
// Abbreviations are optional
if (abbreviationDictionary != null) {
artifactMap.put(ABBREVIATIONS_ENTRY_NAME, abbreviationDictionary);
}
return artifactMap;
}
@Override
public Map<String, String> createManifestEntries() {
Map<String, String> manifestEntries = super.createManifestEntries();
manifestEntries.put(USE_ALPHA_NUMERIC_OPTIMIZATION,
Boolean.toString(isUseAlphaNumericOptmization()));
// alphanumeric pattern is optional
if (getAlphaNumericPattern() != null) {
manifestEntries.put(ALPHA_NUMERIC_PATTERN, getAlphaNumericPattern().pattern());
}
return manifestEntries;
}
/**
* Factory method the framework uses create a new {@link TokenizerFactory}.
*
* @param subclassName the name of the class implementing the {@link TokenizerFactory}
* @param languageCode the language code the tokenizer should use
* @param abbreviationDictionary an optional dictionary containing abbreviations, or null if not present
* @param useAlphaNumericOptimization indicate if the alpha numeric optimization
* should be enabled or disabled
* @param alphaNumericPattern the pattern the alpha numeric optimization should use
*
* @return the instance of the Tokenizer Factory
*
* @throws InvalidFormatException if once of the input parameters doesn't comply if the expected format
*/
public static TokenizerFactory create(String subclassName,
String languageCode, Dictionary abbreviationDictionary,
boolean useAlphaNumericOptimization, Pattern alphaNumericPattern)
throws InvalidFormatException {
if (subclassName == null) {
// will create the default factory
return new TokenizerFactory(languageCode, abbreviationDictionary,
useAlphaNumericOptimization, alphaNumericPattern);
}
try {
TokenizerFactory theFactory = ExtensionLoader.instantiateExtension(
TokenizerFactory.class, subclassName);
theFactory.init(languageCode, abbreviationDictionary,
useAlphaNumericOptimization, alphaNumericPattern);
return theFactory;
} catch (Exception e) {
String msg = "Could not instantiate the " + subclassName
+ ". The initialization throw an exception.";
System.err.println(msg);
e.printStackTrace();
throw new InvalidFormatException(msg, e);
}
}
/**
* Gets the alpha numeric pattern.
*
* @return the user specified alpha numeric pattern or a default.
*/
public Pattern getAlphaNumericPattern() {
if (this.alphaNumericPattern == null) {
if (this.artifactProvider != null) {
String prop = this.artifactProvider.getManifestProperty(ALPHA_NUMERIC_PATTERN);
if (prop != null) {
this.alphaNumericPattern = Pattern.compile(prop);
}
}
// could not load from manifest, will get from language dependent factory
if (this.alphaNumericPattern == null) {
Factory f = new Factory();
this.alphaNumericPattern = f.getAlphanumeric(languageCode);
}
}
return this.alphaNumericPattern;
}
/**
* Gets whether to use alphanumeric optimization.
*
* @return true if the alpha numeric optimization is enabled, otherwise false
*/
public boolean isUseAlphaNumericOptmization() {
if (artifactProvider != null) {
this.useAlphaNumericOptimization = Boolean.valueOf(this.artifactProvider
.getManifestProperty(USE_ALPHA_NUMERIC_OPTIMIZATION));
}
return this.useAlphaNumericOptimization;
}
/**
* Gets the abbreviation dictionary
*
* @return null or the abbreviation dictionary
*/
public Dictionary getAbbreviationDictionary() {
if (this.abbreviationDictionary == null && artifactProvider != null) {
this.abbreviationDictionary = this.artifactProvider.getArtifact(ABBREVIATIONS_ENTRY_NAME);
}
return this.abbreviationDictionary;
}
/**
* Retrieves the language code.
*
* @return the language code
*/
public String getLanguageCode() {
if (this.languageCode == null && this.artifactProvider != null) {
this.languageCode = this.artifactProvider.getLanguage();
}
return this.languageCode;
}
/**
* Gets the context generator
*
* @return a new instance of the context generator
*/
public TokenContextGenerator getContextGenerator() {
Factory f = new Factory();
Set<String> abbs;
Dictionary abbDict = getAbbreviationDictionary();
if (abbDict != null) {
abbs = abbDict.asStringSet();
} else {
abbs = Collections.emptySet();
}
return f.createTokenContextGenerator(getLanguageCode(), abbs);
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/tokenize/TokenizerME.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.tokenize;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Set;
import java.util.regex.Pattern;
import opennlp.tools.dictionary.Dictionary;
import opennlp.tools.ml.EventTrainer;
import opennlp.tools.ml.TrainerFactory;
import opennlp.tools.ml.model.Event;
import opennlp.tools.ml.model.MaxentModel;
import opennlp.tools.tokenize.lang.Factory;
import opennlp.tools.util.ObjectStream;
import opennlp.tools.util.Span;
import opennlp.tools.util.TrainingParameters;
/**
* A Tokenizer for converting raw text into separated tokens. It uses
* Maximum Entropy to make its decisions. The features are loosely
* based off of Jeff Reynar's UPenn thesis "Topic Segmentation:
* Algorithms and Applications.", which is available from his
* homepage: <a href="http://www.cis.upenn.edu/~jcreynar">http://www.cis.upenn.edu/~jcreynar</a>.
* <p>
* This tokenizer needs a statistical model to tokenize a text which reproduces
* the tokenization observed in the training data used to create the model.
* The {@link TokenizerModel} class encapsulates the model and provides
* methods to create it from the binary representation.
* <p>
* A tokenizer instance is not thread safe. For each thread one tokenizer
* must be instantiated which can share one <code>TokenizerModel</code> instance
* to safe memory.
* <p>
* To train a new model {{@link #train(ObjectStream, TokenizerFactory, TrainingParameters)} method
* can be used.
* <p>
* Sample usage:
* <p>
* <code>
* InputStream modelIn;<br>
* <br>
* ...<br>
* <br>
* TokenizerModel model = TokenizerModel(modelIn);<br>
* <br>
* Tokenizer tokenizer = new TokenizerME(model);<br>
* <br>
* String tokens[] = tokenizer.tokenize("A sentence to be tokenized.");
* </code>
*
* @see Tokenizer
* @see TokenizerModel
* @see TokenSample
*/
public class TokenizerME extends AbstractTokenizer {
/**
* Constant indicates a token split.
*/
public static final String SPLIT = "T";
/**
* Constant indicates no token split.
*/
public static final String NO_SPLIT = "F";
/**
* Alpha-Numeric Pattern
* @deprecated As of release 1.5.2, replaced by {@link Factory#getAlphanumeric(String)}
*/
@Deprecated
public static final Pattern alphaNumeric = Pattern.compile(Factory.DEFAULT_ALPHANUMERIC);
private final Pattern alphanumeric;
/**
* The maximum entropy model to use to evaluate contexts.
*/
private MaxentModel model;
/**
* The context generator.
*/
private final TokenContextGenerator cg;
/**
* Optimization flag to skip alpha numeric tokens for further
* tokenization
*/
private boolean useAlphaNumericOptimization;
/**
* List of probabilities for each token returned from a call to
* <code>tokenize</code> or <code>tokenizePos</code>.
*/
private List<Double> tokProbs;
private List<Span> newTokens;
public TokenizerME(TokenizerModel model) {
TokenizerFactory factory = model.getFactory();
this.alphanumeric = factory.getAlphaNumericPattern();
this.cg = factory.getContextGenerator();
this.model = model.getMaxentModel();
this.useAlphaNumericOptimization = factory.isUseAlphaNumericOptmization();
newTokens = new ArrayList<>();
tokProbs = new ArrayList<>(50);
}
/**
* @deprecated use {@link TokenizerFactory} to extend the Tokenizer
* functionality
*/
public TokenizerME(TokenizerModel model, Factory factory) {
String languageCode = model.getLanguage();
this.alphanumeric = factory.getAlphanumeric(languageCode);
this.cg = factory.createTokenContextGenerator(languageCode,
getAbbreviations(model.getAbbreviations()));
this.model = model.getMaxentModel();
useAlphaNumericOptimization = model.useAlphaNumericOptimization();
newTokens = new ArrayList<>();
tokProbs = new ArrayList<>(50);
}
private static Set<String> getAbbreviations(Dictionary abbreviations) {
if (abbreviations == null) {
return Collections.emptySet();
}
return abbreviations.asStringSet();
}
/**
* Returns the probabilities associated with the most recent
* calls to {@link TokenizerME#tokenize(String)} or {@link TokenizerME#tokenizePos(String)}.
*
* @return probability for each token returned for the most recent
* call to tokenize. If not applicable an empty array is returned.
*/
public double[] getTokenProbabilities() {
double[] tokProbArray = new double[tokProbs.size()];
for (int i = 0; i < tokProbArray.length; i++) {
tokProbArray[i] = tokProbs.get(i);
}
return tokProbArray;
}
/**
* Tokenizes the string.
*
* @param d The string to be tokenized.
*
* @return A span array containing individual tokens as elements.
*/
public Span[] tokenizePos(String d) {
Span[] tokens = WhitespaceTokenizer.INSTANCE.tokenizePos(d);
newTokens.clear();
tokProbs.clear();
for (Span s : tokens) {
String tok = d.substring(s.getStart(), s.getEnd());
// Can't tokenize single characters
if (tok.length() < 2) {
newTokens.add(s);
tokProbs.add(1d);
} else if (useAlphaNumericOptimization() && alphanumeric.matcher(tok).matches()) {
newTokens.add(s);
tokProbs.add(1d);
} else {
int start = s.getStart();
int end = s.getEnd();
final int origStart = s.getStart();
double tokenProb = 1.0;
for (int j = origStart + 1; j < end; j++) {
double[] probs =
model.eval(cg.getContext(tok, j - origStart));
String best = model.getBestOutcome(probs);
tokenProb *= probs[model.getIndex(best)];
if (best.equals(TokenizerME.SPLIT)) {
newTokens.add(new Span(start, j));
tokProbs.add(tokenProb);
start = j;
tokenProb = 1.0;
}
}
newTokens.add(new Span(start, end));
tokProbs.add(tokenProb);
}
}
Span[] spans = new Span[newTokens.size()];
newTokens.toArray(spans);
return spans;
}
/**
* Trains a model for the {@link TokenizerME}.
*
* @param samples
* the samples used for the training.
* @param factory
* a {@link TokenizerFactory} to get resources from
* @param mlParams
* the machine learning train parameters
* @return the trained {@link TokenizerModel}
* @throws IOException
* it throws an {@link IOException} if an {@link IOException} is
* thrown during IO operations on a temp file which is created
* during training. Or if reading from the {@link ObjectStream}
* fails.
*/
public static TokenizerModel train(ObjectStream<TokenSample> samples, TokenizerFactory factory,
TrainingParameters mlParams) throws IOException {
Map<String, String> manifestInfoEntries = new HashMap<>();
ObjectStream<Event> eventStream = new TokSpanEventStream(samples,
factory.isUseAlphaNumericOptmization(),
factory.getAlphaNumericPattern(), factory.getContextGenerator());
EventTrainer trainer = TrainerFactory.getEventTrainer(
mlParams, manifestInfoEntries);
MaxentModel maxentModel = trainer.train(eventStream);
return new TokenizerModel(maxentModel, manifestInfoEntries, factory);
}
/**
* Returns the value of the alpha-numeric optimization flag.
*
* @return true if the tokenizer should use alpha-numeric optimization, false otherwise.
*/
public boolean useAlphaNumericOptimization() {
return useAlphaNumericOptimization;
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/tokenize/TokenizerModel.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.tokenize;
import java.io.File;
import java.io.IOException;
import java.io.InputStream;
import java.net.URL;
import java.nio.file.Path;
import java.util.Map;
import opennlp.tools.dictionary.Dictionary;
import opennlp.tools.ml.model.AbstractModel;
import opennlp.tools.ml.model.MaxentModel;
import opennlp.tools.util.BaseToolFactory;
import opennlp.tools.util.InvalidFormatException;
import opennlp.tools.util.model.BaseModel;
import opennlp.tools.util.model.ModelUtil;
/**
* The {@link TokenizerModel} is the model used
* by a learnable {@link Tokenizer}.
*
* @see TokenizerME
*/
public final class TokenizerModel extends BaseModel {
private static final String COMPONENT_NAME = "TokenizerME";
private static final String TOKENIZER_MODEL_ENTRY = "token.model";
/**
* Initializes the current instance.
*
* @param tokenizerModel the model
* @param manifestInfoEntries the manifest
* @param tokenizerFactory the factory
*/
public TokenizerModel(MaxentModel tokenizerModel,
Map<String, String> manifestInfoEntries, TokenizerFactory tokenizerFactory) {
super(COMPONENT_NAME, tokenizerFactory.getLanguageCode(), manifestInfoEntries, tokenizerFactory);
artifactMap.put(TOKENIZER_MODEL_ENTRY, tokenizerModel);
checkArtifactMap();
}
/**
* Initializes the current instance.
*
* @param in the Input Stream to load the model from
*
* @throws IOException if reading from the stream fails in anyway
* @throws InvalidFormatException if the stream doesn't have the expected format
*/
public TokenizerModel(InputStream in) throws IOException {
super(COMPONENT_NAME, in);
}
/**
* Initializes the current instance.
*
* @param modelFile the file containing the tokenizer model
*
* @throws IOException if reading from the stream fails in anyway
*/
public TokenizerModel(File modelFile) throws IOException {
super(COMPONENT_NAME, modelFile);
}
public TokenizerModel(Path modelPath) throws IOException {
this(modelPath.toFile());
}
/**
* Initializes the current instance.
*
* @param modelURL the URL pointing to the tokenizer model
*
* @throws IOException if reading from the stream fails in anyway
*/
public TokenizerModel(URL modelURL) throws IOException {
super(COMPONENT_NAME, modelURL);
}
/**
* Checks if the tokenizer model has the right outcomes.
*
* @param model
* @return
*/
private static boolean isModelCompatible(MaxentModel model) {
return ModelUtil.validateOutcomes(model, TokenizerME.SPLIT, TokenizerME.NO_SPLIT);
}
@Override
protected void validateArtifactMap() throws InvalidFormatException {
super.validateArtifactMap();
if (!(artifactMap.get(TOKENIZER_MODEL_ENTRY) instanceof AbstractModel)) {
throw new InvalidFormatException("Token model is incomplete!");
}
if (!isModelCompatible(getMaxentModel())) {
throw new InvalidFormatException("The maxent model is not compatible with the tokenizer!");
}
}
public TokenizerFactory getFactory() {
return (TokenizerFactory) this.toolFactory;
}
@Override
protected Class<? extends BaseToolFactory> getDefaultFactory() {
return TokenizerFactory.class;
}
public MaxentModel getMaxentModel() {
return (MaxentModel) artifactMap.get(TOKENIZER_MODEL_ENTRY);
}
public Dictionary getAbbreviations() {
if (getFactory() != null) {
return getFactory().getAbbreviationDictionary();
}
return null;
}
public boolean useAlphaNumericOptimization() {
return getFactory() != null && getFactory().isUseAlphaNumericOptmization();
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/tokenize/TokenizerStream.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.tokenize;
import java.io.IOException;
import opennlp.tools.util.ObjectStream;
import opennlp.tools.util.Span;
/**
* The {@link TokenizerStream} uses a tokenizer to tokenize the
* input string and output {@link TokenSample}s.
*/
public class TokenizerStream implements ObjectStream<TokenSample> {
private Tokenizer tokenizer;
private ObjectStream<String> input;
public TokenizerStream(Tokenizer tokenizer, ObjectStream<String> input) {
this.tokenizer = tokenizer;
this.input = input;
}
public TokenSample read() throws IOException {
String inputString = input.read();
if (inputString != null) {
Span[] tokens = tokenizer.tokenizePos(inputString);
return new TokenSample(inputString, tokens);
}
return null;
}
public void close() throws IOException {
input.close();
}
public void reset() throws IOException,
UnsupportedOperationException {
input.reset();
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/tokenize/WhitespaceTokenStream.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.tokenize;
import java.io.IOException;
import opennlp.tools.util.FilterObjectStream;
import opennlp.tools.util.ObjectStream;
import opennlp.tools.util.Span;
/**
* This stream formats a {@link TokenSample}s into whitespace
* separated token strings.
*/
public class WhitespaceTokenStream extends FilterObjectStream<TokenSample, String> {
public WhitespaceTokenStream(ObjectStream<TokenSample> tokens) {
super(tokens);
}
public String read() throws IOException {
TokenSample tokenSample = samples.read();
if (tokenSample != null) {
StringBuilder whitespaceSeparatedTokenString = new StringBuilder();
for (Span token : tokenSample.getTokenSpans()) {
whitespaceSeparatedTokenString.append(
token.getCoveredText(tokenSample.getText()));
whitespaceSeparatedTokenString.append(' ');
}
// Shorten string by one to get rid of last space
if (whitespaceSeparatedTokenString.length() > 0) {
whitespaceSeparatedTokenString.setLength(
whitespaceSeparatedTokenString.length() - 1 );
}
return whitespaceSeparatedTokenString.toString();
}
return null;
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/tokenize/WhitespaceTokenizer.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.tokenize;
import java.util.ArrayList;
import java.util.List;
import opennlp.tools.util.Span;
import opennlp.tools.util.StringUtil;
/**
* This tokenizer uses white spaces to tokenize the input text.
*
* To obtain an instance of this tokenizer use the static final
* <code>INSTANCE</code> field.
*/
public class WhitespaceTokenizer extends AbstractTokenizer {
/**
* Use this static reference to retrieve an instance of the
* {@link WhitespaceTokenizer}.
*/
public static final WhitespaceTokenizer INSTANCE = new WhitespaceTokenizer();
/**
* Use the {@link WhitespaceTokenizer#INSTANCE} field to retrieve an instance.
*/
private WhitespaceTokenizer() {
}
public Span[] tokenizePos(String d) {
int tokStart = -1;
List<Span> tokens = new ArrayList<>();
boolean inTok = false;
//gather up potential tokens
int end = d.length();
for (int i = 0; i < end; i++) {
if (StringUtil.isWhitespace(d.charAt(i))) {
if (inTok) {
tokens.add(new Span(tokStart, i));
inTok = false;
tokStart = -1;
}
}
else {
if (!inTok) {
tokStart = i;
inTok = true;
}
}
}
if (inTok) {
tokens.add(new Span(tokStart, end));
}
return tokens.toArray(new Span[tokens.size()]);
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/tokenize/package-info.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
/**
* Contains classes related to finding token or words in a string. All
* tokenizer implement the Tokenizer interface. Currently there is the
* learnable <code>TokenizerME</code>, the <code>WhitespaceTokenizer</code> and
* the <code>SimpleTokenizer</code> which is a character class tokenizer.
*/
package opennlp.tools.tokenize;
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/tokenize
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/tokenize/lang/Factory.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.tokenize.lang;
import java.util.Set;
import java.util.regex.Pattern;
import opennlp.tools.tokenize.DefaultTokenContextGenerator;
import opennlp.tools.tokenize.TokenContextGenerator;
public class Factory {
public static final String DEFAULT_ALPHANUMERIC = "^[A-Za-z0-9]+$";
/**
* Gets the alpha numeric pattern for the language. Please save the value
* locally because this call is expensive.
*
* @param languageCode
* the language code. If null or unknow the default pattern will be
* returned.
* @return the alpha numeric pattern for the language or the default pattern.
*/
public Pattern getAlphanumeric(String languageCode) {
if ("pt".equals(languageCode) || "por".equals(languageCode)) {
return Pattern.compile("^[0-9a-záãâàéêíóõôúüçA-ZÁÃÂÀÉÊÍÓÕÔÚÜÇ]+$");
}
return Pattern.compile(DEFAULT_ALPHANUMERIC);
}
public TokenContextGenerator createTokenContextGenerator(String languageCode, Set<String> abbreviations) {
return new DefaultTokenContextGenerator(abbreviations);
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/tokenize/lang
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/tokenize/lang/en/TokenSampleStream.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.tokenize.lang.en;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;
import java.util.regex.Pattern;
import opennlp.tools.tokenize.TokenSample;
import opennlp.tools.util.Span;
/**
* Class which produces an Iterator<TokenSample> from a file of space delimited token.
* This class uses a number of English-specific heuristics to un-separate tokens which
* are typically found together in text.
*/
public class TokenSampleStream implements Iterator<TokenSample> {
private BufferedReader in;
private String line;
private Pattern alphaNumeric = Pattern.compile("[A-Za-z0-9]");
private boolean evenq = true;
public TokenSampleStream(InputStream is) throws IOException {
this.in = new BufferedReader(new InputStreamReader(is));
line = in.readLine();
}
public boolean hasNext() {
return line != null;
}
public TokenSample next() {
String[] tokens = line.split("\\s+");
if (tokens.length == 0) {
evenq = true;
}
StringBuilder sb = new StringBuilder(line.length());
List<Span> spans = new ArrayList<>();
int length = 0;
for (int ti = 0; ti < tokens.length; ti++) {
String token = tokens[ti];
String lastToken = ti - 1 >= 0 ? tokens[ti - 1] : "";
switch (token) {
case "-LRB-":
token = "(";
break;
case "-LCB-":
token = "{";
break;
case "-RRB-":
token = ")";
break;
case "-RCB-":
token = "}";
break;
}
if (sb.length() != 0) {
if (!alphaNumeric.matcher(token).find() || token.startsWith("'") || token.equalsIgnoreCase("n't")) {
if ((token.equals("``") || token.equals("--") || token.equals("$") ||
token.equals("(") || token.equals("&") || token.equals("#") ||
(token.equals("\"") && (evenq && ti != tokens.length - 1)))
&& (!lastToken.equals("(") || !lastToken.equals("{"))) {
//System.out.print(" "+token);
length++;
}
}
else {
if (!lastToken.equals("``") && (!lastToken.equals("\"") || evenq) && !lastToken.equals("(")
&& !lastToken.equals("{") && !lastToken.equals("$") && !lastToken.equals("#")) {
length++;
}
}
}
if (token.equals("\"")) {
evenq = ti == tokens.length - 1 || !evenq;
}
if (sb.length() < length) {
sb.append(" ");
}
sb.append(token);
spans.add(new Span(length, length + token.length()));
length += token.length();
}
try {
line = in.readLine();
} catch (IOException e) {
e.printStackTrace();
line = null;
}
return new TokenSample(sb.toString(),spans.toArray(new Span[spans.size()]));
}
public void remove() {
throw new UnsupportedOperationException();
}
private static void usage() {
System.err.println("TokenSampleStream [-spans] < in");
System.err.println("Where in is a space delimited list of tokens.");
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/AbstractEventStream.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util;
import java.io.IOException;
import java.util.Collections;
import java.util.Iterator;
import opennlp.tools.ml.model.Event;
public abstract class AbstractEventStream<T> implements ObjectStream<Event> {
private ObjectStream<T> samples;
private Iterator<Event> events = Collections.<Event>emptyList().iterator();
/**
* Initializes the current instance with a sample {@link Iterator}.
*
* @param samples the sample {@link Iterator}.
*/
public AbstractEventStream(ObjectStream<T> samples) {
this.samples = samples;
}
/**
* Creates events for the provided sample.
*
* @param sample the sample for which training {@link Event}s
* are be created.
*
* @return an {@link Iterator} of training events or
* an empty {@link Iterator}.
*/
protected abstract Iterator<Event> createEvents(T sample);
@Override
public final Event read() throws IOException {
if (events.hasNext()) {
return events.next();
}
else {
T sample;
while (!events.hasNext() && (sample = samples.read()) != null) {
events = createEvents(sample);
}
if (events.hasNext()) {
return read();
}
}
return null;
}
@Override
public void reset() throws IOException, UnsupportedOperationException {
events = Collections.emptyIterator();
samples.reset();
}
@Override
public void close() throws IOException {
samples.close();
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/AbstractObjectStream.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util;
import java.io.IOException;
public class AbstractObjectStream<T> implements ObjectStream<T> {
private final ObjectStream<T> stream;
protected AbstractObjectStream(ObjectStream<T> stream) {
this.stream = stream;
}
@Override
public T read() throws IOException {
return stream.read();
}
@Override
public void reset() throws IOException, UnsupportedOperationException {
stream.reset();
}
@Override
public void close() throws IOException {
stream.close();
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/BaseToolFactory.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util;
import java.util.HashMap;
import java.util.Map;
import opennlp.tools.util.ext.ExtensionLoader;
import opennlp.tools.util.model.ArtifactProvider;
import opennlp.tools.util.model.ArtifactSerializer;
/**
* Base class for all tool factories.
*
* Extensions of this class should:
* <ul>
* <li>implement an empty constructor (TODO is it necessary?)
* <li>implement a constructor that takes the {@link ArtifactProvider} and
* calls {@code BaseToolFactory(Map)}
* <li>override {@link #createArtifactMap()} and
* {@link #createArtifactSerializersMap()} methods if necessary.
* </ul>
*/
public abstract class BaseToolFactory {
protected ArtifactProvider artifactProvider;
/**
* All sub-classes should have an empty constructor
*/
public BaseToolFactory() {
}
/**
* Initializes the ToolFactory with an artifact provider.
*/
protected void init(ArtifactProvider artifactProvider) {
this.artifactProvider = artifactProvider;
}
/**
* Creates a {@link Map} with pairs of keys and {@link ArtifactSerializer}.
* The models implementation should call this method from
* {@code BaseModel#createArtifactSerializersMap}
* <p>
* The base implementation will return a {@link HashMap} that should be
* populated by sub-classes.
*/
@SuppressWarnings("rawtypes")
public Map<String, ArtifactSerializer> createArtifactSerializersMap() {
return new HashMap<>();
}
/**
* Creates a {@link Map} with pairs of keys and objects. The models
* implementation should call this constructor that creates a model
* programmatically.
* <p>
* The base implementation will return a {@link HashMap} that should be
* populated by sub-classes.
*/
public Map<String, Object> createArtifactMap() {
return new HashMap<>();
}
/**
* Creates the manifest entries that will be added to the model manifest
*
* @return the manifest entries to added to the model manifest
*/
public Map<String, String> createManifestEntries() {
return new HashMap<>();
}
/**
* Validates the parsed artifacts. If something is not
* valid subclasses should throw an {@link InvalidFormatException}.
*
* Note:
* Subclasses should generally invoke super.validateArtifactMap at the beginning
* of this method.
*
* @throws InvalidFormatException
*/
public abstract void validateArtifactMap() throws InvalidFormatException;
public static BaseToolFactory create(String subclassName,
ArtifactProvider artifactProvider) throws InvalidFormatException {
BaseToolFactory theFactory;
try {
// load the ToolFactory using the default constructor
theFactory = ExtensionLoader.instantiateExtension(BaseToolFactory.class, subclassName);
if (theFactory != null) {
theFactory.init(artifactProvider);
}
} catch (Exception e) {
String msg = "Could not instantiate the " + subclassName
+ ". The initialization throw an exception.";
throw new InvalidFormatException(msg, e);
}
return theFactory;
}
public static BaseToolFactory create(Class<? extends BaseToolFactory> factoryClass,
ArtifactProvider artifactProvider) throws InvalidFormatException {
BaseToolFactory theFactory = null;
if (factoryClass != null) {
try {
theFactory = factoryClass.newInstance();
theFactory.init(artifactProvider);
} catch (Exception e) {
String msg = "Could not instantiate the "
+ factoryClass.getCanonicalName()
+ ". The initialization throw an exception.";
throw new InvalidFormatException(msg, e);
}
}
return theFactory;
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/BeamSearchContextGenerator.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util;
/**
* Interface for context generators used with a sequence beam search.
*/
public interface BeamSearchContextGenerator<T> {
/** Returns the context for the specified position in the specified sequence (list).
* @param index The index of the sequence.
* @param sequence The sequence of items over which the beam search is performed.
* @param priorDecisions The sequence of decisions made prior to the context for
* which this decision is being made.
* @param additionalContext Any addition context specific to a class implementing this interface.
* @return the context for the specified position in the specified sequence.
*/
String[] getContext(int index, T[] sequence, String[] priorDecisions, Object[] additionalContext);
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/Cache.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util;
import java.util.LinkedHashMap;
import java.util.Map;
/**
* Provides fixed size, pre-allocated, least recently used replacement cache.
*/
public class Cache<K,V> extends LinkedHashMap<K,V> {
private int capacity;
public Cache(final int capacity) {
this.capacity = capacity;
}
@Override
protected boolean removeEldestEntry(Map.Entry<K,V> eldest) {
return this.size() > this.capacity;
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/CollectionObjectStream.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util;
import java.util.Collection;
import java.util.Iterator;
public class CollectionObjectStream<E> implements ObjectStream<E> {
private Collection<E> collection;
private Iterator<E> iterator;
public CollectionObjectStream(Collection<E> collection) {
this.collection = collection;
reset();
}
public E read() {
return iterator.hasNext() ? iterator.next() : null;
}
public void reset() {
this.iterator = collection.iterator();
}
public void close() {
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/EventTraceStream.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util;
import java.io.IOException;
import java.io.Writer;
import opennlp.tools.ml.model.Event;
public class EventTraceStream extends FilterObjectStream<Event, Event> {
private Writer writer;
public EventTraceStream(ObjectStream<Event> stream, Writer writer) {
super(stream);
this.writer = writer;
}
public Event read() throws IOException {
Event event = samples.read();
if (event != null) {
writer.write(event.toString());
writer.write("\n");
}
return event;
}
public void remove() {
// TODO: not supported, should be removed ...
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/FilterObjectStream.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util;
import java.io.IOException;
import java.util.Objects;
/**
* Abstract base class for filtering {@link ObjectStream}s.
* <p>
* Filtering streams take an existing stream and convert
* its output to something else.
*
* @param <S> the type of the source/input stream
* @param <T> the type of this stream
*/
public abstract class FilterObjectStream<S, T> implements ObjectStream<T> {
protected final ObjectStream<S> samples;
protected FilterObjectStream(ObjectStream<S> samples) {
this.samples = Objects.requireNonNull(samples, "samples must not be null!");
}
@Override
public void reset() throws IOException, UnsupportedOperationException {
samples.reset();
}
@Override
public void close() throws IOException {
samples.close();
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/InputStreamFactory.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util;
import java.io.IOException;
import java.io.InputStream;
/**
* Allows repeated reads through a stream for certain types of model building.
* Use {@code MockInputStreamFactory} MockInputStreamFactory for default
* behavior.
*
*/
public interface InputStreamFactory {
InputStream createInputStream() throws IOException;
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/InsufficientTrainingDataException.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util;
import java.io.IOException;
/**
* This exception indicates that the provided training data is
* insufficient to train the desired model.
*/
@SuppressWarnings("serial")
public class InsufficientTrainingDataException extends IOException {
public InsufficientTrainingDataException() {
}
public InsufficientTrainingDataException(String message) {
super(message);
}
public InsufficientTrainingDataException(Throwable t) {
super();
initCause(t);
}
public InsufficientTrainingDataException(String message, Throwable t) {
super(message);
initCause(t);
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/InvalidFormatException.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util;
import java.io.IOException;
/**
* This exception indicates that a resource violates the expected data format.
*/
@SuppressWarnings("serial")
public class InvalidFormatException extends IOException {
public InvalidFormatException() {
}
public InvalidFormatException(String message) {
super(message);
}
public InvalidFormatException(Throwable t) {
super();
initCause(t);
}
public InvalidFormatException(String message, Throwable t) {
super(message);
initCause(t);
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/MarkableFileInputStream.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStream;
/**
* A markable File Input Stream.
*/
class MarkableFileInputStream extends InputStream {
private FileInputStream in;
private long markedPosition = -1;
private IOException markException;
MarkableFileInputStream(File file) throws FileNotFoundException {
in = new FileInputStream(file);
}
@Override
public synchronized void mark(int readlimit) {
try {
markedPosition = in.getChannel().position();
} catch (IOException e) {
markedPosition = -1;
}
}
@Override
public boolean markSupported() {
return true;
}
private void throwMarkExceptionIfOccured() throws IOException {
if (markException != null) {
throw markException;
}
}
@Override
public synchronized void reset() throws IOException {
throwMarkExceptionIfOccured();
if (markedPosition >= 0) {
in.getChannel().position(markedPosition);
}
else {
throw new IOException("Stream has to be marked before it can be reset!");
}
}
@Override
public int read() throws IOException {
return in.read();
}
@Override
public int read(byte[] b) throws IOException {
return in.read(b);
}
@Override
public int read(byte[] b, int off, int len) throws IOException {
return in.read(b, off, len);
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/MarkableFileInputStreamFactory.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStream;
/**
* A factory that creates {@link MarkableFileInputStream} from a {@link File}
*/
public class MarkableFileInputStreamFactory implements InputStreamFactory {
private File file;
public MarkableFileInputStreamFactory(File file) throws FileNotFoundException {
if (!file.exists()) {
throw new FileNotFoundException("File '" + file + "' cannot be found");
}
this.file = file;
}
@Override
public InputStream createInputStream() throws IOException {
return new MarkableFileInputStream(file);
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/ObjectStream.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util;
import java.io.IOException;
import java.io.ObjectStreamException;
/**
* Reads <code>Object</code>s from a stream.
* <p>
* Design Decision:<br>
* This interface provides a means for iterating over the
* objects in a stream, it does not implement {@link java.util.Iterator} or
* {@link Iterable} because:
* <ul>
* <li>{@link java.util.Iterator#next()} and
* {@link java.util.Iterator#hasNext()} are declared as throwing no checked
* exceptions. Thus the {@link IOException}s thrown by {@link #read()} would
* have to be wrapped in {@link RuntimeException}s, and the compiler would be
* unable to force users of this code to catch such exceptions.</li>
* <li>Implementing {@link Iterable} would mean either silently calling
* {@link #reset()} to guarantee that all items were always seen on each
* iteration, or documenting that the Iterable only iterates over the remaining
* elements of the ObjectStream. In either case, users not reading the
* documentation carefully might run into unexpected behavior.</li>
* </ul>
*
* @see ObjectStreamException
*/
public interface ObjectStream<T> extends AutoCloseable {
/**
* Returns the next object. Calling this method repeatedly until it returns
* null will return each object from the underlying source exactly once.
*
* @return the next object or null to signal that the stream is exhausted
*
* @throws IOException if there is an error during reading
*/
T read() throws IOException;
/**
* Repositions the stream at the beginning and the previously seen object sequence
* will be repeated exactly. This method can be used to re-read
* the stream if multiple passes over the objects are required.
*
* The implementation of this method is optional.
*
* @throws IOException if there is an error during reseting the stream
*/
default void reset() throws IOException, UnsupportedOperationException {
throw new UnsupportedOperationException("reset is not supported on this stream");
}
/**
* Closes the <code>ObjectStream</code> and releases all allocated
* resources. After close was called its not allowed to call
* read or reset.
*
* @throws IOException if there is an error during closing the stream
*/
default void close() throws IOException {}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/ObjectStreamUtils.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util;
import java.io.IOException;
import java.util.Collection;
import java.util.Iterator;
public class ObjectStreamUtils {
/**
* Creates an {@link ObjectStream} form an array.
*
* @param <T>
* @param array
*
* @return the object stream over the array elements
*/
@SafeVarargs
public static <T> ObjectStream<T> createObjectStream(final T... array) {
return new ObjectStream<T>() {
private int index = 0;
public T read() {
if (index < array.length)
return array[index++];
else
return null;
}
public void reset() {
index = 0;
}
public void close() {
}
};
}
/**
* Creates an {@link ObjectStream} form a collection.
*
* @param <T>
* @param collection
*
* @return the object stream over the collection elements
*/
public static <T> ObjectStream<T> createObjectStream(final Collection<T> collection) {
return new ObjectStream<T>() {
private Iterator<T> iterator = collection.iterator();
public T read() {
if (iterator.hasNext())
return iterator.next();
else
return null;
}
public void reset() {
iterator = collection.iterator();
}
public void close() {
}
};
}
/**
* Creates a single concatenated ObjectStream from multiple individual
* ObjectStreams with the same type.
*
* @param streams
* @return
*/
public static <T> ObjectStream<T> concatenateObjectStream(final Collection<ObjectStream<T>> streams) {
// We may want to skip null streams instead of throwing a
for (ObjectStream<T> stream : streams) {
if (stream == null) {
throw new NullPointerException("stream cannot be null");
}
}
return new ObjectStream<T>() {
private Iterator<ObjectStream<T>> iterator = streams.iterator();
private ObjectStream<T> currentStream = iterator.next();
@Override
public T read() throws IOException {
T object = null;
while (currentStream != null && object == null) {
object = currentStream.read();
if (object == null) {
currentStream = (iterator.hasNext()) ? iterator.next() : null;
}
}
return object;
}
@Override
public void reset() throws IOException, UnsupportedOperationException {
for (ObjectStream<T> stream : streams) {
stream.reset();
}
iterator = streams.iterator();
}
@Override
public void close() throws IOException {
for (ObjectStream<T> stream : streams) {
stream.close();
}
}
};
}
/**
* Creates a single concatenated ObjectStream from multiple individual
* ObjectStreams with the same type.
*
* @param streams
* @return
*/
@SafeVarargs
public static <T> ObjectStream<T> concatenateObjectStream(final ObjectStream<T>... streams) {
for (ObjectStream<T> stream : streams) {
if (stream == null) {
throw new NullPointerException("stream cannot be null");
}
}
return new ObjectStream<T>() {
private int streamIndex = 0;
public T read() throws IOException {
T object = null;
while (streamIndex < streams.length && object == null) {
object = streams[streamIndex].read();
if (object == null)
streamIndex++;
}
return object;
}
public void reset() throws IOException, UnsupportedOperationException {
streamIndex = 0;
for (ObjectStream<T> stream : streams) {
stream.reset();
}
}
public void close() throws IOException {
for (ObjectStream<T> stream : streams) {
stream.close();
}
}
};
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/ParagraphStream.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util;
import java.io.IOException;
/**
* Stream filter which merges text lines into paragraphs. The boundary of paragraph is defined
* by an empty text line. If the last paragraph in the stream is not terminated by an empty line
* the left over is assumed to be a paragraph.
*/
public class ParagraphStream extends FilterObjectStream<String, String> {
public ParagraphStream(ObjectStream<String> lineStream) {
super(lineStream);
}
public String read() throws IOException {
StringBuilder paragraph = new StringBuilder();
while (true) {
String line = samples.read();
// The last paragraph in the input might not
// be terminated well with a new line at the end.
if (line == null || line.equals("")) {
if (paragraph.length() > 0) {
return paragraph.toString();
}
}
else {
paragraph.append(line).append('\n');
}
if (line == null)
return null;
}
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/PlainTextByLineStream.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.nio.charset.Charset;
import java.util.Objects;
/**
* Reads a plain text file and return each line as a <code>String</code> object.
*/
public class PlainTextByLineStream implements ObjectStream<String> {
private final Charset encoding;
private InputStreamFactory inputStreamFactory;
private BufferedReader in;
public PlainTextByLineStream(InputStreamFactory inputStreamFactory,
String charsetName) throws IOException {
this(inputStreamFactory, Charset.forName(charsetName));
}
public PlainTextByLineStream(InputStreamFactory inputStreamFactory,
Charset charset) throws IOException {
this.inputStreamFactory =
Objects.requireNonNull(inputStreamFactory, "inputStreamFactory must not be null!");
this.encoding = charset;
reset();
}
public String read() throws IOException {
return in.readLine();
}
public void reset() throws IOException {
in = new BufferedReader(new InputStreamReader(inputStreamFactory.createInputStream(),
encoding));
}
public void close() throws IOException {
if (in != null) {
in.close();
}
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/ResetableIterator.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util;
import java.util.Iterator;
/**
* This interface makes an {@link Iterator} resetable.
*/
public interface ResetableIterator<E> extends Iterator<E> {
/**
* Sets the {@link Iterator} back to the first retrieved element,
* the seen sequence of elements must be repeated.
*/
void reset();
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/ReverseListIterator.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util;
import java.util.Iterator;
import java.util.List;
/**
* An iterator for a list which returns values in the opposite order as the typical list iterator.
*/
public class ReverseListIterator<T> implements Iterator<T> {
private int index;
private List<T> list;
public ReverseListIterator(List<T> list) {
index = list.size() - 1;
this.list = list;
}
public T next() {
return list.get(index--);
}
public boolean hasNext() {
return index >= 0;
}
public void remove() {
throw new UnsupportedOperationException();
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/Sequence.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Objects;
/** Represents a weighted sequence of outcomes. */
public class Sequence implements Comparable<Sequence> {
private double score;
private List<String> outcomes;
private List<Double> probs;
private static final Double ONE = 1.0d;
/** Creates a new sequence of outcomes. */
public Sequence() {
outcomes = new ArrayList<>(1);
probs = new ArrayList<>(1);
score = 0d;
}
public Sequence(Sequence s) {
outcomes = new ArrayList<>(s.outcomes.size() + 1);
outcomes.addAll(s.outcomes);
probs = new ArrayList<>(s.probs.size() + 1);
probs.addAll(s.probs);
score = s.score;
}
public Sequence(Sequence s,String outcome, double p) {
outcomes = new ArrayList<>(s.outcomes.size() + 1);
outcomes.addAll(s.outcomes);
outcomes.add(outcome);
probs = new ArrayList<>(s.probs.size() + 1);
probs.addAll(s.probs);
probs.add(p);
score = s.score + Math.log(p);
}
public Sequence(List<String> outcomes) {
this.outcomes = outcomes;
this.probs = Collections.nCopies(outcomes.size(),ONE);
}
public int compareTo(Sequence s) {
return Double.compare(s.score, score);
}
@Override
public int hashCode() {
return Objects.hash(outcomes, probs, score);
}
@Override
public boolean equals(Object obj) {
if (this == obj)
return true;
if (obj instanceof Sequence) {
Sequence other = (Sequence) obj;
double epsilon = 0.0000001;
return Objects.equals(outcomes, other.outcomes) &&
Objects.equals(probs, other.probs) &&
Math.abs(score - other.score) < epsilon;
}
return false;
}
/** Adds an outcome and probability to this sequence.
* @param outcome the outcome to be added.
* @param p the probability associated with this outcome.
*/
public void add(String outcome, double p) {
outcomes.add(outcome);
probs.add(p);
score += Math.log(p);
}
/** Returns a list of outcomes for this sequence.
* @return a list of outcomes.
*/
public List<String> getOutcomes() {
return outcomes;
}
/** Returns an array of probabilities associated with the outcomes of this sequence.
* @return an array of probabilities.
*/
public double[] getProbs() {
double[] ps = new double[probs.size()];
getProbs(ps);
return ps;
}
/**
* Returns the score of this sequence.
* @return The score of this sequence.
*/
public double getScore() {
return score;
}
/** Populates an array with the probabilities associated with the outcomes of this sequence.
* @param ps a pre-allocated array to use to hold the values of the
* probabilities of the outcomes for this sequence.
*/
public void getProbs(double[] ps) {
for (int pi = 0, pl = probs.size(); pi < pl; pi++) {
ps[pi] = probs.get(pi);
}
}
@Override
public String toString() {
return score + " " + outcomes;
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/SequenceCodec.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util;
import java.util.List;
public interface SequenceCodec<T> {
/**
* Decodes a sequence T objects into Span objects.
*
* @param c
*
* @return
*/
Span[] decode(List<T> c);
/**
* Encodes Span objects into a sequence of T objects.
*
* @param names
* @param length
*
* @return
*/
T[] encode(Span[] names, int length);
/**
* Creates a sequence validator which can validate a sequence of outcomes.
*
* @return
*/
SequenceValidator<T> createSequenceValidator();
/**
* Checks if the outcomes of the model are compatible with the codec.
*
* @param outcomes all possible model outcomes
*
* @return
*/
boolean areOutcomesCompatible(String[] outcomes);
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/SequenceValidator.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util;
public interface SequenceValidator<T> {
/**
* Determines whether a particular continuation of a sequence is valid.
* This is used to restrict invalid sequences such as those used in start/continue tag-based chunking
* or could be used to implement tag dictionary restrictions.
*
* @param i The index in the input sequence for which the new outcome is being proposed.
* @param inputSequence The input sequence.
* @param outcomesSequence The outcomes so far in this sequence.
* @param outcome The next proposed outcome for the outcomes sequence.
*
* @return true is the sequence would still be valid with the new outcome, false otherwise.
*/
boolean validSequence(int i, T[] inputSequence, String[] outcomesSequence,
String outcome);
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/Span.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util;
import java.io.Serializable;
import java.util.Objects;
/**
* Class for storing start and end integer offsets.
*
*/
public class Span implements Comparable<Span>, Serializable {
private final int start;
private final int end;
private final double prob;//default is 0
private final String type;
/**
* Initializes a new Span Object. Sets the prob to 0 as default.
*
* @param s start of span.
* @param e end of span, which is +1 more than the last element in the span.
* @param type the type of the span
*/
public Span(int s, int e, String type) {
this(s, e, type, 0d);
}
/**
* Initializes a new Span Object.
*
* @param s start of span.
* @param e end of span, which is +1 more than the last element in the span.
* @param type the type of the span
* @param prob probability of span.
*/
public Span(int s, int e, String type, double prob) {
if (s < 0) {
throw new IllegalArgumentException("start index must be zero or greater: " + s);
}
if (e < 0) {
throw new IllegalArgumentException("end index must be zero or greater: " + e);
}
if (s > e) {
throw new IllegalArgumentException("start index must not be larger than end index: "
+ "start=" + s + ", end=" + e);
}
start = s;
end = e;
this.prob = prob;
this.type = type;
}
/**
* Initializes a new Span Object. Sets the prob to 0 as default
*
* @param s start of span.
* @param e end of span.
*/
public Span(int s, int e) {
this(s, e, null, 0d);
}
/**
*
* @param s the start of the span (the token index, not the char index)
* @param e the end of the span (the token index, not the char index)
* @param prob
*/
public Span(int s, int e, double prob) {
this(s, e, null, prob);
}
/**
* Initializes a new Span object with an existing Span which is shifted by an
* offset.
*
* @param span
* @param offset
*/
public Span(Span span, int offset) {
this(span.start + offset, span.end + offset, span.getType(), span.getProb());
}
/**
* Creates a new immutable span based on an existing span, where the existing span did not include the prob
* @param span the span that has no prob or the prob is incorrect and a new Span must be generated
* @param prob the probability of the span
*/
public Span(Span span, double prob) {
this(span.start, span.end, span.getType(), prob);
}
/**
* Return the start of a span.
*
* @return the start of a span.
*
*/
public int getStart() {
return start;
}
/**
* Return the end of a span.
*
* Note: that the returned index is one past the actual end of the span in the
* text, or the first element past the end of the span.
*
* @return the end of a span.
*
*/
public int getEnd() {
return end;
}
/**
* Retrieves the type of the span.
*
* @return the type or null if not set
*/
public String getType() {
return type;
}
/**
* Returns the length of this span.
*
* @return the length of the span.
*/
public int length() {
return end - start;
}
/**
* Returns true if the specified span is contained by this span. Identical
* spans are considered to contain each other.
*
* @param s The span to compare with this span.
*
* @return true is the specified span is contained by this span; false otherwise.
*/
public boolean contains(Span s) {
return start <= s.getStart() && s.getEnd() <= end;
}
/**
* Returns true if the specified index is contained inside this span. An index
* with the value of end is considered outside the span.
*
* @param index the index to test with this span.
*
* @return true if the span contains this specified index; false otherwise.
*/
public boolean contains(int index) {
return start <= index && index < end;
}
/**
* Returns true if the specified span is the begin of this span and the
* specified span is contained in this span.
*
* @param s The span to compare with this span.
*
* @return true if the specified span starts with this span and is contained
* in this span; false otherwise
*/
public boolean startsWith(Span s) {
return getStart() == s.getStart() && contains(s);
}
/**
* Returns true if the specified span intersects with this span.
*
* @param s The span to compare with this span.
*
* @return true is the spans overlap; false otherwise.
*/
public boolean intersects(Span s) {
int sstart = s.getStart();
//either s's start is in this or this' start is in s
return this.contains(s) || s.contains(this)
|| getStart() <= sstart && sstart < getEnd()
|| sstart <= getStart() && getStart() < s.getEnd();
}
/**
* Returns true is the specified span crosses this span.
*
* @param s The span to compare with this span.
*
* @return true is the specified span overlaps this span and contains a
* non-overlapping section; false otherwise.
*/
public boolean crosses(Span s) {
int sstart = s.getStart();
//either s's start is in this or this' start is in s
return !this.contains(s) && !s.contains(this)
&& (getStart() <= sstart && sstart < getEnd()
|| sstart <= getStart() && getStart() < s.getEnd());
}
/**
* Retrieves the string covered by the current span of the specified text.
*
* @param text
*
* @return the substring covered by the current span
*/
public CharSequence getCoveredText(CharSequence text) {
if (getEnd() > text.length()) {
throw new IllegalArgumentException("The span " + toString()
+ " is outside the given text which has length " + text.length() + "!");
}
return text.subSequence(getStart(), getEnd());
}
/**
* Return a copy of this span with leading and trailing white spaces removed.
*
* @param text
*
* @return the trimmed span or the same object if already trimmed
*/
public Span trim(CharSequence text) {
int newStartOffset = getStart();
for (int i = getStart(); i < getEnd() && StringUtil.isWhitespace(text.charAt(i)); i++) {
newStartOffset++;
}
int newEndOffset = getEnd();
for (int i = getEnd(); i > getStart() && StringUtil.isWhitespace(text.charAt(i - 1)); i--) {
newEndOffset--;
}
if (newStartOffset == getStart() && newEndOffset == getEnd()) {
return this;
} else if (newStartOffset > newEndOffset) {
return new Span(getStart(), getStart(), getType());
} else {
return new Span(newStartOffset, newEndOffset, getType());
}
}
/**
* Compares the specified span to the current span.
*/
public int compareTo(Span s) {
if (getStart() < s.getStart()) {
return -1;
} else if (getStart() == s.getStart()) {
if (getEnd() > s.getEnd()) {
return -1;
} else if (getEnd() < s.getEnd()) {
return 1;
} else {
// compare the type
if (getType() == null && s.getType() == null) {
return 0;
} else if (getType() != null && s.getType() != null) {
// use type lexicography order
return getType().compareTo(s.getType());
} else if (getType() != null) {
return -1;
}
return 1;
}
} else {
return 1;
}
}
/**
* Generates a hash code of the current span.
*/
@Override
public int hashCode() {
return Objects.hash(getStart(), getEnd(), getType());
}
/**
* Checks if the specified span is equal to the current span.
*/
@Override
public boolean equals(Object o) {
if (o == this) {
return true;
}
if (o instanceof Span) {
Span s = (Span) o;
return getStart() == s.getStart() && getEnd() == s.getEnd()
&& Objects.equals(getType(), s.getType());
}
return false;
}
/**
* Generates a human readable string.
*/
@Override
public String toString() {
StringBuilder toStringBuffer = new StringBuilder(15);
toStringBuffer.append("[");
toStringBuffer.append(getStart());
toStringBuffer.append("..");
toStringBuffer.append(getEnd());
toStringBuffer.append(")");
if (getType() != null) {
toStringBuffer.append(" ");
toStringBuffer.append(getType());
}
return toStringBuffer.toString();
}
/**
* Converts an array of {@link Span}s to an array of {@link String}s.
*
* @param spans
* @param s
* @return the strings
*/
public static String[] spansToStrings(Span[] spans, CharSequence s) {
String[] tokens = new String[spans.length];
for (int si = 0, sl = spans.length; si < sl; si++) {
tokens[si] = spans[si].getCoveredText(s).toString();
}
return tokens;
}
public static String[] spansToStrings(Span[] spans, String[] tokens) {
String[] chunks = new String[spans.length];
StringBuilder cb = new StringBuilder();
for (int si = 0, sl = spans.length; si < sl; si++) {
cb.setLength(0);
for (int ti = spans[si].getStart(); ti < spans[si].getEnd(); ti++) {
cb.append(tokens[ti]).append(" ");
}
chunks[si] = cb.substring(0, cb.length() - 1);
}
return chunks;
}
public double getProb() {
return prob;
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/StringList.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util;
import java.util.Arrays;
import java.util.Iterator;
import java.util.NoSuchElementException;
import java.util.Objects;
/**
* The {@link StringList} is an immutable list of {@link String}s.
*/
public class StringList implements Iterable<String> {
private String[] tokens;
/**
* Initializes the current instance.
*
* Note: <br>
* Token String will be replaced by identical internal String object.
*
* @param singleToken one single token
*/
public StringList(String singleToken) {
tokens = new String[]{singleToken.intern()};
}
/**
* Initializes the current instance.
*
* Note: <br>
* Token Strings will be replaced by identical internal String object.
*
* @param tokens the string parts of the new {@link StringList}, an empty
* tokens array or null is not permitted.
*/
public StringList(String... tokens) {
Objects.requireNonNull(tokens, "tokens must not be null");
if (tokens.length == 0) {
throw new IllegalArgumentException("tokens must not be empty");
}
this.tokens = new String[tokens.length];
for (int i = 0; i < tokens.length; i++) {
this.tokens[i] = tokens[i].intern();
}
}
/**
* Retrieves a token from the given index.
*
* @param index
*
* @return token at the given index
*/
public String getToken(int index) {
return tokens[index];
}
/**
* Retrieves the number of tokens inside this list.
*
* @return number of tokens
*/
public int size() {
return tokens.length;
}
/**
* Retrieves an {@link Iterator} over all tokens.
*
* @return iterator over tokens
*/
public Iterator<String> iterator() {
return new Iterator<String>() {
private int index;
public boolean hasNext() {
return index < size();
}
public String next() {
if (hasNext()) {
return getToken(index++);
}
else {
throw new NoSuchElementException();
}
}
public void remove() {
throw new UnsupportedOperationException();
}
};
}
/**
* Compares to tokens list and ignores the case of the tokens.
*
* Note: This can cause problems with some locals.
*
* @param tokens
*
* @return true if identically with ignore the case otherwise false
*/
public boolean compareToIgnoreCase(StringList tokens) {
if (size() == tokens.size()) {
for (int i = 0; i < size(); i++) {
if (getToken(i).compareToIgnoreCase(
tokens.getToken(i)) != 0) {
return false;
}
}
}
else {
return false;
}
return true;
}
@Override
public int hashCode() {
return Arrays.hashCode(tokens);
}
@Override
public boolean equals(Object obj) {
if (this == obj) {
return true;
}
if (obj instanceof StringList) {
StringList tokenList = (StringList) obj;
return Arrays.equals(tokens, tokenList.tokens);
}
return false;
}
@Override
public String toString() {
StringBuilder string = new StringBuilder();
string.append('[');
for (int i = 0; i < size(); i++) {
string.append(getToken(i));
if (i < size() - 1) {
string.append(',');
}
}
string.append(']');
return string.toString();
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/StringUtil.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util;
public class StringUtil {
/**
* Determines if the specified character is a whitespace.
*
* A character is considered a whitespace when one
* of the following conditions is meet:
*
* <ul>
* <li>Its a {@link Character#isWhitespace(int)} whitespace.</li>
* <li>Its a part of the Unicode Zs category ({@link Character#SPACE_SEPARATOR}).</li>
* </ul>
*
* <code>Character.isWhitespace(int)</code> does not include no-break spaces.
* In OpenNLP no-break spaces are also considered as white spaces.
*
* @param charCode
* @return true if white space otherwise false
*/
public static boolean isWhitespace(char charCode) {
return Character.isWhitespace(charCode) ||
Character.getType(charCode) == Character.SPACE_SEPARATOR;
}
/**
* Determines if the specified character is a whitespace.
*
* A character is considered a whitespace when one
* of the following conditions is meet:
*
* <ul>
* <li>Its a {@link Character#isWhitespace(int)} whitespace.</li>
* <li>Its a part of the Unicode Zs category ({@link Character#SPACE_SEPARATOR}).</li>
* </ul>
*
* <code>Character.isWhitespace(int)</code> does not include no-break spaces.
* In OpenNLP no-break spaces are also considered as white spaces.
*
* @param charCode
* @return true if white space otherwise false
*/
public static boolean isWhitespace(int charCode) {
return Character.isWhitespace(charCode) ||
Character.getType(charCode) == Character.SPACE_SEPARATOR;
}
/**
* Converts to lower case independent of the current locale via
* {@link Character#toLowerCase(char)} which uses mapping information
* from the UnicodeData file.
*
* @param string
* @return lower cased String
*/
public static String toLowerCase(CharSequence string) {
char[] lowerCaseChars = new char[string.length()];
for (int i = 0; i < string.length(); i++) {
lowerCaseChars[i] = Character.toLowerCase(string.charAt(i));
}
return new String(lowerCaseChars);
}
/**
* Converts to upper case independent of the current locale via
* {@link Character#toUpperCase(char)} which uses mapping information
* from the UnicodeData file.
*
* @param string
* @return upper cased String
*/
public static String toUpperCase(CharSequence string) {
char[] upperCaseChars = new char[string.length()];
for (int i = 0; i < string.length(); i++) {
upperCaseChars[i] = Character.toUpperCase(string.charAt(i));
}
return new String(upperCaseChars);
}
/**
* Returns <tt>true</tt> if {@link CharSequence#length()} is
* <tt>0</tt> or <tt>null</tt>.
*
* @return <tt>true</tt> if {@link CharSequence#length()} is <tt>0</tt>, otherwise
* <tt>false</tt>
*
* @since 1.5.1
*/
public static boolean isEmpty(CharSequence theString) {
return theString.length() == 0;
}
/**
* Get mininum of three values.
* @param a number a
* @param b number b
* @param c number c
* @return the minimum
*/
private static int minimum(int a, int b, int c) {
int minValue;
minValue = a;
if (b < minValue) {
minValue = b;
}
if (c < minValue) {
minValue = c;
}
return minValue;
}
/**
* Computes the Levenshtein distance of two strings in a matrix.
* Based on pseudo-code provided here:
* https://en.wikipedia.org/wiki/Levenshtein_distance#Computing_Levenshtein_distance
* which in turn is based on the paper Wagner, Robert A.; Fischer, Michael J. (1974),
* "The String-to-String Correction Problem", Journal of the ACM 21 (1): 168-173
* @param wordForm the form
* @param lemma the lemma
* @return the distance
*/
public static int[][] levenshteinDistance(String wordForm, String lemma) {
int wordLength = wordForm.length();
int lemmaLength = lemma.length();
int cost;
int[][] distance = new int[wordLength + 1][lemmaLength + 1];
if (wordLength == 0) {
return distance;
}
if (lemmaLength == 0) {
return distance;
}
//fill in the rows of column 0
for (int i = 0; i <= wordLength; i++) {
distance[i][0] = i;
}
//fill in the columns of row 0
for (int j = 0; j <= lemmaLength; j++) {
distance[0][j] = j;
}
//fill in the rest of the matrix calculating the minimum distance
for (int i = 1; i <= wordLength; i++) {
int s_i = wordForm.charAt(i - 1);
for (int j = 1; j <= lemmaLength; j++) {
if (s_i == lemma.charAt(j - 1)) {
cost = 0;
} else {
cost = 1;
}
//obtain minimum distance from calculating deletion, insertion, substitution
distance[i][j] = minimum(distance[i - 1][j] + 1, distance[i][j - 1]
+ 1, distance[i - 1][j - 1] + cost);
}
}
return distance;
}
/**
* Computes the Shortest Edit Script (SES) to convert a word into its lemma.
* This is based on Chrupala's PhD thesis (2008).
* @param wordForm the token
* @param lemma the target lemma
* @param distance the levenshtein distance
* @param permutations the number of permutations
*/
public static void computeShortestEditScript(String wordForm, String lemma,
int[][] distance, StringBuffer permutations) {
int n = distance.length;
int m = distance[0].length;
int wordFormLength = n - 1;
int lemmaLength = m - 1;
while (true) {
if (distance[wordFormLength][lemmaLength] == 0) {
break;
}
if ((lemmaLength > 0 && wordFormLength > 0) && (distance[wordFormLength - 1][lemmaLength - 1]
< distance[wordFormLength][lemmaLength])) {
permutations.append('R').append(Integer.toString(wordFormLength - 1))
.append(wordForm.charAt(wordFormLength - 1)).append(lemma.charAt(lemmaLength - 1));
lemmaLength--;
wordFormLength--;
continue;
}
if (lemmaLength > 0 && (distance[wordFormLength][lemmaLength - 1]
< distance[wordFormLength][lemmaLength])) {
permutations.append('I').append(Integer.toString(wordFormLength))
.append(lemma.charAt(lemmaLength - 1));
lemmaLength--;
continue;
}
if (wordFormLength > 0 && (distance[wordFormLength - 1][lemmaLength]
< distance[wordFormLength][lemmaLength])) {
permutations.append('D').append(Integer.toString(wordFormLength - 1))
.append(wordForm.charAt(wordFormLength - 1));
wordFormLength--;
continue;
}
if ((wordFormLength > 0 && lemmaLength > 0) && (distance[wordFormLength - 1][lemmaLength - 1]
== distance[wordFormLength][lemmaLength])) {
wordFormLength--;
lemmaLength--;
continue ;
}
if (wordFormLength > 0 && (distance[wordFormLength - 1][lemmaLength]
== distance[wordFormLength][lemmaLength])) {
wordFormLength--;
continue;
}
if (lemmaLength > 0 && (distance[wordFormLength][lemmaLength - 1]
== distance[wordFormLength][lemmaLength])) {
lemmaLength--;
}
}
}
/**
* Read predicted SES by the lemmatizer model and apply the
* permutations to obtain the lemma from the wordForm.
* @param wordForm the wordForm
* @param permutations the permutations predicted by the lemmatizer model
* @return the lemma
*/
public static String decodeShortestEditScript(String wordForm, String permutations) {
StringBuffer lemma = new StringBuffer(wordForm).reverse();
int permIndex = 0;
while (true) {
if (permutations.length() <= permIndex) {
break;
}
//read first letter of permutation string
char nextOperation = permutations.charAt(permIndex);
//System.err.println("-> NextOP: " + nextOperation);
//go to the next permutation letter
permIndex++;
if (nextOperation == 'R') {
String charAtPerm = Character.toString(permutations.charAt(permIndex));
int charIndex = Integer.parseInt(charAtPerm);
// go to the next character in the permutation buffer
// which is the replacement character
permIndex++;
char replace = permutations.charAt(permIndex);
//go to the next char in the permutation buffer
// which is the candidate character
permIndex++;
char with = permutations.charAt(permIndex);
if (lemma.length() <= charIndex) {
return wordForm;
}
if (lemma.charAt(charIndex) == replace) {
lemma.setCharAt(charIndex, with);
}
//System.err.println("-> ROP: " + lemma.toString());
//go to next permutation
permIndex++;
} else if (nextOperation == 'I') {
String charAtPerm = Character.toString(permutations.charAt(permIndex));
int charIndex = Integer.parseInt(charAtPerm);
permIndex++;
//character to be inserted
char in = permutations.charAt(permIndex);
if (lemma.length() < charIndex) {
return wordForm;
}
lemma.insert(charIndex, in);
//System.err.println("-> IOP " + lemma.toString());
//go to next permutation
permIndex++;
} else if (nextOperation == 'D') {
String charAtPerm = Character.toString(permutations.charAt(permIndex));
int charIndex = Integer.parseInt(charAtPerm);
if (lemma.length() <= charIndex) {
return wordForm;
}
lemma.deleteCharAt(charIndex);
permIndex++;
// go to next permutation
permIndex++;
}
}
return lemma.reverse().toString();
}
/**
* Get the SES required to go from a word to a lemma.
* @param wordForm the word
* @param lemma the lemma
* @return the shortest edit script
*/
public static String getShortestEditScript(String wordForm, String lemma) {
String reversedWF = new StringBuffer(wordForm.toLowerCase()).reverse().toString();
String reversedLemma = new StringBuffer(lemma.toLowerCase()).reverse().toString();
StringBuffer permutations = new StringBuffer();
String ses;
if (!reversedWF.equals(reversedLemma)) {
int[][]levenDistance = StringUtil.levenshteinDistance(reversedWF, reversedLemma);
StringUtil.computeShortestEditScript(reversedWF, reversedLemma, levenDistance, permutations);
ses = permutations.toString();
} else {
ses = "O";
}
return ses;
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/TokenTag.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util;
import java.util.Arrays;
import java.util.Objects;
public class TokenTag {
private final String token;
private final String tag;
private final String[] addtionalData;
public TokenTag(String token, String tag, String[] addtionalData) {
this.token = token;
this.tag = tag;
if (addtionalData != null) {
this.addtionalData = Arrays.copyOf(addtionalData, addtionalData.length);
} else {
this.addtionalData = null;
}
}
public String getToken() {
return token;
}
public String getTag() {
return tag;
}
public String[] getAddtionalData() {
return addtionalData;
}
public static String[] extractTokens(TokenTag[] tuples) {
String[] tokens = new String[tuples.length];
for (int i = 0; i < tuples.length; i++) {
tokens[i] = tuples[i].getToken();
}
return tokens;
}
public static String[] extractTags(TokenTag[] tuples) {
String[] tags = new String[tuples.length];
for (int i = 0; i < tuples.length; i++) {
tags[i] = tuples[i].getTag();
}
return tags;
}
public static TokenTag[] create(String[] toks, String[] tags) {
TokenTag[] tuples = new TokenTag[toks.length];
for (int i = 0; i < toks.length; i++) {
tuples[i] = new TokenTag(toks[i], tags[i], null);
}
return tuples;
}
@Override
public boolean equals(Object o) {
if (this == o) {
return true;
} else if (o instanceof TokenTag) {
return Objects.equals(this.token, ((TokenTag) o).token)
&& Objects.equals(this.tag, ((TokenTag) o).tag)
&& Arrays.equals(this.addtionalData, ((TokenTag) o).addtionalData);
}
return false;
}
@Override
public int hashCode() {
return Objects.hash(token, tag, addtionalData);
}
@Override
public String toString() {
return token + "_" + tag;
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/TrainingParameters.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.util.Collections;
import java.util.HashMap;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Properties;
import opennlp.tools.ml.EventTrainer;
public class TrainingParameters {
// TODO: are them duplicated?
public static final String ALGORITHM_PARAM = "Algorithm";
public static final String TRAINER_TYPE_PARAM = "TrainerType";
public static final String ITERATIONS_PARAM = "Iterations";
public static final String CUTOFF_PARAM = "Cutoff";
public static final String THREADS_PARAM = "Threads";
private Map<String, Object> parameters = new HashMap<>();
public TrainingParameters() {
}
public TrainingParameters(TrainingParameters trainingParameters) {
this.parameters.putAll(trainingParameters.parameters);
}
/**
*
* @deprecated
*/
public TrainingParameters(Map<String,String> map) {
//parameters.putAll(map);
// try to respect their original type...
for (String key: map.keySet()) {
String value = map.get(key);
try {
int intValue = Integer.parseInt(value);
parameters.put(key, intValue);
}
catch (NumberFormatException ei) {
try {
double doubleValue = Double.parseDouble(value);
parameters.put(key, doubleValue);
}
catch (NumberFormatException ed) {
// Because Boolean.parseBoolean() doesn't throw NFE, it just checks the value is either
// true or yes. So let's see their letters here.
if (value.toLowerCase().equals("true") || value.toLowerCase().equals("false")) {
parameters.put(key, Boolean.parseBoolean(value));
}
else {
parameters.put(key, value);
}
}
}
}
}
/* TODO: Once we throw Map<String,String> away, have this constructor to be uncommented
public TrainingParameters(Map<String,Object> map) {
parameters.putAll(map);
}
*/
public TrainingParameters(InputStream in) throws IOException {
Properties properties = new Properties();
properties.load(in);
for (Map.Entry<Object, Object> entry : properties.entrySet()) {
parameters.put((String) entry.getKey(), entry.getValue());
}
}
/**
* Retrieves the training algorithm name for a given name space.
*
* @return the name or null if not set.
*/
public String algorithm(String namespace) {
return (String)parameters.get(getKey(namespace, ALGORITHM_PARAM));
}
/**
* Retrieves the training algorithm name.
*
* @return the name or null if not set.
*/
public String algorithm() {
return (String)parameters.get(ALGORITHM_PARAM);
}
/**
* Retrieves a map with the training parameters which have the passed name space.
*
* @param namespace
*
* @return a parameter map which can be passed to the train and validate methods.
*
* @deprecated use {@link #getObjectSettings(String)} instead
*/
public Map<String, String> getSettings(String namespace) {
Map<String, String> trainingParams = new HashMap<>();
String prefix = namespace + ".";
for (Map.Entry<String, Object> entry : parameters.entrySet()) {
String key = entry.getKey();
if (namespace != null) {
if (key.startsWith(prefix)) {
trainingParams.put(key.substring(prefix.length()), getStringValue(entry.getValue()));
}
}
else {
if (!key.contains(".")) {
trainingParams.put(key, getStringValue(entry.getValue()));
}
}
}
return Collections.unmodifiableMap(trainingParams);
}
private static String getStringValue(Object value) {
if (value instanceof Integer) {
return Integer.toString((Integer)value);
}
else if (value instanceof Double) {
return Double.toString((Double)value);
}
else if (value instanceof Boolean) {
return Boolean.toString((Boolean)value);
}
else {
return (String)value;
}
}
/**
* Retrieves all parameters without a name space.
*
* @return the settings map
*
* @deprecated use {@link #getObjectSettings()} instead
*/
public Map<String, String> getSettings() {
return getSettings(null);
}
/**
* Retrieves a map with the training parameters which have the passed name space.
*
* @param namespace
*
* @return a parameter map which can be passed to the train and validate methods.
*/
public Map<String, Object> getObjectSettings(String namespace) {
Map<String, Object> trainingParams = new HashMap<>();
String prefix = namespace + ".";
for (Map.Entry<String, Object> entry : parameters.entrySet()) {
String key = entry.getKey();
if (namespace != null) {
if (key.startsWith(prefix)) {
trainingParams.put(key.substring(prefix.length()), entry.getValue());
}
}
else {
if (!key.contains(".")) {
trainingParams.put(key, entry.getValue());
}
}
}
return Collections.unmodifiableMap(trainingParams);
}
/**
* Retrieves all parameters without a name space.
*
* @return the settings map
*/
public Map<String, Object> getObjectSettings() {
return getObjectSettings(null);
}
// reduces the params to contain only the params in the name space
public TrainingParameters getParameters(String namespace) {
TrainingParameters params = new TrainingParameters();
Map<String, Object> settings = getObjectSettings(namespace);
for (Entry<String, Object> entry: settings.entrySet()) {
String key = entry.getKey();
Object value = entry.getValue();;
if (value instanceof Integer) {
params.put(key, (Integer)value);
}
else if (value instanceof Double) {
params.put(key, (Double)value);
}
else if (value instanceof Boolean) {
params.put(key, (Boolean)value);
}
else {
params.put(key, (String)value);
}
}
return params;
}
public void putIfAbsent(String namespace, String key, String value) {
parameters.putIfAbsent(getKey(namespace, key), value);
}
public void putIfAbsent(String key, String value) {
putIfAbsent(null, key, value);
}
public void putIfAbsent(String namespace, String key, int value) {
parameters.putIfAbsent(getKey(namespace, key), value);
}
public void putIfAbsent(String key, int value) {
putIfAbsent(null, key, value);
}
public void putIfAbsent(String namespace, String key, double value) {
parameters.putIfAbsent(getKey(namespace, key), value);
}
public void putIfAbsent(String key, double value) {
putIfAbsent(null, key, value);
}
public void putIfAbsent(String namespace, String key, boolean value) {
parameters.putIfAbsent(getKey(namespace, key), value);
}
public void putIfAbsent(String key, boolean value) {
putIfAbsent(null, key, value);
}
public void put(String namespace, String key, String value) {
parameters.put(getKey(namespace, key), value);
}
public void put(String key, String value) {
put(null, key, value);
}
public void put(String namespace, String key, int value) {
parameters.put(getKey(namespace, key), value);
}
public void put(String key, int value) {
put(null, key, value);
}
public void put(String namespace, String key, double value) {
parameters.put(getKey(namespace, key), value);
}
public void put(String key, double value) {
put(null, key, value);
}
public void put(String namespace, String key, boolean value) {
parameters.put(getKey(namespace, key), value);
}
public void put(String key, boolean value) {
put(null, key, value);
}
public void serialize(OutputStream out) throws IOException {
Properties properties = new Properties();
for (Map.Entry<String, Object> entry: parameters.entrySet()) {
properties.put(entry.getKey(), entry.getValue());
}
properties.store(out, null);
}
/**
* get a String parameter
* @param key
* @param defaultValue
* @return
* @throws {@link java.lang.ClassCastException} can be thrown if the value is not {@link String}
*/
public String getStringParameter(String key, String defaultValue) {
return getStringParameter(null, key, defaultValue);
}
/**
* get a String parameter in the specified namespace
* @param namespace
* @param key
* @param defaultValue
* @return
* @throws {@link java.lang.ClassCastException} can be thrown if the value is not {@link String}
*/
public String getStringParameter(String namespace, String key, String defaultValue) {
Object value = parameters.get(getKey(namespace, key));
if (value == null) {
return defaultValue;
}
else {
return (String)value;
}
}
/**
* get an Integer parameter
* @param key
* @param defaultValue
* @return
*/
public int getIntParameter(String key, int defaultValue) {
return getIntParameter(null, key, defaultValue);
}
/**
* get an Integer parameter in the specified namespace
* @param namespace
* @param key
* @param defaultValue
* @return
*/
public int getIntParameter(String namespace, String key, int defaultValue) {
Object value = parameters.get(getKey(namespace, key));
if (value == null) {
return defaultValue;
}
else {
// TODO: We have this try-catch for back-compat reason. After removing deprecated flag,
// we can remove try-catch block and just return (Integer)value;
try {
return (Integer) value;
}
catch (ClassCastException e) {
return Integer.parseInt((String)value);
}
}
}
/**
* get a Double parameter
* @param key
* @param defaultValue
* @return
*/
public double getDoubleParameter(String key, double defaultValue) {
return getDoubleParameter(null, key, defaultValue);
}
/**
* get a Double parameter in the specified namespace
* @param namespace
* @param key
* @param defaultValue
* @return
*/
public double getDoubleParameter(String namespace, String key, double defaultValue) {
Object value = parameters.get(getKey(namespace, key));
if (value == null) {
return defaultValue;
}
else {
// TODO: We have this try-catch for back-compat reason. After removing deprecated flag,
// we can remove try-catch block and just return (Double)value;
try {
return (Double) value;
}
catch (ClassCastException e) {
return Double.parseDouble((String)value);
}
}
}
/**
* get a Boolean parameter
* @param key
* @param defaultValue
* @return
*/
public boolean getBooleanParameter(String key, boolean defaultValue) {
return getBooleanParameter(null, key, defaultValue);
}
/**
* get a Boolean parameter in the specified namespace
* @param namespace
* @param key
* @param defaultValue
* @return
*/
public boolean getBooleanParameter(String namespace, String key, boolean defaultValue) {
Object value = parameters.get(getKey(namespace, key));
if (value == null) {
return defaultValue;
}
else {
// TODO: We have this try-catch for back-compat reason. After removing deprecated flag,
// we can remove try-catch block and just return (Boolean)value;
try {
return (Boolean) value;
}
catch (ClassCastException e) {
return Boolean.parseBoolean((String)value);
}
}
}
public static TrainingParameters defaultParams() {
TrainingParameters mlParams = new TrainingParameters();
mlParams.put(TrainingParameters.ALGORITHM_PARAM, "MAXENT");
mlParams.put(TrainingParameters.TRAINER_TYPE_PARAM, EventTrainer.EVENT_VALUE);
mlParams.put(TrainingParameters.ITERATIONS_PARAM, 100);
mlParams.put(TrainingParameters.CUTOFF_PARAM, 5);
return mlParams;
}
static String getKey(String namespace, String key) {
if (namespace == null) {
return key;
}
else {
return namespace + "." + key;
}
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/Version.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util;
import java.io.IOException;
import java.io.InputStream;
import java.util.Objects;
import java.util.Properties;
/**
* The {@link Version} class represents the OpenNlp Tools library version.
* <p>
* The version has three parts:
* <ul>
* <li>Major: OpenNlp Tools libraries with a different major version are not interchangeable.</li>
* <li>Minor: OpenNlp Tools libraries with an identical major version, but different
* minor version may be interchangeable. See release notes for further details.</li>
* <li>Revision: OpenNlp Tools libraries with same major and minor version, but a different
* revision, are fully interchangeable.</li>
* </ul>
*/
public class Version {
private static final String DEV_VERSION_STRING = "0.0.0-SNAPSHOT";
public static final Version DEV_VERSION = Version.parse(DEV_VERSION_STRING);
private static final String SNAPSHOT_MARKER = "-SNAPSHOT";
private final int major;
private final int minor;
private final int revision;
private final boolean snapshot;
/**
* Initializes the current instance with the provided
* versions.
*
* @param major
* @param minor
* @param revision
* @param snapshot
*/
public Version(int major, int minor, int revision, boolean snapshot) {
this.major = major;
this.minor = minor;
this.revision = revision;
this.snapshot = snapshot;
}
/**
* Initializes the current instance with the provided
* versions. The version will not be a snapshot version.
*
* @param major
* @param minor
* @param revision
*/
public Version(int major, int minor, int revision) {
this(major, minor, revision, false);
}
/**
* Retrieves the major version.
*
* @return major version
*/
public int getMajor() {
return major;
}
/**
* Retrieves the minor version.
*
* @return minor version
*/
public int getMinor() {
return minor;
}
/**
* Retrieves the revision version.
*
* @return revision version
*/
public int getRevision() {
return revision;
}
public boolean isSnapshot() {
return snapshot;
}
/**
* Retrieves the version string.
*
* The {@link #parse(String)} method can create an instance
* of {@link Version} with the returned version value string.
*
* @return the version value string
*/
@Override
public String toString() {
return Integer.toString(getMajor()) + "." + Integer.toString(getMinor()) +
"." + Integer.toString(getRevision()) + (isSnapshot() ? SNAPSHOT_MARKER : "");
}
@Override
public int hashCode() {
return Objects.hash(getMajor(), getMinor(), getRevision(), isSnapshot());
}
@Override
public boolean equals(Object obj) {
if (obj == this) {
return true;
}
if (obj instanceof Version) {
Version version = (Version) obj;
return getMajor() == version.getMajor()
&& getMinor() == version.getMinor()
&& getRevision() == version.getRevision()
&& isSnapshot() == version.isSnapshot();
}
return false;
}
/**
* Return a new {@link Version} initialized to the value
* represented by the specified {@link String}
*
* @param version the string to be parsed
*
* @return the version represented by the string value
*
* @throws NumberFormatException if the string does
* not contain a valid version
*/
public static Version parse(String version) {
int indexFirstDot = version.indexOf('.');
int indexSecondDot = version.indexOf('.', indexFirstDot + 1);
if (indexFirstDot == -1 || indexSecondDot == -1) {
throw new NumberFormatException("Invalid version format '" + version + "', expected two dots!");
}
int indexFirstDash = version.indexOf('-');
int versionEnd;
if (indexFirstDash == -1) {
versionEnd = version.length();
}
else {
versionEnd = indexFirstDash;
}
boolean snapshot = version.endsWith(SNAPSHOT_MARKER);
return new Version(Integer.parseInt(version.substring(0, indexFirstDot)),
Integer.parseInt(version.substring(indexFirstDot + 1, indexSecondDot)),
Integer.parseInt(version.substring(indexSecondDot + 1, versionEnd)), snapshot);
}
/**
* Retrieves the current version of the OpenNlp Tools library.
*
* @return the current version
*/
public static Version currentVersion() {
Properties manifest = new Properties();
// Try to read the version from the version file if it is available,
// otherwise set the version to the development version
try (InputStream versionIn =
Version.class.getResourceAsStream("opennlp.version")) {
if (versionIn != null) {
manifest.load(versionIn);
}
} catch (IOException e) {
// ignore error
}
String versionString = manifest.getProperty("OpenNLP-Version", DEV_VERSION_STRING);
if (versionString.equals("${pom.version}"))
versionString = DEV_VERSION_STRING;
return Version.parse(versionString);
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/XmlUtil.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util;
import javax.xml.XMLConstants;
import javax.xml.parsers.DocumentBuilder;
import javax.xml.parsers.DocumentBuilderFactory;
import javax.xml.parsers.ParserConfigurationException;
import javax.xml.parsers.SAXParser;
import javax.xml.parsers.SAXParserFactory;
import org.xml.sax.SAXException;
public class XmlUtil {
/**
* Create a new DocumentBuilder which processes XML securely.
*
* @return a DocumentBuilder
*/
public static DocumentBuilder createDocumentBuilder() {
try {
DocumentBuilderFactory documentBuilderFactory = DocumentBuilderFactory.newInstance();
documentBuilderFactory.setFeature(XMLConstants.FEATURE_SECURE_PROCESSING, true);
return documentBuilderFactory.newDocumentBuilder();
} catch (ParserConfigurationException e) {
throw new IllegalStateException(e);
}
}
/**
* Create a new SAXParser which processes XML securely.
*
* @return a SAXParser
*/
public static SAXParser createSaxParser() {
SAXParserFactory spf = SAXParserFactory.newInstance();
try {
spf.setFeature(XMLConstants.FEATURE_SECURE_PROCESSING, true);
return spf.newSAXParser();
} catch (ParserConfigurationException | SAXException e) {
throw new IllegalStateException(e);
}
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/package-info.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
/**
* Package containing utility data structures and algorithms used by multiple other packages.
*/
package opennlp.tools.util;
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/eval/CrossValidationPartitioner.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util.eval;
import java.io.IOException;
import java.util.Collection;
import java.util.NoSuchElementException;
import opennlp.tools.util.CollectionObjectStream;
import opennlp.tools.util.ObjectStream;
/**
* Provides access to training and test partitions for n-fold cross validation.
* <p>
* Cross validation is used to evaluate the performance of a classifier when only
* training data is available. The training set is split into n parts
* and the training / evaluation is performed n times on these parts.
* The training partition always consists of n -1 parts and one part is used for testing.
* <p>
* To use the <code>CrossValidationPartioner</code> a client iterates over the n
* <code>TrainingSampleStream</code>s. Each <code>TrainingSampleStream</code> represents
* one partition and is used first for training and afterwards for testing.
* The <code>TestSampleStream</code> can be obtained from the <code>TrainingSampleStream</code>
* with the <code>getTestSampleStream</code> method.
*/
public class CrossValidationPartitioner<E> {
/**
* The <code>TestSampleStream</code> iterates over all test elements.
*
* @param <E>
*/
private static class TestSampleStream<E> implements ObjectStream<E> {
private ObjectStream<E> sampleStream;
private final int numberOfPartitions;
private final int testIndex;
private int index;
private boolean isPoisened;
private TestSampleStream(ObjectStream<E> sampleStream, int numberOfPartitions, int testIndex) {
this.numberOfPartitions = numberOfPartitions;
this.sampleStream = sampleStream;
this.testIndex = testIndex;
}
public E read() throws IOException {
if (isPoisened) {
throw new IllegalStateException();
}
// skip training samples
while (index % numberOfPartitions != testIndex) {
sampleStream.read();
index++;
}
index++;
return sampleStream.read();
}
/**
* Throws <code>UnsupportedOperationException</code>
*/
public void reset() {
throw new UnsupportedOperationException();
}
public void close() throws IOException {
sampleStream.close();
isPoisened = true;
}
void poison() {
isPoisened = true;
}
}
/**
* The <code>TrainingSampleStream</code> which iterates over
* all training elements.
*
* Note:
* After the <code>TestSampleStream</code> was obtained
* the <code>TrainingSampleStream</code> must not be used
* anymore, otherwise a {@link IllegalStateException}
* is thrown.
*
* The <code>ObjectStream</code>s must not be used anymore after the
* <code>CrossValidationPartitioner</code> was moved
* to one of next partitions. If they are called anyway
* a {@link IllegalStateException} is thrown.
*
* @param <E>
*/
public static class TrainingSampleStream<E> implements ObjectStream<E> {
private ObjectStream<E> sampleStream;
private final int numberOfPartitions;
private final int testIndex;
private int index;
private boolean isPoisened;
private TestSampleStream<E> testSampleStream;
TrainingSampleStream(ObjectStream<E> sampleStream, int numberOfPartitions, int testIndex) {
this.numberOfPartitions = numberOfPartitions;
this.sampleStream = sampleStream;
this.testIndex = testIndex;
}
public E read() throws IOException {
if (testSampleStream != null || isPoisened) {
throw new IllegalStateException();
}
// If the test element is reached skip over it to not include it in
// the training data
if (index % numberOfPartitions == testIndex) {
sampleStream.read();
index++;
}
index++;
return sampleStream.read();
}
/**
* Resets the training sample. Use this if you need to collect things before
* training, for example, to collect induced abbreviations or create a POS
* Dictionary.
*
* @throws IOException
*/
public void reset() throws IOException {
if (testSampleStream != null || isPoisened) {
throw new IllegalStateException();
}
this.index = 0;
this.sampleStream.reset();
}
public void close() throws IOException {
sampleStream.close();
poison();
}
void poison() {
isPoisened = true;
if (testSampleStream != null)
testSampleStream.poison();
}
/**
* Retrieves the <code>ObjectStream</code> over the test/evaluations
* elements and poisons this <code>TrainingSampleStream</code>.
* From now on calls to the hasNext and next methods are forbidden
* and will raise an<code>IllegalArgumentException</code>.
*
* @return the test sample stream
*/
public ObjectStream<E> getTestSampleStream() throws IOException {
if (isPoisened) {
throw new IllegalStateException();
}
if (testSampleStream == null) {
sampleStream.reset();
testSampleStream = new TestSampleStream<>(sampleStream, numberOfPartitions, testIndex);
}
return testSampleStream;
}
}
/**
* An <code>ObjectStream</code> over the whole set of data samples which
* are used for the cross validation.
*/
private ObjectStream<E> sampleStream;
/**
* The number of parts the data is divided into.
*/
private final int numberOfPartitions;
/**
* The index of test part.
*/
private int testIndex;
/**
* The last handed out <code>TrainingIterator</code>. The reference
* is needed to poison the instance to fail fast if it is used
* despite the fact that it is forbidden!.
*/
private TrainingSampleStream<E> lastTrainingSampleStream;
/**
* Initializes the current instance.
*
* @param inElements
* @param numberOfPartitions
*/
public CrossValidationPartitioner(ObjectStream<E> inElements, int numberOfPartitions) {
this.sampleStream = inElements;
this.numberOfPartitions = numberOfPartitions;
}
/**
* Initializes the current instance.
*
* @param elements
* @param numberOfPartitions
*/
public CrossValidationPartitioner(Collection<E> elements, int numberOfPartitions) {
this(new CollectionObjectStream<>(elements), numberOfPartitions);
}
/**
* Checks if there are more partitions available.
*/
public boolean hasNext() {
return testIndex < numberOfPartitions;
}
/**
* Retrieves the next training and test partitions.
*/
public TrainingSampleStream<E> next() throws IOException {
if (hasNext()) {
if (lastTrainingSampleStream != null)
lastTrainingSampleStream.poison();
sampleStream.reset();
TrainingSampleStream<E> trainingSampleStream = new TrainingSampleStream<>(sampleStream,
numberOfPartitions, testIndex);
testIndex++;
lastTrainingSampleStream = trainingSampleStream;
return trainingSampleStream;
}
else {
throw new NoSuchElementException();
}
}
@Override
public String toString() {
return "At partition" + Integer.toString(testIndex + 1) +
" of " + Integer.toString(numberOfPartitions);
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/eval/EvaluationMonitor.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util.eval;
public interface EvaluationMonitor<T> {
void correctlyClassified(T reference, T prediction);
void missclassified(T reference, T prediction);
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/eval/Evaluator.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util.eval;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import opennlp.tools.util.ObjectStream;
/**
* The {@link Evaluator} is an abstract base class for evaluators.
*
* Evaluation results are the arithmetic mean of the
* scores calculated for each reference sample.
*/
public abstract class Evaluator<T> {
private List<EvaluationMonitor<T>> listeners;
@SafeVarargs
public Evaluator(EvaluationMonitor<T>... aListeners) {
if (aListeners != null) {
List<EvaluationMonitor<T>> listenersList = new ArrayList<>(aListeners.length);
for (EvaluationMonitor<T> evaluationMonitor : aListeners) {
if (evaluationMonitor != null) {
listenersList.add(evaluationMonitor);
}
}
listeners = Collections.unmodifiableList(listenersList);
} else {
listeners = Collections.emptyList();
}
}
/**
* Evaluates the given reference sample object.
*
* The implementation has to update the score after every invocation.
*
* @param reference the reference sample.
*
* @return the predicted sample
*/
protected abstract T processSample(T reference);
/**
* Evaluates the given reference object. The default implementation calls
* {@link Evaluator#processSample(Object)}
*
* <p>
* <b>note:</b> this method will be changed to private in the future.
* Implementations should override {@link Evaluator#processSample(Object)} instead.
* If this method is override, the implementation has to update the score
* after every invocation.
* </p>
*
* @param sample
* the sample to be evaluated
*/
public void evaluateSample(T sample) {
T predicted = processSample(sample);
if (!listeners.isEmpty()) {
if (sample.equals(predicted)) {
for (EvaluationMonitor<T> listener : listeners) {
listener.correctlyClassified(sample, predicted);
}
} else {
for (EvaluationMonitor<T> listener : listeners) {
listener.missclassified(sample, predicted);
}
}
}
}
/**
* Reads all sample objects from the stream
* and evaluates each sample object with
* {@link #evaluateSample(Object)} method.
*
* @param samples the stream of reference which
* should be evaluated.
*
* @throws IOException IOException
*/
public void evaluate(ObjectStream<T> samples) throws IOException {
T sample;
while ((sample = samples.read()) != null) {
evaluateSample(sample);
}
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/eval/FMeasure.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util.eval;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
/**
* The {@link FMeasure} is an utility class for evaluators
* which measure precision, recall and the resulting f-measure.
*
* Evaluation results are the arithmetic mean of the precision
* scores calculated for each reference sample and
* the arithmetic mean of the recall scores calculated for
* each reference sample.
*/
public final class FMeasure {
/**
* |selected| = true positives + false positives <br>
* the count of selected (or retrieved) items.
*/
private long selected;
/**
* |target| = true positives + false negatives <br>
* the count of target (or correct) items.
*/
private long target;
/**
* Storing the number of true positives found.
*/
private long truePositive;
/**
* Retrieves the arithmetic mean of the precision scores calculated for each
* evaluated sample.
*
* @return the arithmetic mean of all precision scores
*/
public double getPrecisionScore() {
return selected > 0 ? (double) truePositive / (double) selected : 0;
}
/**
* Retrieves the arithmetic mean of the recall score calculated for each
* evaluated sample.
*
* @return the arithmetic mean of all recall scores
*/
public double getRecallScore() {
return target > 0 ? (double) truePositive / (double) target : 0;
}
/**
* Retrieves the f-measure score.
*
* f-measure = 2 * precision * recall / (precision + recall)
* @return the f-measure or -1 if precision + recall <= 0
*/
public double getFMeasure() {
if (getPrecisionScore() + getRecallScore() > 0) {
return 2 * (getPrecisionScore() * getRecallScore())
/ (getPrecisionScore() + getRecallScore());
} else {
// cannot divide by zero, return error code
return -1;
}
}
/**
* Updates the score based on the number of true positives and
* the number of predictions and references.
*
* @param references the provided references
* @param predictions the predicted spans
*/
public void updateScores(final Object[] references, final Object[] predictions) {
truePositive += countTruePositives(references, predictions);
selected += predictions.length;
target += references.length;
}
/**
* Merge results into fmeasure metric.
* @param measure the fmeasure
*/
public void mergeInto(final FMeasure measure) {
this.selected += measure.selected;
this.target += measure.target;
this.truePositive += measure.truePositive;
}
/**
* Creates a human read-able {@link String} representation.
* @return the results
*/
@Override
public String toString() {
return "Precision: " + Double.toString(getPrecisionScore()) + "\n"
+ "Recall: " + Double.toString(getRecallScore()) + "\n" + "F-Measure: "
+ Double.toString(getFMeasure());
}
/**
* This method counts the number of objects which are equal and occur in the
* references and predictions arrays.
* Matched items are removed from the prediction list.
*
* @param references
* the gold standard
* @param predictions
* the predictions
* @return number of true positives
*/
static int countTruePositives(final Object[] references, final Object[] predictions) {
List<Object> predListSpans = new ArrayList<>(predictions.length);
Collections.addAll(predListSpans, predictions);
int truePositives = 0;
Object matchedItem = null;
for (Object referenceName : references) {
for (Object predListSpan : predListSpans) {
if (referenceName.equals(predListSpan)) {
matchedItem = predListSpan;
truePositives++;
}
}
if (matchedItem != null) {
predListSpans.remove(matchedItem);
}
}
return truePositives;
}
/**
* Calculates the precision score for the given reference and predicted spans.
*
* @param references
* the gold standard spans
* @param predictions
* the predicted spans
* @return the precision score or NaN if there are no predicted spans
*/
public static double precision(final Object[] references, final Object[] predictions) {
if (predictions.length > 0) {
return countTruePositives(references, predictions)
/ (double) predictions.length;
} else {
return Double.NaN;
}
}
/**
* Calculates the recall score for the given reference and predicted spans.
*
* @param references
* the gold standard spans
* @param predictions
* the predicted spans
*
* @return the recall score or NaN if there are no reference spans
*/
public static double recall(final Object[] references, final Object[] predictions) {
if (references.length > 0) {
return countTruePositives(references, predictions)
/ (double) references.length;
} else {
return Double.NaN;
}
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/eval/Mean.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util.eval;
/**
* Calculates the arithmetic mean of values
* added with the {@link #add(double)} method.
*/
public class Mean {
/**
* The sum of all added values.
*/
private double sum;
/**
* The number of times a value was added.
*/
private long count;
/**
* Adds a value to the arithmetic mean.
*
* @param value the value which should be added
* to the arithmetic mean.
*/
public void add(double value) {
add(value, 1);
}
/**
* Adds a value count times to the arithmetic mean.
*
* @param value the value which should be added
* to the arithmetic mean.
*
* @param count number of times the value should be added to
* arithmetic mean.
*/
public void add(double value, long count) {
sum += value * count;
this.count += count;
}
/**
* Retrieves the mean of all values added with
* {@link #add(double)} or 0 if there are zero added
* values.
*/
public double mean() {
return count > 0 ? sum / count : 0;
}
/**
* Retrieves the number of times a value
* was added to the mean.
*/
public long count() {
return count;
}
@Override
public String toString() {
return Double.toString(mean());
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/ext/ExtensionLoader.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util.ext;
import java.lang.reflect.Field;
/**
* The {@link ExtensionLoader} is responsible to load extensions to the OpenNLP library.
* <p>
* <b>Note:</b> Do not use this class, internal use only!
*/
public class ExtensionLoader {
private static boolean isOsgiAvailable = false;
private ExtensionLoader() {
}
static boolean isOSGiAvailable() {
return isOsgiAvailable;
}
static void setOSGiAvailable() {
isOsgiAvailable = true;
}
// Pass in the type (interface) of the class to load
/**
* Instantiates an user provided extension to OpenNLP.
* <p>
* The extension is either loaded from the class path or if running
* inside an OSGi environment via an OSGi service.
* <p>
* Initially it tries using the public default
* constructor. If it is not found, it will check if the class follows the singleton
* pattern: a static field named <code>INSTANCE</code> that returns an object of the type
* <code>T</code>.
*
* @param clazz
* @param extensionClassName
*
* @return the instance of the extension class
*/
// TODO: Throw custom exception if loading fails ...
@SuppressWarnings("unchecked")
public static <T> T instantiateExtension(Class<T> clazz, String extensionClassName) {
// First try to load extension and instantiate extension from class path
try {
Class<?> extClazz = Class.forName(extensionClassName);
if (clazz.isAssignableFrom(extClazz)) {
try {
return (T) extClazz.newInstance();
} catch (InstantiationException e) {
throw new ExtensionNotLoadedException(e);
} catch (IllegalAccessException e) {
// constructor is private. Try to load using INSTANCE
Field instanceField;
try {
instanceField = extClazz.getDeclaredField("INSTANCE");
} catch (NoSuchFieldException | SecurityException e1) {
throw new ExtensionNotLoadedException(e1);
}
if (instanceField != null) {
try {
return (T) instanceField.get(null);
} catch (IllegalArgumentException | IllegalAccessException e1) {
throw new ExtensionNotLoadedException(e1);
}
}
throw new ExtensionNotLoadedException(e);
}
}
else {
throw new ExtensionNotLoadedException("Extension class '" + extClazz.getName() +
"' needs to have type: " + clazz.getName());
}
} catch (ClassNotFoundException e) {
// Class is not on classpath
}
// Loading from class path failed
// Either something is wrong with the class name or OpenNLP is
// running in an OSGi environment. The extension classes are not
// on our classpath in this case.
// In OSGi we need to use services to get access to extensions.
// Determine if OSGi class is on class path
// Now load class which depends on OSGi API
if (isOsgiAvailable) {
// The OSGIExtensionLoader class will be loaded when the next line
// is executed, but not prior, and that is why it is safe to directly
// reference it here.
OSGiExtensionLoader extLoader = OSGiExtensionLoader.getInstance();
return extLoader.getExtension(clazz, extensionClassName);
}
throw new ExtensionNotLoadedException("Unable to find implementation for " +
clazz.getName() + ", the class or service " + extensionClassName +
" could not be located!");
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/ext/ExtensionNotLoadedException.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util.ext;
/**
* Exception indicates that an OpenNLP extension could not be loaded.
*/
@SuppressWarnings("serial")
public class ExtensionNotLoadedException extends RuntimeException {
private final boolean isOSGiEnvironment;
public ExtensionNotLoadedException(String message) {
super(message);
isOSGiEnvironment = ExtensionLoader.isOSGiAvailable();
}
public ExtensionNotLoadedException(Throwable t) {
super(t);
isOSGiEnvironment = ExtensionLoader.isOSGiAvailable();
}
/**
* Indicates if OpenNLP is running in an OSGi environment or not.
*
* @return true if running in an OSGi environment
*/
public boolean isOSGiEnvironment() {
return isOSGiEnvironment;
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/ext/ExtensionServiceKeys.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util.ext;
public class ExtensionServiceKeys {
/**
* Property key for the unique id which identifies an
* OSGi OpenNLP extension service.
*/
public static final String ID = "OPENLP_EXTENSION_ID";
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/ext/OSGiExtensionLoader.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util.ext;
import org.osgi.framework.BundleActivator;
import org.osgi.framework.BundleContext;
import org.osgi.framework.Filter;
import org.osgi.framework.FrameworkUtil;
import org.osgi.framework.InvalidSyntaxException;
import org.osgi.util.tracker.ServiceTracker;
/**
* OSGi bundle activator which can use an OSGi service as
* an OpenNLP extension.
* <p>
* <b>Note:</b> Do not use this class, internal use only!
*/
public class OSGiExtensionLoader implements BundleActivator {
private static OSGiExtensionLoader instance;
private BundleContext context;
public void start(BundleContext context) throws Exception {
instance = this;
this.context = context;
ExtensionLoader.setOSGiAvailable();
}
public void stop(BundleContext context) throws Exception {
instance = null;
this.context = null;
}
/**
* Retrieves the
*
* @param clazz
* @param id
* @return
*/
<T> T getExtension(Class<T> clazz, String id) {
if (context == null) {
throw new IllegalStateException("OpenNLP Tools Bundle is not active!");
}
Filter filter;
try {
filter = FrameworkUtil.createFilter("(&(objectclass=" + clazz.getName() + ")(" +
"opennlp" + "=" + id + "))");
} catch (InvalidSyntaxException e) {
// Might happen when the provided IDs are invalid in some way.
throw new ExtensionNotLoadedException(e);
}
// NOTE: In 4.3 the parameters are <T, T>
ServiceTracker extensionTracker = new ServiceTracker(context, filter, null);
T extension = null;
try {
extensionTracker.open();
try {
extension = (T) extensionTracker.waitForService(30000);
} catch (InterruptedException e) {
Thread.currentThread().interrupt();
}
} finally {
extensionTracker.close();
}
if (extension == null) {
throw new ExtensionNotLoadedException("No suitable extension found. Extension name: " + id);
}
return extension;
}
static OSGiExtensionLoader getInstance() {
return instance;
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/ext/package-info.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
/**
* Package containing extension loading code.
*/
package opennlp.tools.util.ext;
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/featuregen/AdaptiveFeatureGenerator.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util.featuregen;
import java.util.List;
/**
* An interface for generating features for name entity identification and for
* updating document level contexts.
* <p>
*
* <b>Note:</b><br>
* Feature generation is not thread safe and a instance of a feature generator
* must only be called from one thread. The resources used by a feature
* generator are typically shared between man instances of features generators
* which are called from many threads and have to be thread safe.
*/
public interface AdaptiveFeatureGenerator {
/**
* Adds the appropriate features for the token at the specified index with the
* specified array of previous outcomes to the specified list of features.
*
* @param features The list of features to be added to.
* @param tokens The tokens of the sentence or other text unit being processed.
* @param index The index of the token which is currently being processed.
* @param previousOutcomes The outcomes for the tokens prior to the specified index.
*/
void createFeatures(List<String> features, String[] tokens, int index, String[] previousOutcomes);
/**
* Informs the feature generator that the specified tokens have been classified with the
* corresponding set of specified outcomes.
*
* @param tokens The tokens of the sentence or other text unit which has been processed.
* @param outcomes The outcomes associated with the specified tokens.
*/
default void updateAdaptiveData(String[] tokens, String[] outcomes) {};
/**
* Informs the feature generator that the context of the adaptive data (typically a document)
* is no longer valid.
*/
default void clearAdaptiveData() {};
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/featuregen/AdditionalContextFeatureGenerator.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util.featuregen;
import java.util.List;
/**
* The {@link AdditionalContextFeatureGenerator} generates the context from the passed
* in additional context.
*/
public class AdditionalContextFeatureGenerator implements AdaptiveFeatureGenerator {
private String[][] additionalContext;
public void createFeatures(List<String> features, String[] tokens, int index, String[] preds) {
if (additionalContext != null && additionalContext.length != 0) {
String[] context = additionalContext[index];
for (String s : context) {
features.add("ne=" + s);
}
}
}
public void setCurrentContext(String[][] context) {
additionalContext = context;
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/featuregen/AggregatedFeatureGenerator.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util.featuregen;
import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.List;
import java.util.Objects;
/**
* The {@link AggregatedFeatureGenerator} aggregates a set of
* {@link AdaptiveFeatureGenerator}s and calls them to generate the features.
*/
public class AggregatedFeatureGenerator implements AdaptiveFeatureGenerator {
/**
* Contains all aggregated {@link AdaptiveFeatureGenerator}s.
*/
private Collection<AdaptiveFeatureGenerator> generators;
/**
* Initializes the current instance.
*
* @param generators array of generators, null values are not permitted
*/
public AggregatedFeatureGenerator(AdaptiveFeatureGenerator... generators) {
for (AdaptiveFeatureGenerator generator : generators) {
Objects.requireNonNull(generator, "null values in generators are not permitted");
}
this.generators = new ArrayList<>(generators.length);
Collections.addAll(this.generators, generators);
this.generators = Collections.unmodifiableCollection(this.generators);
}
public AggregatedFeatureGenerator(Collection<AdaptiveFeatureGenerator> generators) {
this(generators.toArray(new AdaptiveFeatureGenerator[generators.size()]));
}
/**
* Calls the {@link AdaptiveFeatureGenerator#clearAdaptiveData()} method
* on all aggregated {@link AdaptiveFeatureGenerator}s.
*/
public void clearAdaptiveData() {
for (AdaptiveFeatureGenerator generator : generators) {
generator.clearAdaptiveData();
}
}
/**
* Calls the {@link AdaptiveFeatureGenerator#createFeatures(List, String[], int, String[])}
* method on all aggregated {@link AdaptiveFeatureGenerator}s.
*/
public void createFeatures(List<String> features, String[] tokens, int index,
String[] previousOutcomes) {
for (AdaptiveFeatureGenerator generator : generators) {
generator.createFeatures(features, tokens, index, previousOutcomes);
}
}
/**
* Calls the {@link AdaptiveFeatureGenerator#updateAdaptiveData(String[], String[])}
* method on all aggregated {@link AdaptiveFeatureGenerator}s.
*/
public void updateAdaptiveData(String[] tokens, String[] outcomes) {
for (AdaptiveFeatureGenerator generator : generators) {
generator.updateAdaptiveData(tokens, outcomes);
}
}
/**
* Retrieves a {@link Collections} of all aggregated
* {@link AdaptiveFeatureGenerator}s.
*
* @return all aggregated generators
*/
public Collection<AdaptiveFeatureGenerator> getGenerators() {
return generators;
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/featuregen/ArtifactToSerializerMapper.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util.featuregen;
import java.util.Map;
import opennlp.tools.util.model.ArtifactSerializer;
public interface ArtifactToSerializerMapper {
Map<String, ArtifactSerializer<?>> getArtifactSerializerMapping();
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/featuregen/BigramNameFeatureGenerator.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util.featuregen;
import java.util.List;
public class BigramNameFeatureGenerator implements AdaptiveFeatureGenerator {
public void createFeatures(List<String> features, String[] tokens, int index,
String[] previousOutcomes) {
String wc = FeatureGeneratorUtil.tokenFeature(tokens[index]);
//bi-gram features
if (index > 0) {
features.add("pw,w=" + tokens[index - 1] + "," + tokens[index]);
String pwc = FeatureGeneratorUtil.tokenFeature(tokens[index - 1]);
features.add("pwc,wc=" + pwc + "," + wc);
}
if (index + 1 < tokens.length) {
features.add("w,nw=" + tokens[index] + "," + tokens[index + 1]);
String nwc = FeatureGeneratorUtil.tokenFeature(tokens[index + 1]);
features.add("wc,nc=" + wc + "," + nwc);
}
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/featuregen/BrownBigramFeatureGenerator.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util.featuregen;
import java.util.List;
/**
* Generates Brown cluster features for token bigrams.
*/
public class BrownBigramFeatureGenerator implements AdaptiveFeatureGenerator {
private BrownCluster brownCluster;
/**
* Creates a new Brown Cluster bigram feature generator.
* @param brownCluster A {@link BrownCluster}.
*/
public BrownBigramFeatureGenerator(BrownCluster brownCluster) {
this.brownCluster = brownCluster;
}
@Override
public void createFeatures(List<String> features, String[] tokens, int index,
String[] previousOutcomes) {
List<String> wordClasses = BrownTokenClasses.getWordClasses(tokens[index], brownCluster);
if (index > 0) {
List<String> prevWordClasses = BrownTokenClasses.getWordClasses(tokens[index - 1], brownCluster);
for (int i = 0; i < wordClasses.size() && i < prevWordClasses.size(); i++)
features.add("p" + "browncluster" + "," + "browncluster" + "="
+ prevWordClasses.get(i) + "," + wordClasses.get(i));
}
if (index + 1 < tokens.length) {
List<String> nextWordClasses = BrownTokenClasses.getWordClasses(tokens[index + 1], brownCluster);
for (int i = 0; i < wordClasses.size() && i < nextWordClasses.size(); i++) {
features.add("browncluster" + "," + "n" + "browncluster" + "="
+ wordClasses.get(i) + "," + nextWordClasses.get(i));
}
}
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/featuregen/BrownCluster.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util.featuregen;
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.OutputStreamWriter;
import java.io.Writer;
import java.nio.charset.StandardCharsets;
import java.util.HashMap;
import java.util.Map;
import java.util.regex.Pattern;
import opennlp.tools.util.model.ArtifactSerializer;
import opennlp.tools.util.model.SerializableArtifact;
/**
*
* Class to load a Brown cluster document: word\tword_class\tprob
* http://metaoptimize.com/projects/wordreprs/
*
* The file containing the clustering lexicon has to be passed as the
* value of the dict attribute of each BrownCluster feature generator.
*
*/
public class BrownCluster implements SerializableArtifact {
private static final Pattern tabPattern = Pattern.compile("\t");
public static class BrownClusterSerializer implements ArtifactSerializer<BrownCluster> {
public BrownCluster create(InputStream in) throws IOException {
return new BrownCluster(in);
}
public void serialize(BrownCluster artifact, OutputStream out)
throws IOException {
artifact.serialize(out);
}
}
private Map<String, String> tokenToClusterMap = new HashMap<>();
/**
* Generates the token to cluster map from Brown cluster input file.
* NOTE: we only add those tokens with frequency bigger than 5.
* @param in the inputstream
* @throws IOException the io exception
*/
public BrownCluster(InputStream in) throws IOException {
BufferedReader breader =
new BufferedReader(new InputStreamReader(in, StandardCharsets.UTF_8));
String line;
while ((line = breader.readLine()) != null) {
String[] lineArray = tabPattern.split(line);
if (lineArray.length == 3) {
int freq = Integer.parseInt(lineArray[2]);
if (freq > 5 ) {
tokenToClusterMap.put(lineArray[1], lineArray[0]);
}
}
else if (lineArray.length == 2) {
tokenToClusterMap.put(lineArray[0], lineArray[1]);
}
}
}
/**
* Check if a token is in the Brown:paths, token map.
* @param string the token to look-up
* @return the brown class if such token is in the brown cluster map
*/
public String lookupToken(String string) {
return tokenToClusterMap.get(string);
}
public void serialize(OutputStream out) throws IOException {
Writer writer = new BufferedWriter(new OutputStreamWriter(out));
for (Map.Entry<String, String> entry : tokenToClusterMap.entrySet()) {
writer.write(entry.getKey() + "\t" + entry.getValue() + "\n");
}
writer.flush();
}
public Class<?> getArtifactSerializerClass() {
return BrownClusterSerializer.class;
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/featuregen/BrownTokenClassFeatureGenerator.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util.featuregen;
import java.util.List;
/**
* Generates Brown cluster features for current token and token class.
*/
public class BrownTokenClassFeatureGenerator implements AdaptiveFeatureGenerator {
private BrownCluster brownLexicon;
public BrownTokenClassFeatureGenerator(BrownCluster dict) {
this.brownLexicon = dict;
}
public void createFeatures(List<String> features, String[] tokens, int index,
String[] previousOutcomes) {
String wordShape = FeatureGeneratorUtil.tokenFeature(tokens[index]);
List<String> wordClasses = BrownTokenClasses.getWordClasses(tokens[index], brownLexicon);
for (int i = 0; i < wordClasses.size(); i++) {
features.add("c," + "browncluster" + "=" + wordShape + "," + wordClasses.get(i));
}
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/featuregen/BrownTokenClasses.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util.featuregen;
import java.util.ArrayList;
import java.util.List;
/**
* Obtain the paths listed in the pathLengths array from the Brown class.
* This class is not to be instantiated.
*
*/
public class BrownTokenClasses {
public static final int[] pathLengths = { 4, 6, 10, 20 };
/**
* It provides a list containing the pathLengths for a token if found
* in the Map:token,BrownClass.
*
* @param token the token to be looked up in the brown clustering map
* @param brownLexicon the Brown clustering map
* @return the list of the paths for a token
*/
public static List<String> getWordClasses(String token, BrownCluster brownLexicon) {
if (brownLexicon.lookupToken(token) == null) {
return new ArrayList<>(0);
} else {
String brownClass = brownLexicon.lookupToken(token);
List<String> pathLengthsList = new ArrayList<>();
pathLengthsList.add(brownClass.substring(0, Math.min(brownClass.length(), pathLengths[0])));
for (int i = 1; i < pathLengths.length; i++) {
if (pathLengths[i - 1] < brownClass.length()) {
pathLengthsList.add(brownClass.substring(0,
Math.min(brownClass.length(), pathLengths[i])));
}
}
return pathLengthsList;
}
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/featuregen/BrownTokenFeatureGenerator.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util.featuregen;
import java.util.List;
/**
* Generates Brown cluster features for current token.
*/
public class BrownTokenFeatureGenerator implements AdaptiveFeatureGenerator {
private BrownCluster brownLexicon;
public BrownTokenFeatureGenerator(BrownCluster dict) {
this.brownLexicon = dict;
}
public void createFeatures(List<String> features, String[] tokens, int index,
String[] previousOutcomes) {
List<String> wordClasses = BrownTokenClasses.getWordClasses(tokens[index], brownLexicon);
for (int i = 0; i < wordClasses.size(); i++) {
features.add("browncluster" + "=" + wordClasses.get(i));
}
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/featuregen/CachedFeatureGenerator.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util.featuregen;
import java.util.ArrayList;
import java.util.List;
import opennlp.tools.util.Cache;
/**
* Caches features of the aggregated {@link AdaptiveFeatureGenerator}s.
*/
public class CachedFeatureGenerator implements AdaptiveFeatureGenerator {
private final AdaptiveFeatureGenerator generator;
private String[] prevTokens;
private Cache<Integer, List<String>> contextsCache;
private long numberOfCacheHits;
private long numberOfCacheMisses;
public CachedFeatureGenerator(AdaptiveFeatureGenerator... generators) {
this.generator = new AggregatedFeatureGenerator(generators);
contextsCache = new Cache<>(100);
}
public void createFeatures(List<String> features, String[] tokens, int index,
String[] previousOutcomes) {
List<String> cacheFeatures;
if (tokens == prevTokens) {
cacheFeatures = contextsCache.get(index);
if (cacheFeatures != null) {
numberOfCacheHits++;
features.addAll(cacheFeatures);
return;
}
} else {
contextsCache.clear();
prevTokens = tokens;
}
cacheFeatures = new ArrayList<>();
numberOfCacheMisses++;
generator.createFeatures(cacheFeatures, tokens, index, previousOutcomes);
contextsCache.put(index, cacheFeatures);
features.addAll(cacheFeatures);
}
public void updateAdaptiveData(String[] tokens, String[] outcomes) {
generator.updateAdaptiveData(tokens, outcomes);
}
public void clearAdaptiveData() {
generator.clearAdaptiveData();
}
/**
* Retrieves the number of times a cache hit occurred.
*
* @return number of cache hits
*/
public long getNumberOfCacheHits() {
return numberOfCacheHits;
}
/**
* Retrieves the number of times a cache miss occurred.
*
* @return number of cache misses
*/
public long getNumberOfCacheMisses() {
return numberOfCacheMisses;
}
@Override
public String toString() {
return super.toString() + ": hits=" + numberOfCacheHits
+ " misses=" + numberOfCacheMisses + " hit%" + (numberOfCacheHits > 0 ?
(double) numberOfCacheHits / (numberOfCacheMisses + numberOfCacheHits) : 0);
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/featuregen/CharacterNgramFeatureGenerator.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util.featuregen;
import java.util.List;
import opennlp.tools.ngram.NGramModel;
import opennlp.tools.util.StringList;
import opennlp.tools.util.StringUtil;
/**
* The {@link CharacterNgramFeatureGenerator} uses character ngrams to
* generate features about each token.
* The minimum and maximum length can be specified.
*/
public class CharacterNgramFeatureGenerator implements AdaptiveFeatureGenerator {
private final int minLength;
private final int maxLength;
public CharacterNgramFeatureGenerator(int minLength, int maxLength) {
this.minLength = minLength;
this.maxLength = maxLength;
}
/**
* Initializes the current instance with min 2 length and max 5 length of ngrams.
*/
public CharacterNgramFeatureGenerator() {
this(2, 5);
}
public void createFeatures(List<String> features, String[] tokens, int index, String[] preds) {
NGramModel model = new NGramModel();
model.add(tokens[index], minLength, maxLength);
for (StringList tokenList : model) {
if (tokenList.size() > 0) {
features.add("ng=" + StringUtil.toLowerCase(tokenList.getToken(0)));
}
}
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/featuregen/CustomFeatureGenerator.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util.featuregen;
import java.util.Map;
import opennlp.tools.util.InvalidFormatException;
public abstract class CustomFeatureGenerator implements AdaptiveFeatureGenerator {
/**
* Initialized the Custom Feature Generator with defined properties and loaded resources.
*
* @param properties
* @param resourceProvider
*/
public abstract void init(Map<String, String> properties, FeatureGeneratorResourceProvider resourceProvider)
throws InvalidFormatException;
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/featuregen/DictionaryFeatureGenerator.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util.featuregen;
import java.util.List;
import opennlp.tools.dictionary.Dictionary;
import opennlp.tools.namefind.DictionaryNameFinder;
/**
* The {@link DictionaryFeatureGenerator} uses the {@link DictionaryNameFinder}
* to generated features for detected names based on the {@link InSpanGenerator}.
*
* @see Dictionary
* @see DictionaryNameFinder
* @see InSpanGenerator
*/
public class DictionaryFeatureGenerator implements AdaptiveFeatureGenerator {
private InSpanGenerator isg;
public DictionaryFeatureGenerator(Dictionary dict) {
this("",dict);
}
public DictionaryFeatureGenerator(String prefix, Dictionary dict) {
setDictionary(prefix,dict);
}
public void setDictionary(Dictionary dict) {
setDictionary("",dict);
}
public void setDictionary(String name, Dictionary dict) {
isg = new InSpanGenerator(name, new DictionaryNameFinder(dict));
}
public void createFeatures(List<String> features, String[] tokens, int index, String[] previousOutcomes) {
isg.createFeatures(features, tokens, index, previousOutcomes);
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/featuregen/DocumentBeginFeatureGenerator.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util.featuregen;
import java.util.List;
public class DocumentBeginFeatureGenerator implements AdaptiveFeatureGenerator {
private String[] firstSentence;
public void createFeatures(List<String> features, String[] tokens, int index,
String[] previousOutcomes) {
if (firstSentence == null) {
firstSentence = tokens;
}
if (firstSentence == tokens && index == 0) {
features.add("D=begin");
}
}
@Override
public void clearAdaptiveData() {
firstSentence = null;
}
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/featuregen/FeatureGeneratorResourceProvider.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util.featuregen;
/**
* The {@link FeatureGeneratorResourceProvider} provides access to the resources
* provided in the model. Inside the model resources are identified by a
* name.
* <p>
* <b>Note:</b><br>
* This class is not be intended to be implemented by users.<br>
* All implementing classes must be thread safe.
*/
public interface FeatureGeneratorResourceProvider {
/**
* Retrieves the resource object for the given name/identifier.
*
* @param resourceIdentifier the identifier which names the resource.
*
* @return the resource object
*/
Object getResource(String resourceIdentifier);
}
|
0
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util
|
java-sources/ai/idylnlp/idylnlp-opennlp-tools-1.8.3/1.1.0/opennlp/tools/util/featuregen/FeatureGeneratorUtil.java
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package opennlp.tools.util.featuregen;
import java.util.regex.Pattern;
/**
* This class provide common utilities for feature generation.
*/
public class FeatureGeneratorUtil {
private static final String TOKEN_CLASS_PREFIX = "wc";
private static final String TOKEN_AND_CLASS_PREFIX = "w&c";
private static final Pattern capPeriod = Pattern.compile("^[A-Z]\\.$");
/**
* Generates a class name for the specified token.
* The classes are as follows where the first matching class is used:
* <ul>
* <li>lc - lowercase alphabetic</li>
* <li>2d - two digits </li>
* <li>4d - four digits </li>
* <li>an - alpha-numeric </li>
* <li>dd - digits and dashes </li>
* <li>ds - digits and slashes </li>
* <li>dc - digits and commas </li>
* <li>dp - digits and periods </li>
* <li>num - digits </li>
* <li>sc - single capital letter </li>
* <li>ac - all capital letters </li>
* <li>ic - initial capital letter </li>
* <li>other - other </li>
* </ul>
* @param token A token or word.
* @return The class name that the specified token belongs in.
*/
public static String tokenFeature(String token) {
StringPattern pattern = StringPattern.recognize(token);
String feat;
if (pattern.isAllLowerCaseLetter()) {
feat = "lc";
}
else if (pattern.digits() == 2) {
feat = "2d";
}
else if (pattern.digits() == 4) {
feat = "4d";
}
else if (pattern.containsDigit()) {
if (pattern.containsLetters()) {
feat = "an";
}
else if (pattern.containsHyphen()) {
feat = "dd";
}
else if (pattern.containsSlash()) {
feat = "ds";
}
else if (pattern.containsComma()) {
feat = "dc";
}
else if (pattern.containsPeriod()) {
feat = "dp";
}
else {
feat = "num";
}
}
else if (pattern.isAllCapitalLetter()) {
if (token.length() == 1) {
feat = "sc";
}
else {
feat = "ac";
}
}
else if (capPeriod.matcher(token).find()) {
feat = "cp";
}
else if (pattern.isInitialCapitalLetter()) {
feat = "ic";
}
else {
feat = "other";
}
return (feat);
}
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.