ffpriv_ss_abnormal.c

Go to the documentation of this file.

/*
 * finflect - Algorithms and tools for inflecting Finnish nouns
 * Copyright (C) 2004, 2005  The FinFlect Team
 *
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version.
 *
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 *
 *
 * For the complete legal text of the GNU Lesser General Public License,
 * see the file LICENSE. For a complete list of authors and copyright
 * holders, see the file AUTHORS.
 */

/**
 * @file ffpriv_ss_abnormal.c Contains the exception list for words that end in s
 * and behave abnormally, and implements the functions for getting information
 * from it with binary search. The functions are declared in ffpriv_ss_abnormal.h.
 */

#include "ffpriv_ss_abnormal.h"
#include "ffstring.h"

#define SS_LIST_LEN 107

static ffchar* ss_list[SS_LIST_LEN][2] = {
  {"ahdas", "ahtaa"},
  {"allas", "altaa"},
  {"ahnas", "ahnaa"},
  {"altis", "alttii"},
  {"armas", "armaa"},
  {"aulis", "aulii"},
  {"autuas", "autuaa"},
  {"hammas", "hampaa"},
  {"harras", "hartaa"},
  {"hauras", "hauraa"},
  {"hidas", "hitaa"},
  {"hirvas", "hirvaa"},
  {"ies", "ikee"},
  {"kangas", "kankaa"},
  {"kallis", "kallii"},
  {"kalvas", "kalvaa"},
  {"karsas", "karsaa"},
  {"karvas", "karvaa"},
  {"katras", "katraa"},
  {"kaunis", "kaunii"},
  {"kauris", "kaurii"},
  {"keidas", "keitaa"},
  {"kernas", "kernaa"},
  {"kinnas", "kintaa"},
  {"kiivas", "kiivaa"},
  {"kirves", "kirvee"},
  {"kitsas", "kitsaa"},
  {"kiuas", "kiukaa"},
  {"koiras", "koiraa"},
  {"kokelas", "kokelaa"},
  {"kuhilas", "kuhilaa"},
  {"kuningas", "kuninkaa"},
  {"kunnas", "kunnaa"},
  {"kuulas", "kuulaa"},
  {"kuvaus", "kuvaukse"},
  {"lammas", "lampaa"},
  {"lipas", "lippaa"},
  {"lounas", "lounaa"},
  {"lunnas", "lunnaa"},
  {"mallas", "maltaa"},
  {"marras", "martaa"},
  {"mies", "miehe"},
  {"naaras", "naaraa"},
  {"nauris", "naurii"},
  {"opas", "oppaa"},
  {"oas", "okaa"},
  {"oinas", "oinaa"},
  {"olas", "olaa"},
  {"oppilas", "oppilaa"},
  {"oras", "oraa"},
  {"parras", "partaa"},
  {"paljas", "paljaa"},
  {"paras", "parhaa"},
  {"patsas", "patsaa"},
  {"pensas", "pensaa"},
  {"piiras", "piiraa"},
  {"porras", "portaa"},
  {"porsas", "porsaa"},
  {"potilas", "potilaa"},
  {"pudas", "putaa"},
  {"puhdas", "puhtaa"},
  {"ratas", "rattaa"},
  {"raavas", "raavaa"},
  {"rahvas", "rahvaa"},
  {"raitis", "raittii"},
  {"raihnas", "raihnaa"},
  {"rastas", "rastaa"},
  {"ratsas", "ratsaa"},
  {"rengas", "renkaa"},
  {"reipas", "reippaa"},
  {"rietas", "riettaa"},
  {"ruhtinas", "ruhtinaa"},
  {"ruis", "rukii"},
  {"runsas", "runsaa"},
  {"ruumis", "ruumii"},
  {"saapas", "saappaa"},
  {"saalis", "saalii"},
  {"sairas", "sairaa"},
  {"sees", "sekee"},
  {"sotilas", "sotilaa"},
  {"tahdas", "tahtaa"},
  {"taivas", "taivaa"},
  {"tehdas", "tehtaa"},
  {"teuras", "teuraa"},
  {"tiivis", "tiivii"},
  {"toipilas", "toipilaa"},
  {"tupas", "tuppaa"},
  {"tuores", "tuoree"},
  {"turilas", "turilaa"},
  {"tursas", "tursaa"},
  {"tyyris", "tyyrii"},
  {"uros", "uroo"},
  {"uuras", "uuraa"},
  {"valpas", "valppaa"},
  {"varas", "varkaa"},
  {"varras", "vartaa"},
  {"varvas", "varpaa"},
  {"valas", "valaa"},
  {"valmis", "valmii"},
  {"vauras", "vauraa"},
  {"vehmas", "vehmaa"},
  {"vilpas", "vilppaa"},
  {"vieras", "vieraa"},
  {"viisas", "viisaa"},
  {"vitsas", "vitsaa"},
  {"vuolas", "vuolaa"},
  {"äes", "äkee"},
};

ffint32 ffpriv_ss_genitive(ffword* word)
{
  ffint32 result = 0;
  int high, low, i;

  for(high = SS_LIST_LEN-1, low = -1; high - low > 1; ) {
    i = (high + low) / 2;
    if(ffstring_compare(&word->data, ss_list[i][0]) < 1)
      high = i;
    else
      low = i;
  }
  if(ffstring_equals(&word->data, ss_list[high][0])) {
    if((result = ffstring_delete(&word->data)))
      return result;
    else if((result = ffstring_create(ss_list[high][1], &word->data)))
      return result;
    else return 1;  
  }  
  else
    return 0;
}

---