File: en-miss-cand.cpp

package info (click to toggle)
gcin 2.8.8%2Bdfsg1-1
  • links: PTS, VCS
  • area: main
  • in suites: buster
  • size: 22,672 kB
  • sloc: cpp: 33,774; ansic: 9,313; makefile: 652; sh: 558
file content (160 lines) | stat: -rwxr-xr-x 3,121 bytes parent folder | download | duplicates (3)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "gcin.h"
#include "pho.h"
#include "tsin.h"

#define MIN3(a, b, c) ((a) < (b) ? ((a) < (c) ? (a) : (c)) : ((b) < (c) ? (b) : (c)))

static inline int edit_dist(char *s1, int s1len, char *s2, int s2len) {
    unsigned int x, y;
    unsigned int matrix[128][128];
    matrix[0][0] = 0;
    for (x = 1; x <= s2len; x++)
        matrix[x][0] = matrix[x-1][0] + 1;
    for (y = 1; y <= s1len; y++)
        matrix[0][y] = matrix[0][y-1] + 1;
    for (x = 1; x <= s2len; x++)
        for (y = 1; y <= s1len; y++)
            matrix[x][y] = MIN3(matrix[x-1][y] + 1, matrix[x][y-1] + 1, matrix[x-1][y-1] + (s1[y-1] == s2[x-1] ? 0 : 1));

    return(matrix[s2len][s1len]);
}


#define MaxCand 10
void get_en_miss_cand(FILE *fp, char *s, int slen, char best[][MAX_PHRASE_LEN]) {
#define phsz 1
  dbg("get_en_miss_cand %s", s);

  fseek(fp, sizeof(TSIN_GTAB_HEAD), SEEK_SET);

#define MCOST  0x3f00000

  int bestd[MaxCand];
  int midx=0;

  int i;
  for(i=0;i<MaxCand;i++) {
    best[i][0]=0;
    bestd[i]=MCOST;
  }

  int is_lower=s[0]>='a' && s[0]<='z';
  int is_upper=s[0]>='A' && s[0]<='Z';

  while (!feof(fp)) {
    char ln[512];
    signed char clen;
    if (fread(&clen,1,1,fp) <= 0)
      break;

    if (!clen) {
	  dbg("!clen");
      break;
    }

    gboolean en_has_str = FALSE, is_deleted=FALSE;
    usecount_t usecount;

    if (clen < 0) {
      clen = - clen;
      en_has_str = TRUE;
    }

    if (fread(&usecount, sizeof(usecount_t), 1, fp) <=0) {
      dbg("usecount_t");
      break;
    }

    if (usecount < 0) {
      is_deleted = TRUE;
    }

    ln[0]=0;
    if (fread(ln, phsz, clen, fp) < 0) {
       break;
    }
     ln[clen]=0;
//        dbg("%s %d\n", phbuf8, usecount);


    char tt[128];
    tt[0]=0;
    if (en_has_str) {
      int ttlen=0;
      tt[0]=0;

      for(i=0;i<clen;i++) {
        char ch[CH_SZ];
        int n = fread(ch, 1, 1, fp);
        if (n<=0) {
		  dbg("n<=0 a\n");
          break;
        }
        int len=utf8_sz(ch);
        if (len > 1) {
		  if (fread(&ch[1], 1, len-1, fp)<=0) {
			dbg("n<=0 b\n");
			break;
		  }
        }
        memcpy(tt+ttlen, ch, len);
        ttlen+=len;
      }

      tt[ttlen]=0;
      if (!tt[0])
        continue;
    }


   if (en_has_str || is_deleted || clen >= MAX_PHRASE_LEN)
     continue;

//   dbg("- %s\n", ln);

    int len=strlen(ln);
    if (len < slen - 5)
      continue;

#define SHIFT 16

	if (is_upper) {
      if (ln[0]>='a' && ln[0]<='z') {
        ln[0]-=0x20;
      }
	}

	int cost;
    int d = edit_dist(s, slen, ln, len);
    if (d>=slen*2)
      continue;
    cost = d<<SHIFT;

    if (is_lower) {
      if (ln[0]>='A' && ln[0]<='Z') {
        ln[0]+=0x20;
        int ncost = (edit_dist(s, slen, ln, len) << SHIFT) + 0x100;
        ln[0]-=0x20;
        if (cost > ncost)
          cost = ncost;
      }
    }
    
    cost -= usecount;

    
    if (cost >= bestd[midx])
    	continue;

    strcpy(best[midx], ln);
    bestd[midx]=cost;

    midx = 0;
    for(int i =1;i<MaxCand;i++)
      if (bestd[midx]<bestd[i])
         midx = i;
  }
}