Blame view
tools/lia_ltbox/lia_phon/src/libgram/libgram.c.old
12.6 KB
e6be5137b
|
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 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 |
/* Usefule things for the 'gram' module */ /* FRED 0498 - Modif multi ML - 0399 */ /*................................................................*/ #include <libgram.h> /*................................................................*/ /* Declaration de la table de ML */ ty_ml Table_ML[NB_MAX_ML]; /* Nombre de ML present en memoire */ int NB_ML=0; /*................................................................*/ /* Allocation d'un nouveau ML */ ty_ml cons_ml(long nb1,long nb2,long nb3,int si_hash,int si_2g,int si_log10) { ty_ml pt; pt=(ty_ml)malloc(sizeof(struct type_ml)); pt->pmc=NULL; pt->lexique=NULL; pt->NB1GRAM=nb1; pt->NB2GRAM=nb2; pt->NB3GRAM=nb3; pt->GRAM_SI_HASH=si_hash; pt->GRAM_SI_2G=si_2g; pt->GRAM_LOG10=si_log10; pt->TABL1GRAM=(type_1gram*)malloc(sizeof(type_1gram)*(pt->NB1GRAM+MARGE)); if (pt->TABL1GRAM==NULL) return NULL; pt->TABL2GRAM=(type_2gram*)malloc(sizeof(type_2gram)*(pt->NB2GRAM+MARGE)); if (pt->TABL2GRAM==NULL) return NULL; if (si_2g==0) { pt->TABL3GRAM=(type_3gram*)malloc(sizeof(type_3gram)*(pt->NB3GRAM+MARGE)); if (pt->TABL3GRAM==NULL) return NULL; } else pt->TABL3GRAM=NULL; return pt; } /*................................................................*/ /* Egalite */ int H1compar(void *a ,void *b ) { int n; type_1gram *i,*j; i=(type_1gram *)a; j=(type_1gram *)b; for(n=Nb1Byte-1;n>=0;n--) { if (i->cle[n]>j->cle[n]) return 1; if (i->cle[n]<j->cle[n]) return -1; } return 0; } int H2compar(void *a ,void *b ) { int n; type_2gram *i,*j; i=(type_2gram *)a; j=(type_2gram *)b; for(n=Nb2Byte-1;n>=0;n--) { if (i->cle[n]>j->cle[n]) return 1; if (i->cle[n]<j->cle[n]) return -1; } return 0; } int H3compar(void *a ,void *b ) { int n; type_3gram *i,*j; i=(type_3gram *)a; j=(type_3gram *)b; for(n=Nb3Byte-1;n>=0;n--) { if (i->cle[n]>j->cle[n]) return 1; if (i->cle[n]<j->cle[n]) return -1; } return 0; } int SiEgal1(wrd_index_t i_mot ,long indice ,ty_ml pt_ml) { return (pt_ml->TABL1GRAM[indice].cle[0]==BYTE1(i_mot)) && (pt_ml->TABL1GRAM[indice].cle[1]==BYTE2(i_mot)) && (pt_ml->TABL1GRAM[indice].cle[2]==BYTE3(i_mot))?1:0; } int SiEgal2(wrd_index_t i_mot1 ,wrd_index_t i_mot2 ,long indice ,ty_ml pt_ml) { return (pt_ml->TABL2GRAM[indice].cle[0]==BYTE1(i_mot1)) && (pt_ml->TABL2GRAM[indice].cle[1]==BYTE2(i_mot1)) && (pt_ml->TABL2GRAM[indice].cle[2]==BYTE3(i_mot1)) && (pt_ml->TABL2GRAM[indice].cle[3]==BYTE1(i_mot2)) && (pt_ml->TABL2GRAM[indice].cle[4]==BYTE2(i_mot2)) && (pt_ml->TABL2GRAM[indice].cle[5]==BYTE3(i_mot2))?1:0; } int SiEgal3(wrd_index_t i_mot1 ,wrd_index_t i_mot2 ,wrd_index_t i_mot3 ,long indice ,ty_ml pt_ml) { return (pt_ml->TABL3GRAM[indice].cle[0]==BYTE1(i_mot1)) && (pt_ml->TABL3GRAM[indice].cle[1]==BYTE2(i_mot1)) && (pt_ml->TABL3GRAM[indice].cle[2]==BYTE3(i_mot1)) && (pt_ml->TABL3GRAM[indice].cle[3]==BYTE1(i_mot2)) && (pt_ml->TABL3GRAM[indice].cle[4]==BYTE2(i_mot2)) && (pt_ml->TABL3GRAM[indice].cle[5]==BYTE3(i_mot2)) && (pt_ml->TABL3GRAM[indice].cle[6]==BYTE1(i_mot3)) && (pt_ml->TABL3GRAM[indice].cle[7]==BYTE2(i_mot3)) && (pt_ml->TABL3GRAM[indice].cle[8]==BYTE3(i_mot3))?1:0; } /*................................................................*/ /* Gestion des 1.2.3-gram au format arpa */ /* FRED 0398 - Modif multi ML - 0399 */ /*................................................................*/ /* Lecture */ err_t gram_module_init(char *chfich ,int *num_ml, int n_gram , const err_t trace) { FILE *file; long nb1,nb2,nb3,nb4; int si_hash,si_log10; char ch[100]; if ((n_gram!=2)&&(n_gram!=3)) { fprintf(stderr,"Sorry, you can load only 2GRAM or 3GRAM models !! "); return SIR_RANGE_ERR; } *num_ml=NB_ML++; if (*num_ml>=NB_MAX_ML) return SIR_RANGE_ERR; if (trace & SIR_GRAM_TRACE) fprintf(stderr,"Loading of the n-gram model : number %d ",*num_ml); sprintf(ch,"%s.desc",chfich); if (!(file=fopen(ch,"r"))) return SIR_READ_OPEN_ERR; fgets(ch,100,file); sscanf(ch,"%ld %ld %ld",&nb1,&nb2,&nb3); fgets(ch,100,file); if (!strncmp(ch,"HASH",4)) si_hash=1; else si_hash=0; fgets(ch,100,file); if (trace & SIR_GRAM_TRACE) if (!strncmp(ch,"LOG_10",6)) { si_log10=1; fprintf(stderr,"The logprob of the model are : LOG 10 "); } else { si_log10=0; fprintf(stderr,"The logprob of the model are : LOG e "); } fgets(ch,100,file); if (!strncmp(ch,"TRIGRAMME",9)) { if (n_gram==2) { if (trace & SIR_GRAM_TRACE) fprintf(stderr,"3GRAM model loaded as a 2GRAM "); } else { if (trace & SIR_GRAM_TRACE) fprintf(stderr,"3GRAM model "); } } else { if (n_gram==3) { fprintf(stderr,"Sorry, you can't load a 2GRAM model as a 3GRAM model !!!! "); return SIR_RANGE_ERR; } if (trace & SIR_GRAM_TRACE) fprintf(stderr,"2GRAM model "); } fclose(file); Table_ML[*num_ml]=cons_ml(nb1,nb2,nb3,si_hash,n_gram==2?1:0,si_log10); if (Table_ML[*num_ml]==NULL) return SIR_ALLOC_ERR; sprintf(ch,"%s.1g",chfich); if (!(file=fopen(ch,"rb"))) return SIR_READ_OPEN_ERR; if (!(fread(Table_ML[*num_ml]->TABL1GRAM,sizeof(type_1gram)*(nb1+MARGE),1,file))) return SIR_READ_ERR; fclose(file); sprintf(ch,"%s.2g",chfich); if (!(file=fopen(ch,"rb"))) return SIR_READ_OPEN_ERR; if (!(fread(Table_ML[*num_ml]->TABL2GRAM,sizeof(type_2gram)*(nb2+MARGE),1,file))) return SIR_READ_ERR; fclose(file); if (n_gram==3) { sprintf(ch,"%s.3g",chfich); if (!(file=fopen(ch,"rb"))) SIR_READ_OPEN_ERR; if (!(fread(Table_ML[*num_ml]->TABL3GRAM,sizeof(type_3gram)*(nb3+MARGE),1,file))) return SIR_READ_ERR; fclose(file); } return(CORRECT); } err_t gram_module_reset(const int num_ml,const err_t trace) { if (trace & SIR_GRAM_TRACE) fprintf(stderr,"Deletion of the n-gram model : number %d ",num_ml); if ((num_ml>NB_ML)||(Table_ML[num_ml]==NULL)) return SIR_FATAL_ERR; free(Table_ML[num_ml]->TABL1GRAM); free(Table_ML[num_ml]->TABL2GRAM); if (Table_ML[num_ml]->GRAM_SI_2G==0) free(Table_ML[num_ml]->TABL3GRAM); if (Table_ML[num_ml]->lexique) delete_lexique(Table_ML[num_ml]->lexique); return(CORRECT); } /*................................................................*/ /* Recherche des NGrams par HashCode */ int HashRecherche1Gram(wrd_index_t i_mot ,flogprob_t *lp ,flogprob_t *fr ,ty_ml pt_ml) { wrd_index_t essai,indice,valh1,valh2; if (i_mot<0) return 0; indice=valh1=H1Value(i_mot,pt_ml); valh2=Double1H(i_mot,pt_ml); for (essai=1;(essai<=pt_ml->NB1GRAM)&&(Case1Vide(indice,pt_ml)==0)&& (!SiEgal1(i_mot,indice,pt_ml));essai++) indice=EssaiSuivant(valh1,valh2,essai,pt_ml->NB1GRAM); if ((essai<=pt_ml->NB1GRAM)&&(Case1Vide(indice,pt_ml)==0)) { *lp=pt_ml->TABL1GRAM[indice].lp; *fr=pt_ml->TABL1GRAM[indice].fr; return 1; } return 0; } int HashRecherche2Gram(wrd_index_t i_mot1 ,wrd_index_t i_mot2 ,flogprob_t *lp ,flogprob_t *fr ,ty_ml pt_ml) { wrd_index_t essai,indice,valh1,valh2; if ((i_mot1<0)||(i_mot2<0)) return 0; indice=valh1=H2Value(i_mot1,i_mot2,pt_ml); valh2=Double2H(i_mot1,i_mot2,pt_ml); for (essai=1;(essai<=pt_ml->NB2GRAM)&&(Case2Vide(indice,pt_ml)==0)&& (!SiEgal2(i_mot1,i_mot2,indice,pt_ml));essai++) indice=EssaiSuivant(valh1,valh2,essai,pt_ml->NB2GRAM); if ((essai<=pt_ml->NB2GRAM)&&(Case2Vide(indice,pt_ml)==0)) { *lp=pt_ml->TABL2GRAM[indice].lp; *fr=pt_ml->TABL2GRAM[indice].fr; return 1; } return 0; } int HashRecherche3Gram(wrd_index_t i_mot1 ,wrd_index_t i_mot2 ,wrd_index_t i_mot3 ,flogprob_t *lp ,ty_ml pt_ml) { wrd_index_t essai,indice,valh1,valh2; if ((i_mot1<0)||(i_mot2<0)||(i_mot3<0)) return 0; indice=valh1=H3Value(i_mot1,i_mot2,i_mot3,pt_ml); valh2=Double3H(i_mot1,i_mot2,i_mot3,pt_ml); for (essai=1;(essai<=pt_ml->NB3GRAM)&&(Case3Vide(indice,pt_ml)==0)&& (!SiEgal3(i_mot1,i_mot2,i_mot3,indice,pt_ml));essai++) indice=EssaiSuivant(valh1,valh2,essai,pt_ml->NB3GRAM); if ((essai<=pt_ml->NB3GRAM)&&(Case3Vide(indice,pt_ml)==0)) { *lp=pt_ml->TABL3GRAM[indice].lp; return 1; } return 0; } /*................................................................*/ /* Recherche des NGrams par dichotomie */ int DichoRecherche1Gram(wrd_index_t i_mot , flogprob_t *lp ,flogprob_t *fr ,ty_ml pt_ml) { type_1gram *resu,key; key.cle[0]=BYTE1(i_mot); key.cle[1]=BYTE2(i_mot); key.cle[2]=BYTE3(i_mot); resu=(type_1gram*)bsearch((void*)(&key),pt_ml->TABL1GRAM,pt_ml->NB1GRAM+MARGE, sizeof(type_1gram),H1compar); if (resu==NULL) return 0; *lp=resu->lp; *fr=resu->fr; return 1; } int DichoRecherche2Gram(wrd_index_t i_mot1 ,wrd_index_t i_mot2 ,flogprob_t *lp ,flogprob_t *fr ,ty_ml pt_ml) { type_2gram *resu,key; key.cle[0]=BYTE1(i_mot1); key.cle[1]=BYTE2(i_mot1); key.cle[2]=BYTE3(i_mot1); key.cle[3]=BYTE1(i_mot2); key.cle[4]=BYTE2(i_mot2); key.cle[5]=BYTE3(i_mot2); resu=(type_2gram*)bsearch((void*)(&key),pt_ml->TABL2GRAM, pt_ml->NB2GRAM+MARGE,sizeof(type_2gram),H2compar); if (resu==NULL) return 0; *lp=resu->lp; *fr=resu->fr; return 1; } int DichoRecherche3Gram(wrd_index_t i_mot1 ,wrd_index_t i_mot2 ,wrd_index_t i_mot3 ,flogprob_t *lp ,ty_ml pt_ml) { type_3gram *resu,key; key.cle[0]=BYTE1(i_mot1); key.cle[1]=BYTE2(i_mot1); key.cle[2]=BYTE3(i_mot1); key.cle[3]=BYTE1(i_mot2); key.cle[4]=BYTE2(i_mot2); key.cle[5]=BYTE3(i_mot2); key.cle[6]=BYTE1(i_mot3); key.cle[7]=BYTE2(i_mot3); key.cle[8]=BYTE3(i_mot3); resu=(type_3gram*)bsearch((void*)(&key),pt_ml->TABL3GRAM, pt_ml->NB3GRAM+MARGE,sizeof(type_3gram),H3compar); if (resu==NULL) return 0; *lp=resu->lp; return 1; } /*................................................................*/ /* Fonctions de recherche generiques */ int Recherche1Gram(wrd_index_t i_mot , flogprob_t *lp ,flogprob_t *fr ,ty_ml pt_ml) { if (pt_ml->GRAM_SI_HASH) return HashRecherche1Gram(i_mot,lp,fr,pt_ml); else return DichoRecherche1Gram(i_mot,lp,fr,pt_ml); } int Recherche2Gram(wrd_index_t i_mot1 ,wrd_index_t i_mot2 ,flogprob_t *lp ,flogprob_t *fr ,ty_ml pt_ml) { if (pt_ml->GRAM_SI_HASH) return HashRecherche2Gram(i_mot1,i_mot2,lp,fr,pt_ml); else return DichoRecherche2Gram(i_mot1,i_mot2,lp,fr,pt_ml); } int Recherche3Gram(wrd_index_t i_mot1 ,wrd_index_t i_mot2 ,wrd_index_t i_mot3 ,flogprob_t *lp ,ty_ml pt_ml) { if (pt_ml->GRAM_SI_HASH) return HashRecherche3Gram(i_mot1,i_mot2,i_mot3,lp,pt_ml); else return DichoRecherche3Gram(i_mot1,i_mot2,i_mot3,lp,pt_ml); } /*................................................................*/ /* Fonction renvoyant la proba d'un 3-gram selon la formule : p(wd3|wd1,wd2)= if(trigram exists) p_3(wd1,wd2,wd3) else if(bigram w1,w2 exists) bo_wt_2(w1,w2)*p(wd3|wd2) else p(wd3|w2) p(wd2|wd1)= if(bigram exists) p_2(wd1,wd2) else bo_wt_1(wd1)*p_1(wd2) */ err_t gram_proba_to_bigram(logprob_t *proba,const wrd_index_t wrd1, const wrd_index_t wrd2,const int num_ml, const err_t trace) { flogprob_t lp,fr,lp1,fr1,lp2,fr2; if ((num_ml>NB_ML)||(Table_ML[num_ml]==NULL)) { fprintf(stderr,"Le ML numero:%d n'existe pas .... NB_ML=%d ",num_ml,NB_ML); exit(0); } if (trace & SIR_GRAM_TRACE) fprintf(stderr,"GRAM : P(%d,%d) ",wrd1,wrd2); if (Recherche2Gram(wrd1,wrd2,&lp,&fr,Table_ML[num_ml])) { if (trace & SIR_GRAM_TRACE) { fprintf(stderr,"J'ai trouve le bigramme : %ld %ld ",wrd1,wrd2); fprintf(stderr," avec : lp=%f et fr=%f ",lp,fr); } *proba=(logprob_t)lp; return CORRECT; } else { if (trace & SIR_GRAM_TRACE) fprintf(stderr,"Je n'ai pas trouve le bigramme : %ld %ld ",wrd1,wrd2); if (!Recherche1Gram(wrd1,&lp1,&fr1,Table_ML[num_ml])) { if (trace & SIR_GRAM_TRACE) fprintf(stderr,"(hash) je ne trouve pas : %d ",wrd1); return GRAM_CODE_UNKNOWN; } if (!Recherche1Gram(wrd2,&lp2,&fr2,Table_ML[num_ml])) { if (trace & SIR_GRAM_TRACE) fprintf(stderr,"(hash) je ne trouve pas : %d ",wrd2); return GRAM_CODE_UNKNOWN; } if (trace & SIR_GRAM_TRACE) fprintf(stderr,"Backoff sur l'unigramme avec : P(%ld)=%f et FR(%ld)=%f d'ou lp=%f ", wrd2,lp2,wrd1,fr1,fr1+lp2); *proba=(logprob_t)(fr1+lp2); return CORRECT; } } err_t gram_proba_to_trigram(logprob_t *proba,const wrd_index_t wrd1,const wrd_index_t wrd2, const wrd_index_t wrd3,const int num_ml,const err_t trace) { flogprob_t lp,fr,lp1,fr1,fr2; logprob_t lp2; err_t reto; if ((num_ml>NB_ML)||(Table_ML[num_ml]==NULL)) { fprintf(stderr,"Le ML numero:%d n'existe pas .... NB_ML=%d ",num_ml,NB_ML); exit(0); } if (Table_ML[num_ml]->GRAM_SI_2G==1) return SIR_FATAL_ERR; if (trace & SIR_GRAM_TRACE) fprintf(stderr,"GRAM : P(%d,%d,%d) ",wrd1,wrd2,wrd3); if (Recherche3Gram(wrd1,wrd2,wrd3,&lp,Table_ML[num_ml])) { *proba=(logprob_t)lp; return CORRECT; } else { if (!Recherche2Gram(wrd1,wrd2,&lp1,&fr1,Table_ML[num_ml])) { if (trace & SIR_GRAM_TRACE) fprintf(stderr,"(hash) je ne trouve pas : %d %d ",wrd1,wrd2); fr1=0; } reto=gram_proba_to_bigram(&lp2,wrd2,wrd3,num_ml,trace); if (reto!=CORRECT) return reto; *proba=(logprob_t)fr1+lp2; return CORRECT; } } /*................................................................*/ |