ffpriv_consonant_gradation.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_consonant_gradation.c Implements the consonant gradation function
 * defined in ffpriv_consonant_gradation.h.
 */
 
#include "ffstring.h"
#include "ffregex.h"
#include "ffpriv_consonant_gradation.h"


ffint32 ffpriv_consonant_gradation(ffstring* word, ffuint32 direction, ffuint32 type)
{
  ffint32 err;
  ffstring t;
  
  if ( direction == 1 && type == 1 ) {
    if ( ffregex_match_ci("^.*(kk|pp|tt)[aeiouyåäöÅÄÖ]$", word) ) {
      err = ffstring_tail(word, 2, &t);
      if ( err ) { return err; }
      err = ffstring_rfe_ff(word, 3, &t);
      ffstring_delete(&t);
      return err;
    }
    
    if ( ffregex_match_ci("^.*[nlr]t[aeiouyåäöÅÄÖ]$", word) ) {
      return -!ffregex_replace_ci("(.)t(.)$", "${1}${1}${2}", word);
    }
    
    if ( ffregex_match_ci("^.*[aeiouyåäöÅÄÖ]t[aeiouyåäöÅÄÖ]$", word) ) {
      return -!ffregex_replace_ci("t(.)$", "d${1}", word);
    }
    
    if ( ffregex_match_ci("^.*mp[aeiouyåäöÅÄÖ]$", word) ) {
      return -!ffregex_replace_ci("p(.)$", "m${1}", word);
    }
    
    if ( ffregex_match_ci("^.*[lr]p[aeiouyåäöÅÄÖ]$", word) ) {
      return -!ffregex_replace_ci("p(.)$", "v${1}", word);
    }
    
    if ( ffregex_match_ci("^.*[aeiouyåäöÅÄÖ]p[aeiouyåäöÅÄÖ]$", word) ) {
      return -!ffregex_replace_ci("p(.)$", "v${1}", word);
    }
    
    if ( ffregex_match_ci("^.*[lr]k[aeiouyåäöÅÄÖ]$", word) ) {
      return -!ffregex_replace_ci("k(.)$", "${1}", word);
    }
    
    if ( ffregex_match_ci("^.*nk[aeiouyåäöÅÄÖ]$", word) ) {
      return -!ffregex_replace_ci("k(.)$", "g${1}", word);
    }
    
    if ( ffregex_match_ci("^.*ht[aeiouyåäöÅÄÖ]$", word) ) {
      return -!ffregex_replace_ci("t(.)$", "d${1}", word);
    }
    
    if ( ffregex_match_ci("^.[uy]k[uy]$", word) ) {
      return -!ffregex_replace_ci("k(.)$", "v${1}", word);
    }
    
    if ( ffregex_match_ci("^([aeiouyåäöÅÄÖ]|[^aeiouyåäöÅÄÖ][aeiouyåäöÅÄÖ]+)k[aeiouyåäöÅÄÖ]$", word) ) {
      return -!ffregex_replace_ci("k(.)$", "${1}", word);
    }
    
  }
  
  
  
  return 0;
}

---