turbo_split.php 24 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565
  1. <?php
  2. require_once '../public/casesuf.inc';
  3. //require_once '../studio/dict_find_un.inc';
  4. //require_once '../studio/sandhi.php';
  5. require_once "../path.php";
  6. require_once "../public/_pdo.php";
  7. require_once "../redis/function.php";
  8. global $redis;
  9. $redis = redis_connect();
  10. // open word part db
  11. global $dbh;
  12. $dns = "" . _FILE_DB_PART_;
  13. $dbh = new PDO($dns, "", "", array(PDO::ATTR_PERSISTENT => true));
  14. $dbh->setAttribute(PDO::ATTR_ERRMODE, PDO::ERRMODE_WARNING);
  15. global $path;
  16. global $confidence;
  17. global $result;
  18. global $part;
  19. define("MAX_RESULT",100);
  20. $part = array();
  21. $path[] = array("", 0);
  22. $path[] = array("", 0);
  23. $path[] = array("", 0);
  24. $path[] = array("", 0);
  25. $path[] = array("", 0);
  26. $path[] = array("", 0);
  27. $path[] = array("", 0);
  28. $path[] = array("", 0);
  29. $path[] = array("", 0);
  30. $path[] = array("", 0);
  31. $path[] = array("", 0);
  32. $path[] = array("", 0);
  33. $path[] = array("", 0);
  34. $path[] = array("", 0);
  35. $path[] = array("", 0);
  36. $path[] = array("", 0);
  37. $path[] = array("", 0);
  38. global $sandhi;
  39. //sandhi rules table 语尾表
  40. $sandhi[] = array("a" => "", "b" => "", "c" => "", "len" => 0, "adj_len" => 0, "advance" => false,"cf"=>1.0);
  41. $sandhi[] = array("a" => "a", "b" => "a", "c" => "ā", "len" => 1, "adj_len" => 0, "advance" => false,"cf"=>0.99999);
  42. $sandhi[] = array("a" => "ā", "b" => "ā", "c" => "ā", "len" => 1, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  43. $sandhi[] = array("a" => "a", "b" => "ā", "c" => "ā", "len" => 1, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  44. $sandhi[] = array("a" => "ā", "b" => "a", "c" => "ā", "len" => 1, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  45. $sandhi[] = array("a" => "a", "b" => "e", "c" => "e", "len" => 1, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  46. $sandhi[] = array("a" => "a", "b" => "i", "c" => "i", "len" => 1, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  47. $sandhi[] = array("a" => "a", "b" => "o", "c" => "o", "len" => 1, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  48. $sandhi[] = array("a" => "a", "b" => "u", "c" => "o", "len" => 1, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  49. $sandhi[] = array("a" => "u", "b" => "a", "c" => "o", "len" => 1, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  50. $sandhi[] = array("a" => "u", "b" => "u", "c" => "ū", "len" => 1, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  51. $sandhi[] = array("a" => "a", "b" => "u", "c" => "u", "len" => 1, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  52. $sandhi[] = array("a" => "a", "b" => "ī", "c" => "ī", "len" => 1, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  53. $sandhi[] = array("a" => "a", "b" => "ū", "c" => "ū", "len" => 1, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  54. $sandhi[] = array("a" => "a", "b" => "i", "c" => "e", "len" => 1, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  55. $sandhi[] = array("a" => "e", "b" => "a", "c" => "e", "len" => 1, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  56. $sandhi[] = array("a" => "i", "b" => "i", "c" => "ī", "len" => 1, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  57. $sandhi[] = array("a" => "i", "b" => "e", "c" => "e", "len" => 1, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  58. $sandhi[] = array("a" => "i", "b" => "a", "c" => "ya", "len" => 2, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  59. $sandhi[] = array("a" => "a", "b" => "atth", "c" => "atth", "len" => 4, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  60. $sandhi[] = array("a" => "taṃ", "b" => "n", "c" => "tann", "len" => 4, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  61. $sandhi[] = array("a" => "[ṃ]", "b" => "api", "c" => "mpi", "len" => 3, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  62. $sandhi[] = array("a" => "[ṃ]", "b" => "eva", "c" => "meva", "len" => 4, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  63. $sandhi[] = array("a" => "[o]", "b" => "iva", "c" => "ova", "len" => 3, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  64. $sandhi[] = array("a" => "o", "b" => "a", "c" => "o", "len" => 1, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  65. $sandhi[] = array("a" => "a", "b" => "ādi", "c" => "ādi", "len" => 3, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  66. $sandhi[] = array("a" => "a[ānaṃ]", "b" => "a", "c" => "ānama", "len" => 5, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  67. $sandhi[] = array("a" => "a", "b" => "iti", "c" => "āti", "len" => 3, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  68. $sandhi[] = array("a" => "[ṃ]", "b" => "ca", "c" => "ñca", "len" => 3, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  69. $sandhi[] = array("a" => "[ṃ]", "b" => "iti", "c" => "nti", "len" => 3, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  70. $sandhi[] = array("a" => "[ṃ]", "b" => "a", "c" => "ma", "len" => 2, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  71. $sandhi[] = array("a" => "ṃ", "b" => "a", "c" => "m", "len" => 1, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  72. $sandhi[] = array("a" => "[ṃ]", "b" => "ā", "c" => "mā", "len" => 2, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  73. $sandhi[] = array("a" => "[ṃ]", "b" => "u", "c" => "mu", "len" => 2, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  74. $sandhi[] = array("a" => "[ṃ]", "b" => "h", "c" => "ñh", "len" => 2, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  75. $sandhi[] = array("a" => "ā", "b" => "[ṃ]", "c" => "am", "len" => 2, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  76. $sandhi[] = array("a" => "a", "b" => "[ṃ]", "c" => "am", "len" => 2, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  77. $sandhi[] = array("a" => "ī", "b" => "[ṃ]", "c" => "im", "len" => 2, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  78. $sandhi[] = array("a" => "ati", "b" => "tabba", "c" => "atabba", "len" => 6, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  79. $sandhi[] = array("a" => "ati", "b" => "tabba", "c" => "itabba", "len" => 6, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  80. $sandhi[] = array("a" => "iti", "b" => "a", "c" => "icca", "len" => 4, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  81. $sandhi[] = array("a" => "uṃ", "b" => "a", "c" => "uma", "len" => 3, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  82. $sandhi[] = array("a" => "u[ūnaṃ]", "b" => "a", "c" => "ūnama", "len" => 5, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  83. $sandhi[] = array("a" => "ī[īnaṃ]", "b" => "a", "c" => "īnama", "len" => 5, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  84. $sandhi[] = array("a" => "su", "b" => "a", "c" => "sva", "len" => 3, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  85. #other sandhi rule. can be use but program will be slow down
  86. #其他连音规则,如果使用则会让程序运行变慢
  87. $sandhi[] = array("a" => "ā", "b" => "iti", "c" => "āti", "len" => 3, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  88. $sandhi[] = array("a" => "a", "b" => "iti", "c" => "āti", "len" => 3, "adj_len" => 0, "advance" => false,"cf"=>0.99999);
  89. $sandhi[] = array("a" => "e", "b" => "iti", "c" => "eti", "len" => 3, "adj_len" => 0, "advance" => false,"cf"=>0.99999);
  90. $sandhi[] = array("a" => "ī", "b" => "iti", "c" => "īti", "len" => 3, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  91. $sandhi[] = array("a" => "i", "b" => "iti", "c" => "īti", "len" => 3, "adj_len" => 0, "advance" => false,"cf"=>0.99999);
  92. $sandhi[] = array("a" => "o", "b" => "iti", "c" => "oti", "len" => 3, "adj_len" => 0, "advance" => false,"cf"=>0.99999);
  93. $sandhi[] = array("a" => "ū", "b" => "iti", "c" => "ūti", "len" => 3, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  94. $sandhi[] = array("a" => "u", "b" => "iti", "c" => "ūti", "len" => 3, "adj_len" => 0, "advance" => false,"cf"=>0.99999);
  95. $sandhi[] = array("a" => "ṃ", "b" => "iti", "c" => "nti", "len" => 3, "adj_len" => 0, "advance" => false,"cf"=>0.99999);
  96. $sandhi[] = array("a" => "ṃ", "b" => "ca", "c" => "ñca", "len" => 3, "adj_len" => 0, "advance" => false,"cf"=>1.0);
  97. $sandhi[] = array("a" => "ṃ", "b" => "cāti", "c" => "ñcāti", "len" => 5, "adj_len" => 0, "advance" => false,"cf"=>1.0);
  98. $sandhi[] = array("a" => "ṃ", "b" => "cet", "c" => "ñcet", "len" => 4, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  99. $sandhi[] = array("a" => "ṃ", "b" => "ev", "c" => "mev", "len" => 3, "adj_len" => 0, "advance" => false,"cf"=>0.99999);
  100. /*
  101. $sandhi[] = array("a" => "a", "b" => "eva", "c" => "eva", "len" => 3, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  102. $sandhi[] = array("a" => "ā", "b" => "eva", "c" => "āyeva", "len" => 5, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  103. $sandhi[] = array("a" => "e", "b" => "eva", "c" => "eva", "len" => 3, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  104. $sandhi[] = array("a" => "i", "b" => "eva", "c" => "yeva", "len" => 4, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  105. $sandhi[] = array("a" => "ī", "b" => "eva", "c" => "iyeva", "len" => 5, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  106. $sandhi[] = array("a" => "ī", "b" => "eva", "c" => "īyeva", "len" => 5, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  107. $sandhi[] = array("a" => "o", "b" => "eva", "c" => "ova", "len" => 3, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  108. $sandhi[] = array("a" => "u", "b" => "eva", "c" => "veva", "len" => 3, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  109. $sandhi[] = array("a" => "a", "b" => "eva", "c" => "evā", "len" => 3, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  110. $sandhi[] = array("a" => "e", "b" => "eva", "c" => "evā", "len" => 3, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  111. $sandhi[] = array("a" => "i", "b" => "eva", "c" => "yevā", "len" => 4, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  112. $sandhi[] = array("a" => "ī", "b" => "eva", "c" => "yevā", "len" => 4, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  113. $sandhi[] = array("a" => "ī", "b" => "eva", "c" => "iyevā", "len" => 4, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  114. $sandhi[] = array("a" => "ī", "b" => "eva", "c" => "īyevā", "len" => 4, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  115. $sandhi[] = array("a" => "o", "b" => "eva", "c" => "ovā", "len" => 4, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  116. $sandhi[] = array("a" => "ā", "b" => "api", "c" => "āpi", "len" => 3, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  117. $sandhi[] = array("a" => "a", "b" => "api", "c" => "āpi", "len" => 3, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  118. $sandhi[] = array("a" => "e", "b" => "api", "c" => "epi", "len" => 3, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  119. $sandhi[] = array("a" => "ī", "b" => "api", "c" => "īpi", "len" => 3, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  120. $sandhi[] = array("a" => "i", "b" => "api", "c" => "īpi", "len" => 3, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  121. $sandhi[] = array("a" => "o", "b" => "api", "c" => "opi", "len" => 3, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  122. $sandhi[] = array("a" => "ū", "b" => "api", "c" => "ūpi", "len" => 3, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  123. $sandhi[] = array("a" => "u", "b" => "api", "c" => "ūpi", "len" => 3, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  124. $sandhi[] = array("a" => "u", "b" => "api", "c" => "upi", "len" => 3, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  125. $sandhi[] = array("a" => "ṃ", "b" => "api", "c" => "mpi", "len" => 3, "adj_len" => 0, "advance" => false,"cf"=>0.9999);
  126. */
  127. $sandhi[] = array("a" => "a", "b" => "a", "c" => "a", "len" => 1, "adj_len" => -1, "advance" => true,"cf"=>0.99);
  128. $sandhi[] = array("a" => "ī", "b" => "", "c" => "i", "len" => 1, "adj_len" => 0, "advance" => true,"cf"=>0.9);
  129. function split_diphthong($word)
  130. {
  131. //diphthong table双元音表
  132. $search = array('aa', 'ae', 'ai', 'ao', 'au', 'aā', 'aī', 'aū', 'ea', 'ee', 'ei', 'eo', 'eu', 'eā', 'eī', 'eū', 'ia', 'ie', 'ii', 'io', 'iu', 'iā', 'iī', 'iū', 'oa', 'oe', 'oi', 'oo', 'ou', 'oā', 'oī', 'oū', 'ua', 'ue', 'ui', 'uo', 'uu', 'uā', 'uī', 'uū', 'āa', 'āe', 'āi', 'āo', 'āu', 'āā', 'āī', 'āū', 'īa', 'īe', 'īi', 'īo', 'īu', 'īā', 'īī', 'īū', 'ūa', 'ūe', 'ūi', 'ūo', 'ūu', 'ūā', 'ūī', 'ūū');
  133. $replace = array('a-a', 'a-e', 'a-i', 'a-o', 'a-u', 'a-ā', 'a-ī', 'a-ū', 'e-a', 'e-e', 'e-i', 'e-o', 'e-u', 'e-ā', 'e-ī', 'e-ū', 'i-a', 'i-e', 'i-i', 'i-o', 'i-u', 'i-ā', 'i-ī', 'i-ū', 'o-a', 'o-e', 'o-i', 'o-o', 'o-u', 'o-ā', 'o-ī', 'o-ū', 'u-a', 'u-e', 'u-i', 'u-o', 'u-u', 'u-ā', 'u-ī', 'u-ū', 'ā-a', 'ā-e', 'ā-i', 'ā-o', 'ā-u', 'ā-ā', 'ā-ī', 'ā-ū', 'ī-a', 'ī-e', 'ī-i', 'ī-o', 'ī-u', 'ī-ā', 'ī-ī', 'ī-ū', 'ū-a', 'ū-e', 'ū-i', 'ū-o', 'ū-u', 'ū-ā', 'ū-ī', 'ū-ū');
  134. //将双元音拆开
  135. //step 1 : split at diphthong . ~aa~ -> ~a-a~
  136. $word1 = str_replace($search, $replace, $word);
  137. //按连字符拆开处理
  138. $arrword = str_getcsv($word1, "-");
  139. return $arrword;
  140. }
  141. /*
  142. 用于数组连接字符串
  143. */
  144. function myfunction($v1, $v2)
  145. {
  146. return $v1 . "+" . $v2;
  147. }
  148. function microtime_float()
  149. {
  150. list($usec, $sec) = explode(" ", microtime());
  151. return ((float) $usec + (float) $sec);
  152. }
  153. function dict_lookup($word)
  154. {
  155. if (strlen($word) <= 1) {
  156. return 0;
  157. }
  158. global $case;
  159. global $dbh;
  160. $str = strstr($word, "[");
  161. if ($str === false) {
  162. $search = $word;
  163. } else {
  164. $search = $str;
  165. }
  166. $query = "SELECT weight from part where word = ? ";
  167. $stmt = $dbh->prepare($query);
  168. $stmt->execute(array($search));
  169. $row = $stmt->fetch(PDO::FETCH_NUM);
  170. if ($row) {
  171. return array($row[0],0);
  172. } else {
  173. //去除尾查
  174. $newWord = array();
  175. for ($row = 0; $row < count($case); $row++) {
  176. $len = mb_strlen($case[$row][1], "UTF-8");
  177. $end = mb_substr($word, 0 - $len, null, "UTF-8");
  178. if ($end == $case[$row][1]) {
  179. $base = mb_substr($word, 0, mb_strlen($word, "UTF-8") - $len, "UTF-8") . $case[$row][0];
  180. if ($base != $word) {
  181. $newWord[$base] = mb_strlen($case[$row][1],"UTF-8");
  182. }
  183. }
  184. }
  185. #找到最高频的base
  186. $base_weight = 0;
  187. $len = 0;
  188. foreach ($newWord as $x => $x_value) {
  189. $query = "SELECT weight from part where word = ? ";
  190. $stmt = $dbh->prepare($query);
  191. $stmt->execute(array($x));
  192. $row = $stmt->fetch(PDO::FETCH_NUM);
  193. if ($row) {
  194. if ($row[0] > $base_weight) {
  195. $base_weight = $row[0];
  196. $len=$x_value;
  197. }
  198. }
  199. }
  200. return array($base_weight,$len);
  201. }
  202. }
  203. /*
  204. 查找某个单词是否在现有词典出现
  205. 返回信心指数
  206. look up single word in dictionary vocabulary
  207. return the confidence value
  208. */
  209. function isExsit($word, $adj_len = 0)
  210. {
  211. global $auto_split_times;
  212. global $result;
  213. global $part;
  214. global $confidence;
  215. $auto_split_times++;
  216. if (isset($_POST["debug"])) {
  217. echo "<div>正在查询:{$word}</div>";
  218. }
  219. $isFound = false;
  220. $count = 0;
  221. if (isset($part["{$word}"])) {
  222. $word_count = $part["{$word}"][0];
  223. $case_len = $part["{$word}"][1];
  224. if ($word_count > 0) {
  225. $isFound = true;
  226. $count = $word_count + 1;
  227. }
  228. } else {
  229. $db = dict_lookup($word);
  230. $word_count = $db[0];
  231. $case_len = $db[1];
  232. //加入查询缓存
  233. $part["{$word}"] = $db;
  234. if ($word_count > 0) {
  235. if (isset($_POST["debug"])) {
  236. echo "查到:{$word}:{$word_count}个\n";
  237. }
  238. $isFound = true;
  239. $count = $word_count + 1;
  240. }
  241. }
  242. //fomular of confidence value 信心值计算公式
  243. if ($isFound) {
  244. if (isset($confidence["{$word}"])) {
  245. $cf = $confidence["{$word}"];
  246. } else {
  247. $len = mb_strlen($word, "UTF-8") + $adj_len;
  248. $len_correct = 1.2;
  249. $count2 = 1.1 + pow($count, 1.18);
  250. $conf_num = pow(1 / $count2, pow(($len - 0.5), $len_correct));
  251. //$cf = round(1 / (1 + 640 * $conf_num), 9);
  252. $cf = round((1-0.02*$case_len) / (1 + 640 * $conf_num), 9);
  253. $confidence["{$word}"] = $cf;
  254. if (isset($_POST["debug"])) {
  255. echo "信心指数:{$word}:{$cf}\n";
  256. }
  257. }
  258. return ($cf);
  259. } else {
  260. return (-1);
  261. }
  262. }
  263. /*
  264. 核心拆分函数
  265. $strWord, word to be look up 要查询的词
  266. $deep, 当前递归深度
  267. $express=true, 快速查询
  268. $adj_len=0 长度校正系数
  269. $c_threshhold 信心指数阈值
  270. */
  271. function mySplit2($strWord, $deep = 0, $express = false, $adj_len = 0, $c_threshhold = 0.8, $w_threshhold = 0.8, $forward = true, $sandhi_advance = false)
  272. {
  273. global $path;
  274. global $result;
  275. global $sandhi;
  276. $output = array();
  277. //达到最大搜索深度,返回
  278. if ($deep >= 16) {
  279. $word = "";
  280. $cf = 1.0;
  281. for ($i = 0; $i < $deep; $i++) {
  282. if (!empty($path[$i][0])) {
  283. $word .= $path[$i][0] . "+";
  284. if (isset($_POST["debug"])) {
  285. $word .= "(" . $path[$i][1] . ")-";
  286. }
  287. $cf = $cf * $path[$i][1];
  288. }
  289. }
  290. $len = pow(mb_strlen($strWord, "UTF-8"), 3);
  291. $cf += (0 - $len) / ($len + 150);
  292. $word .= "{$strWord}";
  293. if ($forward == true) {
  294. $result[$word] = $cf;
  295. return;
  296. } else {
  297. $reverseWord = word_reverse($word);
  298. $result[$reverseWord] = $cf;
  299. return;
  300. }
  301. }
  302. //直接找到
  303. $confidence = isExsit($strWord, $adj_len);
  304. if ($confidence >= 0) {
  305. $output[] = array($strWord, "", $confidence);
  306. }
  307. else {
  308. $confidence = isExsit("[" . $strWord . "]");
  309. if ($confidence >= 0) {
  310. $output[] = array("[" . $strWord . "]", "", $confidence);
  311. }
  312. }
  313. //如果开头有双辅音,去掉第一个辅音。因为巴利语中没有以双辅音开头的单词。
  314. $doubleword = "kkggccjjṭṭḍḍttddppbb";
  315. if (mb_strlen($strWord, "UTF-8") > 2) {
  316. $left2 = mb_substr($strWord, 0, 2, "UTF-8");
  317. if (mb_strpos($doubleword, $left2, 0, "UTF-8") !== false) {
  318. $strWord = mb_substr($strWord, 1, null, "UTF-8");
  319. }
  320. }
  321. $len = mb_strlen($strWord, "UTF-8");
  322. if ($len > 2) {
  323. if ($forward) {
  324. #正向切
  325. for ($i = $len; $i > 1; $i--) {
  326. foreach ($sandhi as $key => $row) {
  327. if ($sandhi_advance == false && $row["advance"] == true) {
  328. continue;
  329. }
  330. if (mb_substr($strWord, $i - $row["len"], $row["len"], "UTF-8") == $row["c"]) {
  331. $str1 = mb_substr($strWord, 0, $i - $row["len"], "UTF-8") . $row["a"];
  332. $str2 = $row["b"] . mb_substr($strWord, $i, null, "UTF-8");
  333. $confidence = isExsit($str1, $adj_len);
  334. if ($row["advance"] == true) {
  335. $confidence = $confidence * 0.99;
  336. }
  337. if ($confidence > $c_threshhold) {
  338. $output[] = array($str1, $str2, $confidence, $row["adj_len"]);
  339. if (isset($_POST["debug"])) {
  340. echo "插入:{$str1} 剩余{$str2} 应用:{$row["a"]}-{$row["b"]}-{$row["c"]}\n";
  341. }
  342. if ($express) {
  343. break;
  344. }
  345. }
  346. }
  347. }
  348. }
  349. } else {
  350. #反向切
  351. for ($i = 1; $i < $len - 1; $i++) {
  352. foreach ($sandhi as $key => $row) {
  353. if ($sandhi_advance == false && $row["advance"] == true) {
  354. continue;
  355. }
  356. if (mb_substr($strWord, $i, $row["len"], "UTF-8") == $row["c"]) {
  357. $str1 = mb_substr($strWord, 0, $i, "UTF-8") . $row["a"];
  358. $str2 = $row["b"] . mb_substr($strWord, $i + $row["len"], null, "UTF-8");
  359. $confidence = isExsit($str2, $adj_len);
  360. if ($row["advance"] == true) {
  361. $confidence = $confidence * 0.99;
  362. }
  363. if ($confidence > $c_threshhold) {
  364. $output[] = array($str2, $str1, $confidence, $row["adj_len"]);
  365. if (isset($_POST["debug"])) {
  366. echo "插入:{$str2}\n";
  367. }
  368. if ($express) {
  369. break;
  370. }
  371. }
  372. }
  373. }
  374. }
  375. }
  376. }
  377. $word = "";
  378. if (count($output) > 0) {
  379. foreach ($output as $part) {
  380. $checked = $part[0];
  381. $remainder = $part[1];
  382. $path[$deep][0] = $checked;
  383. $path[$deep][1] = $part[2];
  384. if (empty($remainder)) {
  385. #全切完了
  386. $word = "";
  387. $cf = 1.0;
  388. for ($i = 0; $i < $deep; $i++) {
  389. $word .= $path[$i][0];
  390. if (isset($_POST["debug"])) {
  391. $word .= "(" . $path[$i][1] . ")";
  392. }
  393. $word .= "+";
  394. $cf = $cf * $path[$i][1];
  395. }
  396. if (isset($_POST["debug"])) {
  397. $word .= $checked . "({$part[2]})";
  398. } else {
  399. $word .= $checked;
  400. }
  401. $cf = $cf * $part[2];
  402. if ($cf > $w_threshhold) {
  403. if ($forward == true) {
  404. $result[$word] = $cf;
  405. return;
  406. } else {
  407. $reverseWord = word_reverse($word);
  408. $result[$reverseWord] = $cf;
  409. return;
  410. }
  411. }
  412. } else {
  413. #接着切
  414. mySplit2($remainder, ($deep + 1), $express, $adj_len, $c_threshhold, $w_threshhold, $forward, $sandhi_advance);
  415. }
  416. }
  417. }
  418. else {
  419. #尾巴查不到了
  420. $word = "";
  421. $cf = 1.0;
  422. for ($i = 0; $i < $deep; $i++) {
  423. $word .= $path[$i][0];
  424. if (isset($_POST["debug"])) {
  425. $word .= "(" . $path[$i][1] . ")";
  426. }
  427. $word .= "+";
  428. $cf = $cf * $path[$i][1];
  429. }
  430. $len = pow(mb_strlen($strWord, "UTF-8"), 3);
  431. if ($forward) {
  432. $cf =(1-$cf) * $len / ($len + 150);
  433. } else {
  434. $cf =(1-$cf) * $len / ($len + 5);
  435. }
  436. if (isset($_POST["debug"])) {
  437. $word = $word.$strWord . "(0)";
  438. } else {
  439. $word = $word .$strWord;
  440. }
  441. if ($cf > $w_threshhold) {
  442. if ($forward == true) {
  443. $result[$word] = $cf;
  444. return;
  445. }
  446. else {
  447. $reverseWord = word_reverse($word);
  448. $result[$reverseWord] = $cf;
  449. return;
  450. }
  451. }
  452. }
  453. }
  454. function word_reverse($word)
  455. {
  456. $reverse = array();
  457. $newword = explode("+", $word);
  458. $len = count($newword);
  459. if ($len > 0) {
  460. for ($i = $len - 1; $i >= 0; $i--) {
  461. # code...
  462. $reverse[] = $newword[$i];
  463. }
  464. $output = implode("+", $reverse);
  465. return $output;
  466. } else {
  467. return $word;
  468. }
  469. }
  470. #后处理
  471. function split2($word){
  472. global $redis;
  473. $input = explode("+",$word);
  474. $newword=array();
  475. foreach ($input as $value) {
  476. $word = strstr($value,"(",true);
  477. if($word==false){
  478. $word=$value;
  479. }
  480. if(mb_strlen($word,"UTF-8")>4){
  481. # 先看有没有中文意思
  482. if($redis->hExists("dict://ref/has_mean",$word)===TRUE){
  483. $newword[]=$word;
  484. }
  485. else{
  486. #如果没有查巴缅替换拆分
  487. if($redis->hExists("dict://pm/part",$word)===TRUE){
  488. $pmPart = explode("+",$redis->hGet("dict://pm/part",$word)) ;
  489. foreach ($pmPart as $pm) {
  490. # code...
  491. $newword[]=$pm;
  492. }
  493. }
  494. else{
  495. #如果没有查规则变形
  496. if($redis->hExists("dict://regular/part",$word)===TRUE){
  497. $rglPart = explode("+",$redis->hGet("dict://regular/part",$word)) ;
  498. #看巴缅有没有第一部分
  499. if($redis->hExists("dict://pm/part",$rglPart[0])===TRUE){
  500. $pmPart = explode("+",$redis->hGet("dict://pm/part",$rglPart[0])) ;
  501. foreach ($pmPart as $pm) {
  502. # code...
  503. $newword[]=$pm;
  504. }
  505. }
  506. else{
  507. #没有
  508. $newword[]=$rglPart[0];
  509. }
  510. $newword[]=$rglPart[1];
  511. }
  512. else{
  513. #还没有就认命了
  514. $newword[]=$word;
  515. }
  516. }
  517. }
  518. }
  519. else{
  520. $newword[]=$word;
  521. }
  522. }
  523. return implode("+",$newword);
  524. }