Subversion Repositories Applications.dictionnaire

Compare Revisions

Ignore whitespace Rev 8 → Rev 9

/scripts/helpers.js
New file
0,0 → 1,116
// cache les association "mot dans le texte" => "mot du dictionnaire"
// obtenues à l'aide de levenshtein() et texte_to_mot()
var assoc_mot_clef = new Array();
 
function texte_to_mot(mot) {
if(assoc_mot_clef[mot]) return assoc_mot_clef[mot];
 
var proche = '';
var lev = 99;
$.each(motsAyantDefinition, function(i, item) {
x = levenshtein(mot, item);
if(x < lev) { lev = x; proche = item; }
});
assoc_mot_clef[mot] = proche;
return proche;
}
 
// http://stackoverflow.com/questions/1960473/unique-values-in-an-array
function getUnique(tableau) {
var u = {}, a = [];
for(var i = 0, l = tableau.length; i < l; ++i){
if(u.hasOwnProperty(tableau[i])) {
continue;
}
a.push(tableau[i]);
u[tableau[i]] = 1;
}
return a;
}
 
// http://stackoverflow.com/questions/281264/remove-empty-elements-from-an-array-in-javascript
function clean(tableau, deleteValue) {
for (var i = 0; i < tableau.length; i++) {
if (tableau[i] == deleteValue) {
tableau.splice(i, 1);
i--;
}
}
return tableau;
}
 
function trim(myString) {
return myString.replace(/^\s+/g,'').replace(/\s+$/g,'')
}
 
function levenshtein (s1, s2) {
// http://kevin.vanzonneveld.net
// + original by: Carlos R. L. Rodrigues (http://www.jsfromhell.com)
// + bugfixed by: Onno Marsman
// + revised by: Andrea Giammarchi (http://webreflection.blogspot.com)
// + reimplemented by: Brett Zamir (http://brett-zamir.me)
// + reimplemented by: Alexander M Beedie
// * example 1: levenshtein('Kevin van Zonneveld', 'Kevin van Sommeveld');
// * returns 1: 3
if (s1 == s2) {
return 0;
}
 
var s1_len = s1.length;
var s2_len = s2.length;
if (s1_len === 0) {
return s2_len;
}
if (s2_len === 0) {
return s1_len;
}
 
// BEGIN STATIC
var split = false;
try {
split = !('0')[0];
} catch (e) {
split = true; // Earlier IE may not support access by string index
}
// END STATIC
if (split) {
s1 = s1.split('');
s2 = s2.split('');
}
 
var v0 = new Array(s1_len + 1);
var v1 = new Array(s1_len + 1);
 
var s1_idx = 0,
s2_idx = 0,
cost = 0;
for (s1_idx = 0; s1_idx < s1_len + 1; s1_idx++) {
v0[s1_idx] = s1_idx;
}
var char_s1 = '',
char_s2 = '';
for (s2_idx = 1; s2_idx <= s2_len; s2_idx++) {
v1[0] = s2_idx;
char_s2 = s2[s2_idx - 1];
 
for (s1_idx = 0; s1_idx < s1_len; s1_idx++) {
char_s1 = s1[s1_idx];
cost = (char_s1 == char_s2) ? 0 : 1;
var m_min = v0[s1_idx + 1] + 1;
var b = v1[s1_idx] + 1;
var c = v0[s1_idx] + cost;
if (b < m_min) {
m_min = b;
}
if (c < m_min) {
m_min = c;
}
v1[s1_idx + 1] = m_min;
}
var v_tmp = v0;
v0 = v1;
v1 = v_tmp;
}
return v0[s1_len];
}