All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.tartarus.snowball.ext.danishStemmer Maven / Gradle / Ivy

The newest version!
// This file was generated automatically by the Snowball to Java compiler
// http://snowballstem.org/

package org.tartarus.snowball.ext;

import org.tartarus.snowball.Among;

 /**
  * This class was automatically generated by a Snowball to Java compiler
  * It implements the stemming algorithm defined by a snowball script.
  */

public class danishStemmer extends org.tartarus.snowball.SnowballStemmer {

    private static final long serialVersionUID = 1L;

    private final static Among a_0[] = {
        new Among ( "hed", -1, 1 ),
        new Among ( "ethed", 0, 1 ),
        new Among ( "ered", -1, 1 ),
        new Among ( "e", -1, 1 ),
        new Among ( "erede", 3, 1 ),
        new Among ( "ende", 3, 1 ),
        new Among ( "erende", 5, 1 ),
        new Among ( "ene", 3, 1 ),
        new Among ( "erne", 3, 1 ),
        new Among ( "ere", 3, 1 ),
        new Among ( "en", -1, 1 ),
        new Among ( "heden", 10, 1 ),
        new Among ( "eren", 10, 1 ),
        new Among ( "er", -1, 1 ),
        new Among ( "heder", 13, 1 ),
        new Among ( "erer", 13, 1 ),
        new Among ( "s", -1, 2 ),
        new Among ( "heds", 16, 1 ),
        new Among ( "es", 16, 1 ),
        new Among ( "endes", 18, 1 ),
        new Among ( "erendes", 19, 1 ),
        new Among ( "enes", 18, 1 ),
        new Among ( "ernes", 18, 1 ),
        new Among ( "eres", 18, 1 ),
        new Among ( "ens", 16, 1 ),
        new Among ( "hedens", 24, 1 ),
        new Among ( "erens", 24, 1 ),
        new Among ( "ers", 16, 1 ),
        new Among ( "ets", 16, 1 ),
        new Among ( "erets", 28, 1 ),
        new Among ( "et", -1, 1 ),
        new Among ( "eret", 30, 1 )
    };

    private final static Among a_1[] = {
        new Among ( "gd", -1, -1 ),
        new Among ( "dt", -1, -1 ),
        new Among ( "gt", -1, -1 ),
        new Among ( "kt", -1, -1 )
    };

    private final static Among a_2[] = {
        new Among ( "ig", -1, 1 ),
        new Among ( "lig", 0, 1 ),
        new Among ( "elig", 1, 1 ),
        new Among ( "els", -1, 1 ),
        new Among ( "l\u00F8st", -1, 2 )
    };

    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 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);
        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) == 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("st")))
            {
                break lab0;
            }
            // ], line 66
            bra = cursor;
            // literal, line 66
            if (!(eq_s_b("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);
        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_s_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();
    }



}





© 2015 - 2024 Weber Informatics LLC | Privacy Policy