Subversion Repositories wimsdev

Rev

Rev 3247 | Rev 8100 | Go to most recent revision | Blame | Compare with Previous | Last modification | View Log | RSS feed

  1. /*    Copyright (C) 1998-2003 XIAO, Gang of Universite de Nice - Sophia Antipolis
  2.  *
  3.  *  This program is free software; you can redistribute it and/or modify
  4.  *  it under the terms of the GNU General Public License as published by
  5.  *  the Free Software Foundation; either version 2 of the License, or
  6.  *  (at your option) any later version.
  7.  *
  8.  *  This program is distributed in the hope that it will be useful,
  9.  *  but WITHOUT ANY WARRANTY; without even the implied warranty of
  10.  *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  11.  *  GNU General Public License for more details.
  12.  *
  13.  *  You should have received a copy of the GNU General Public License
  14.  *  along with this program; if not, write to the Free Software
  15.  *  Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  16.  */
  17.  
  18.         /* Versatile translation according to a dictionary */
  19.  
  20. /*************** Customization: change values hereafter ****************/
  21.  
  22.         /* limit of dictionary entries */
  23. #define entrylim 32768
  24.         /* limit of dictionary length */
  25. #define diclim  1024*1024
  26.  
  27. /***************** Nothing should need change hereafter *****************/
  28.  
  29. #include "../Lib/basicstr.c"
  30.  
  31.  
  32. char inpbuf[MAX_LINELEN+1], outbuf[2*MAX_LINELEN+2];
  33. char *dicbuf;
  34. struct entry {
  35.     unsigned char *original, *replace;
  36.     int olen,earlier;
  37. } entry[entrylim];
  38. int entrycount;
  39.  
  40. enum {
  41.     unk_delete, unk_leave, unk_replace
  42. };
  43.  
  44. int has_digits=0;
  45. int unknown_type=unk_delete;
  46. int nocase=0,leaveline=0;
  47. char *unknown, unkbuf[1024];
  48.  
  49. int compare(int i1, const char *s2)
  50. {
  51.     int k;
  52.     if(nocase) k=strncasecmp((char*)entry[i1].original,s2,entry[i1].olen);
  53.     else k=strncmp((char*)entry[i1].original,s2,entry[i1].olen);
  54.     if(k==0 && (isalnum(*(s2+entry[i1].olen)) || (*(s2+entry[i1].olen)&128)!=0)) return -1;
  55.     else return k;
  56. }
  57.  
  58.         /* searches a list. Returns index if found, -1 if nomatch.
  59.          * Uses binary search, list must be sorted. */
  60. int search_list(struct entry *list, int items, size_t item_size, const char *str)
  61. {
  62.     int i1,i2,j,k,t,t1;
  63.     unsigned char c;
  64.  
  65.     if(items<=0) return -1;
  66.     j=0; c=str[0];
  67.     k=list[0].original[0]-c; if(k==0) k=compare(0,str);
  68.     if(k==0) goto more; if(k>0) return -1;
  69.     j=items-1; k=list[j].original[0]-c; if(k==0) k=compare(j,str);
  70.     if(k==0) return j;
  71.     if(k>0) for(i1=0,i2=j;i2>i1+1;) {
  72.         j=i1+(i2-i1)/2;
  73.         k=list[j].original[0]-c; if(k==0) k=compare(j,str);
  74.         if(k==0) goto more;
  75.         if(k>0) {i2=j; continue;}
  76.         if(k<0) {i1=j; continue;}      
  77.     }
  78.     if(k>0) {j--;k=compare(j,str);}
  79.     more:
  80.     if((t=list[j].earlier)<0) {
  81.         if(k==0) return j; else return -1;
  82.     }
  83.     if(compare(t,str)!=0) return -1;
  84.     for(j=t1=t,k=0;j<items && list[j].earlier==t1 && (k=compare(j,str))<=0; j++)
  85.       if(k==0) t=j;
  86.     return t;
  87. }
  88.  
  89.         /* change all spaces into ' ', and collapse multiple occurences */
  90. void singlespace(char *p)
  91. {
  92.     char *pp, *p2;
  93.     for(pp=p;*pp;pp++) {
  94.         if(!isspace(*pp)) continue;
  95.         if(leaveline) {
  96.             if(*pp==13) ovlstrcpy(pp,pp+1);
  97.             if(*pp=='\n') {
  98.                 pp++;
  99.                 gopt: for(p2=pp; isspace(*p2) && *p2!='\n'; p2++);
  100.                 if(p2>pp) ovlstrcpy(pp,p2); pp--;
  101.             }
  102.             else {
  103.                 pp++; if(!isspace(*pp) || *pp=='\n') continue;
  104.                 goto gopt;
  105.             }
  106.         }
  107.         else {
  108.             if(*pp!=' ') *pp=' ';
  109.             if(!isspace(*(pp+1))) continue;
  110.             for(pp++,p2=pp;isspace(*p2);p2++);
  111.             ovlstrcpy(pp,p2); pp--;
  112.         }
  113.     }
  114. }
  115.  
  116. #include "suffix.c"
  117.  
  118.         /* Prepare dictionary */
  119. void prepare_dic(char *fname)
  120. {
  121.     int i,l;
  122.     FILE *dicf;
  123.     char *p1, *p2, *pp;
  124.     long int flen;
  125.    
  126.     entrycount=0;
  127.     dicf=fopen(fname,"r"); if(dicf==NULL) return;
  128.     fseek(dicf,0,SEEK_END);flen=ftell(dicf); fseek(dicf,0,SEEK_SET);
  129.     if(flen>diclim) return;
  130.     dicbuf=xmalloc(flen+16);flen=fread(dicbuf,1,flen,dicf);
  131.     fclose(dicf);
  132.     if(flen>0 && flen<diclim) dicbuf[flen]=0;
  133.     else return;
  134.     for(i=0,p1=dicbuf;p1!=NULL && *p1!=0 && i<entrylim;p1=p2) {
  135.         p2=strchr(p1+1,'\n'); if(p2>p1) *p2++=0;
  136.         pp=strchr(p1,':'); if(pp==NULL) continue;
  137.         *pp++=0;
  138.         strip_trailing_spaces(p1); strip_trailing_spaces(pp);
  139.         singlespace(p1);
  140.         p1=find_word_start(p1); pp=find_word_start(pp);
  141.         if(*p1==0) continue;
  142.         if(has_digits==0) {
  143.             char *p;
  144.             for(p=p1;*p!=0 && p<pp && !isdigit(*p);p++);
  145.             if(isdigit(*p)) has_digits=1;
  146.         }
  147.         entry[i].original=(unsigned char*)p1;
  148.         entry[i].replace=(unsigned char*)pp;
  149.         entry[i].olen=l=strlen(p1); entry[i].earlier=-1;
  150.         if(i>0) {
  151.             int l1,l2;
  152.             l1=entry[i-1].earlier; if(l1>=0) l2=entry[l1].olen;
  153.             else {l2=entry[i-1].olen;l1=i-1;}
  154.             if(l>l2 && isspace(p1[l2])
  155.                && strncmp((char*)entry[l1].original,p1,l2)==0)
  156.               entry[i].earlier=entry[i-1].earlier=l1;
  157.         }
  158.         i++;
  159.     }
  160.     entrycount=i;
  161. }
  162.  
  163.         /* now make the translation. */
  164. void translate(char *p)
  165. {
  166.     char *p1, *p2, *pp;
  167.     int t;
  168.  
  169.     if(entrycount<=0 && suffixcnt<=0) return;
  170.     snprintf(outbuf,sizeof(outbuf),"%s",p);
  171.     for(p1=find_word_start(outbuf);
  172.         p1!=NULL && p1-outbuf<MAX_LINELEN && *p1!=0;
  173.         p1=p2) {
  174.         p2=find_word_end(p1);
  175.         for(pp=p1;pp<p2 &&
  176.             ((!has_digits && isalpha(*pp)) ||
  177.              (has_digits && isalnum(*pp)) || (*pp&128)!=0 ||
  178.              strchr("_",*pp)!=NULL);pp++);
  179.         p2=find_word_start(p2);
  180.         if(pp==p1 ||
  181.            (has_digits==0 && isdigit(*pp)) ||
  182.            (*pp!=0 && !isspace(*pp) && strchr(",.?!/;",*pp)==NULL)) continue;
  183.         t=search_list(entry,entrycount,sizeof(entry[0]),p1);
  184.         if(t<0) {
  185.             switch(unknown_type) {
  186.                 case unk_leave: break;
  187.                 case unk_delete: {
  188.                     ovlstrcpy(p1,find_word_start(pp)); p2=p1;
  189.                     break;
  190.                 }
  191.                 case unk_replace: {
  192.                     string_modify(outbuf,p1,pp,unkbuf);
  193.                     p2=find_word_start(p1+strlen(unkbuf));
  194.                 }
  195.             }
  196.             continue;
  197.         }
  198.         string_modify(outbuf,p1,p1+strlen((char*)entry[t].original),
  199.                       (char*)entry[t].replace);
  200.         p2=find_word_start(p1+strlen((char*)entry[t].replace));
  201.     }
  202.     snprintf(p,MAX_LINELEN,"%s",outbuf);
  203. }
  204.  
  205.