ffpriv_general_local_cases.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_general_local_cases.c Implements functions for inflecting
 * words in general local cases. They are declared in ffpriv_general_local_cases.c.
 */
 
#include "ffpriv_general_local_cases.h"
#include "ffpriv_genitive_stem.h"
#include "ffpriv_partitive_stem.h"
#include "ffpriv_essive_stem.h"
#include "ffpriv_plural_stem.h"
#include "ffregex.h"
#include "ffutil.h"
 
ffint32 ffpriv_partitive_singular(ffword* word)
{
  ffint32 err;


  if ( (err = ffpriv_partitive_stem(word)) ) {
    return err;
  }

  /* TODO: Version 2+n, update to multiple return vales */

  if ( ffstring_tail_equals_ci(&word->data, 2, "ea") || ffstring_tail_equals_ci(&word->data, 2, "eä")) {
       return ffstring_append(&word->data, ffpriv_vowel_harmony(&word->data, "a", "ä"));
  }

  if ( ffpriv_is_consonant(ffstring_last(&word->data)) || ffregex_match_ci("^.*[aeiouyåäöÅÄÖ][aeiouyåäöÅÄÖ]$", &word->data) ) {
    return ffstring_append(&word->data, ffpriv_vowel_harmony(&word->data, "ta", "tä"));
  } else {
    return ffstring_append(&word->data, ffpriv_vowel_harmony(&word->data, "a", "ä"));
  }
}

ffint32 ffpriv_partitive_plural(ffword* word)
{
  ffword stem;
  ffstring_copy(&word->data,&stem.data);
  stem.metadata = word->metadata;
  stem.metadata.cg = 1;
  ffpriv_plural_stem(&stem);

  if (
    ffregex_match_ci("^.*[aeiouyåäöÅÄÖ][aeiouyåäöÅÄÖ]$", &stem.data) && (
      ffregex_match_ci("^.*[aeiouyåäöÅÄÖ][^aeiouyåäöÅÄÖ]+[aeiouyåäöÅÄÖ][^aeiouyåäöÅÄÖ][aeiouyåäöÅÄÖ]$", &word->data) ||
      ffregex_match_ci("^.*[aeiouyåäöÅÄÖ][aeiouyåäöÅÄÖ]$", &word->data) ||
      ffpriv_is_consonant(ffstring_last(&word->data)) /* TODO RELIC CONSONANT aND LOAN || */
      )
   ) {
     ffstring_append(&stem.data, ffpriv_vowel_harmony(&stem.data, "ta", "tä"));
     ffstring_delete(&word->data);
     word->data = stem.data;
     return 0;
  } else {
    if ( ffpriv_is_vowel( stem.data.str[stem.data.len - 2] ) ) {
       ffstring_rfe(&stem.data, 1, ffpriv_vowel_harmony(&stem.data, "ja", "jä") );
       ffstring_delete(&word->data);
       word->data = stem.data;
       return 0;

    } else {
      ffstring_append(&stem.data, ffpriv_vowel_harmony(&stem.data, "a", "ä") );
      ffstring_delete(&word->data);
      word->data = stem.data;
      return 0;

    }

  }


}

ffint32 ffpriv_essive_singular(ffword* word)
{
  ffint32 err;
  
  if ( (err = ffpriv_essive_stem(word)) ) {
    
    return err;
  }
  
  return ffstring_append(&word->data, ffpriv_vowel_harmony(&word->data, "na", "nä"));
}

ffint32 ffpriv_essive_plural(ffword* word)
{
  word->metadata.cg = 1;
  ffpriv_plural_stem(word);
  ffstring_append(&word->data, ffpriv_vowel_harmony(&word->data, "na", "nä"));
  return 0;
}

ffint32 ffpriv_translative_singular(ffword* word)
{
  ffint32 err;
  
  if ( (err = ffpriv_genitive_stem(word)) ) {
    return err;
  } else {
    return ffstring_append(&word->data,"ksi");
  }
}

ffint32 ffpriv_translative_plural(ffword* word)
{
  ffpriv_plural_stem(word);
  ffstring_append(&word->data,"ksi");
  return 0;
}

---