/*
CSTLEMMA - trainable lemmatiser

Copyright (C) 2002, 2005  Center for Sprogteknologi, University of Copenhagen

This file is part of CSTLEMMA.

CSTLEMMA is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.

CSTLEMMA 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 General Public License for more details.

You should have received a copy of the GNU General Public License
along with CSTLEMMA; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
*/
#include "lemmtags.h"
#include "caseconv.h"
#include <stdio.h>
#include <string.h>
#include <ctype.h>


static char * lemmaX = NULL;
char ** fullTags = NULL; //List of tags that may occur in the text  (e.g. V_MED_PAST)
char ** lemmaTags = NULL; //List of tags of the corresponding lemmata (e.g. V_MED)
// tags that occur in the text as well as in the dictionary are not listed.
int fulltagcnt = 0;

const char * LemmaTag(const char * tag)
    {
    int f;
    for(f = 0;f < fulltagcnt;++f)
        {
        if(!strcmp(tag,fullTags[f]))
            break;
        }
    if(f < fulltagcnt)
        return lemmaTags[f];
    else
        return tag;
    }

static bool taglinecheck(const char * xx)
    {
    int d;
    int len = strlen(xx);
    return strspn(xx,"ABCDEFGHIJKLMNOPQRSTUVWXYZĈĜĊ_\t ") == strlen(xx) // line consists only of capital letters and white space
        && (d = strcspn(xx,"\t ")) > 0 // line contains identifier
        && d < len // line contains space
        && strcspn(xx+d,"ABCDEFGHIJKLMNOPQRSTUVWXYZĈĜĊ_") < (size_t)(len - d); // line contains identifier after space
    }

bool readLemmaTags(FILE * fpx,bool nice)
    {
//    printf("reading lexical type translation table \"%s\"...",x);
    fseek(fpx,0,SEEK_END);

    long cnt = ftell(fpx);
    if(nice)
        printf("cnt = %ld\n",cnt);
    rewind(fpx);
    lemmaX = new char[cnt+1];
    fread(lemmaX,cnt,1,fpx);
//    fclose(fpx);
    fulltagcnt = 0;
    char * nxt;
    char * xx;
    for(xx = lemmaX;(nxt = strchr(xx,'\n')) != NULL;xx = nxt + 1)
        {
        *nxt = '\0';
        if(taglinecheck(xx))
            ++fulltagcnt;
        *nxt = '\n';
        }
    lemmaTags = new char*[fulltagcnt];
    fullTags = new char*[fulltagcnt];
    fulltagcnt = 0;
    for(xx = lemmaX;(nxt = strchr(xx,'\n')) != NULL;xx = nxt + 1)
        {
        *nxt = '\0';
        if(taglinecheck(xx))
            {
            while(isSpace(*xx))
                ++xx;

            fullTags[fulltagcnt] = xx;

            while(*xx && !isSpace(*xx))
                ++xx;

            if(*xx)
                {
                *xx++ = '\0';
                while(isSpace(*xx))
                    ++xx;
                lemmaTags[fulltagcnt] = xx;
                while(*xx && !isSpace(*xx))
                    ++xx;
                *xx = '\0';
                }
            else
                {
                printf("error in tag translation table\n");
                }
            ++fulltagcnt;
            }
        }
    if(nice)
        {
        printf("\n");
        for(int i = 0;i < fulltagcnt;++i)
            printf("%s %s\n",fullTags[i],lemmaTags[i]);
        }
    return true;
    }