-
Notifications
You must be signed in to change notification settings - Fork 0
/
simterms.inc.php
executable file
·151 lines (133 loc) · 5.56 KB
/
simterms.inc.php
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
<?php
/**************************************************************
"Learning with Texts" (LWT) is free and unencumbered software
released into the PUBLIC DOMAIN.
Anyone is free to copy, modify, publish, use, compile, sell, or
distribute this software, either in source code form or as a
compiled binary, for any purpose, commercial or non-commercial,
and by any means.
In jurisdictions that recognize copyright laws, the author or
authors of this software dedicate any and all copyright
interest in the software to the public domain. We make this
dedication for the benefit of the public at large and to the
detriment of our heirs and successors. We intend this
dedication to be an overt act of relinquishment in perpetuity
of all present and future rights to this software under
copyright law.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE
WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE
AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS BE LIABLE
FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
For more information, please refer to [http://unlicense.org/].
***************************************************************/
/**************************************************************
PHP Utility Functions to calculate similar terms of a term
***************************************************************/
// -------------------------------------------------------------
function letterPairs($str) {
$numPairs = mb_strlen($str) - 1;
$pairs = array();
for ($i = 0; $i < $numPairs; $i ++) {
$pairs[$i] = mb_substr($str, $i, 2);
}
return $pairs;
}
function wordLetterPairs($str) {
$allPairs = array();
$words = explode(' ', $str);
for ($w = 0; $w < count($words); $w ++) {
$pairsInWord = letterPairs($words[$w]);
for ($p = 0; $p < count($pairsInWord); $p ++) {
$allPairs[$pairsInWord[$p]] = $pairsInWord[$p];
}
}
return array_values($allPairs);
}
function getSimilarityRanking($str1, $str2) {
// Returns SimilarityRanking of two UTF-8 strings $str1 and $str2
// Source http://www.catalysoft.com/articles/StrikeAMatch.html
// Source http://stackoverflow.com/questions/653157
$pairs1 = wordLetterPairs($str1);
$pairs2 = wordLetterPairs($str2);
$union = count($pairs1) + count($pairs2);
if ($union == 0) return 0;
$intersection = count(array_intersect($pairs1, $pairs2));
return (2.0 * $intersection) / $union;
}
// -------------------------------------------------------------
function get_similar_terms($lang_id, $compared_term, $max_count,
$min_ranking) {
// For a language $lang_id and a term $compared_term (UTF-8),
// return an array with $max_count wordids with a similarity ranking
// > $min_ranking, sorted decending.
// If string is already in database, it will be excluded in results.
global $tbpref;
$compared_term_lc = mb_strtolower($compared_term, 'UTF-8');
$sql = "select WoID, WoTextLC from " . $tbpref . "words where WoLgID = " . $lang_id . " AND WoTextLC <> " . convert_string_to_sqlsyntax($compared_term_lc);
$res = do_mysql_query($sql);
$termlsd = array();
while ($record = mysql_fetch_assoc($res)) {
$termlsd[$record["WoID"]] = getSimilarityRanking($compared_term_lc, $record["WoTextLC"]);
}
mysql_free_result($res);
arsort($termlsd, SORT_NUMERIC);
$r = array();
$i = 0;
foreach ($termlsd as $key => $val) {
if ($i >= $max_count) break;
if ($val < $min_ranking) break;
$i++;
$r[$i] = $key;
}
return $r;
}
// -------------------------------------------------------------
function print_similar_terms($lang_id, $compared_term) {
// Get Term and translation of terms in termid array (calculated
// in function get_similar_terms(...)) as string for echo
global $tbpref;
$max_count = (int)getSettingWithDefault("set-similar-terms-count");
if ($max_count <= 0) return '';
if (trim($compared_term) == '') return ' ';
$compare = tohtml($compared_term);
$termarr = get_similar_terms($lang_id, $compared_term, $max_count, 0.33);
$rarr = array();
foreach ($termarr as $termid) {
$sql = "select WoText, WoTranslation, WoRomanization from " . $tbpref . "words where WoID = " . $termid;
$res = do_mysql_query($sql);
if ($record = mysql_fetch_assoc($res)) {
$term = tohtml($record["WoText"]);
if (stripos($compare, $term) !== FALSE)
$term = '<span class="red3">' . $term . '</span>';
else
$term = str_replace($compare, '<span class="red3"><u>' . $compare . '</u></span>', $term);
$tra = $record["WoTranslation"];
if ($tra == "*") $tra = "???";
if (trim($record["WoRomanization"]) !== '') {
$romd = " [" . $record["WoRomanization"] . "]";
$rom = $record["WoRomanization"];
}
else {
$romd = "";
$rom = "";
}
$rarr[] = '<img class="clickedit" src="icn/tick-button-small.png" title="Copy → Translation & Romanization Field(s)" onclick="setTransRoman(' . prepare_textdata_js($tra) . ',' . prepare_textdata_js($rom) . ');" /> ' . $term . tohtml($romd) . ' — ' . tohtml($tra) . '<br />';
}
mysql_free_result($res);
}
if(count($rarr) == 0)
return "(none)";
else
return implode($rarr);
}
// -------------------------------------------------------------
function print_similar_terms_tabrow() {
if ((int)getSettingWithDefault("set-similar-terms-count") > 0)
echo '<tr><td class="td1 right">Similar<br />Terms:</td><td class="td1"><span id="simwords" class="smaller"> </span></td></tr>';
}
// -------------------------------------------------------------
?>