PHP similar_text()、levenshtein()、lcs()支持中文汉字版,
PHP 原生的similar_text()函数、levenshtein()函数对中文汉字支持不好,我自己写了一个
similar_text()中文汉字版
<span> 1</span> <?<span>php </span><span> 2</span> <span>//</span><span>拆分字符串 </span> <span> 3</span> <span>function</span> split_str(<span>$str</span><span>) { </span><span> 4</span> <span>preg_match_all</span>("/./u", <span>$str</span>, <span>$arr</span><span>); </span><span> 5</span> <span>return</span> <span>$arr</span>[0<span>]; </span><span> 6</span> <span> } </span><span> 7</span> <span> 8</span> <span>//</span><span>相似度检测 </span> <span> 9</span> <span>function</span> similar_text_cn(<span>$str1</span>, <span>$str2</span><span>) { </span><span>10</span> <span>$arr_1</span> = <span>array_unique</span>(split_str(<span>$str1</span><span>)); </span><span>11</span> <span>$arr_2</span> = <span>array_unique</span>(split_str(<span>$str2</span><span>)); </span><span>12</span> <span>$similarity</span> = <span>count</span>(<span>$arr_2</span>) - <span>count</span>(<span>array_diff</span>(<span>$arr_2</span>, <span>$arr_1</span><span>)); </span><span>13</span> <span>14</span> <span>return</span> <span>$similarity</span><span>; </span><span>15</span> }
levenshtein()中文汉字版
<span> 1</span> <?<span>php </span><span> 2</span> <span>//</span><span>拆分字符串 </span> <span> 3</span> <span>function</span> mbStringToArray(<span>$string</span>, <span>$encoding</span> = 'UTF-8'<span>) { </span><span> 4</span> <span>$arrayResult</span> = <span>array</span><span>(); </span><span> 5</span> <span> 6</span> <span>while</span> (<span>$iLen</span> = mb_strlen(<span>$string</span>, <span>$encoding</span><span>)) { </span><span> 7</span> <span>array_push</span>(<span>$arrayResult</span>, mb_substr(<span>$string</span>, 0, 1, <span>$encoding</span><span>)); </span><span> 8</span> <span>$string</span> = mb_substr(<span>$string</span>, 1, <span>$iLen</span>, <span>$encoding</span><span>); </span><span> 9</span> <span> } </span><span>10</span> <span>11</span> <span>return</span> <span>$arrayResult</span><span>; </span><span>12</span> <span> } </span><span>13</span> <span>14</span> <span>//</span><span>编辑距离 </span> <span>15</span> <span>function</span> levenshtein_cn(<span>$str1</span>, <span>$str2</span>, <span>$costReplace</span> = 1, <span>$encoding</span> = 'UTF-8'<span>) { </span><span>16</span> <span>$count_same_letter</span> = 0<span>; </span><span>17</span> <span>$d</span> = <span>array</span><span>(); </span><span>18</span> <span>19</span> <span>$mb_len1</span> = mb_strlen(<span>$str1</span>, <span>$encoding</span><span>); </span><span>20</span> <span>$mb_len2</span> = mb_strlen(<span>$str2</span>, <span>$encoding</span><span>); </span><span>21</span> <span>22</span> <span>$mb_str1</span> = mbStringToArray(<span>$str1</span>, <span>$encoding</span><span>); </span><span>23</span> <span>$mb_str2</span> = mbStringToArray(<span>$str2</span>, <span>$encoding</span><span>); </span><span>24</span> <span>25</span> <span>for</span> (<span>$i1</span> = 0; <span>$i1</span> <= <span>$mb_len1</span>; <span>$i1</span>++<span>) { </span><span>26</span> <span>$d</span>[<span>$i1</span>] = <span>array</span><span>(); </span><span>27</span> <span>$d</span>[<span>$i1</span>][0] = <span>$i1</span><span>; </span><span>28</span> <span> } </span><span>29</span> <span>30</span> <span>for</span> (<span>$i2</span> = 0; <span>$i2</span> <= <span>$mb_len2</span>; <span>$i2</span>++<span>) { </span><span>31</span> <span>$d</span>[0][<span>$i2</span>] = <span>$i2</span><span>; </span><span>32</span> <span> } </span><span>33</span> <span>34</span> <span>for</span> (<span>$i1</span> = 1; <span>$i1</span> <= <span>$mb_len1</span>; <span>$i1</span>++<span>) { </span><span>35</span> <span>for</span> (<span>$i2</span> = 1; <span>$i2</span> <= <span>$mb_len2</span>; <span>$i2</span>++<span>) { </span><span>36</span> <span>//</span><span> $cost = ($str1[$i1 - 1] == $str2[$i2 - 1]) ? 0 : 1; </span> <span>37</span> <span>if</span> (<span>$mb_str1</span>[<span>$i1</span> - 1] === <span>$mb_str2</span>[<span>$i2</span> - 1<span>]) { </span><span>38</span> <span>$cost</span> = 0<span>; </span><span>39</span> <span>$count_same_letter</span>++<span>; </span><span>40</span> } <span>else</span><span> { </span><span>41</span> <span>$cost</span> = <span>$costReplace</span>; <span>//</span><span>替换 </span> <span>42</span> <span> } </span><span>43</span> <span>44</span> <span>$d</span>[<span>$i1</span>][<span>$i2</span>] = <span>min</span>(<span>$d</span>[<span>$i1</span> - 1][<span>$i2</span>] + 1, <span>//</span><span>插入 </span> <span>45</span> <span>$d</span>[<span>$i1</span>][<span>$i2</span> - 1] + 1, <span>//</span><span>删除 </span> <span>46</span> <span>$d</span>[<span>$i1</span> - 1][<span>$i2</span> - 1] + <span>$cost</span><span>); </span><span>47</span> <span> } </span><span>48</span> <span> } </span><span>49</span> <span>50</span> <span>return</span> <span>$d</span>[<span>$mb_len1</span>][<span>$mb_len2</span><span>]; </span><span>51</span> <span>//</span><span>return array('distance' => $d[$mb_len1][$mb_len2], 'count_same_letter' => $count_same_letter); </span> <span>52</span> }
最长公共子序列LCS()
<span> 1</span> <?<span>php </span><span> 2</span> <span>//</span><span>最长公共子序列英文版 </span> <span> 3</span> <span>function</span> LCS_en(<span>$str_1</span>, <span>$str_2</span><span>) { </span><span> 4</span> <span>$len_1</span> = <span>strlen</span>(<span>$str_1</span><span>); </span><span> 5</span> <span>$len_2</span> = <span>strlen</span>(<span>$str_2</span><span>); </span><span> 6</span> <span>$len</span> = <span>$len_1</span> > <span>$len_2</span> ? <span>$len_1</span> : <span>$len_2</span><span>; </span><span> 7</span> <span> 8</span> <span>$dp</span> = <span>array</span><span>(); </span><span> 9</span> <span>for</span> (<span>$i</span> = 0; <span>$i</span> <= <span>$len</span>; <span>$i</span>++<span>) { </span><span>10</span> <span>$dp</span>[<span>$i</span>] = <span>array</span><span>(); </span><span>11</span> <span>$dp</span>[<span>$i</span>][0] = 0<span>; </span><span>12</span> <span>$dp</span>[0][<span>$i</span>] = 0<span>; </span><span>13</span> <span> } </span><span>14</span> <span>15</span> <span>for</span> (<span>$i</span> = 1; <span>$i</span> <= <span>$len_1</span>; <span>$i</span>++<span>) { </span><span>16</span> <span>for</span> (<span>$j</span> = 1; <span>$j</span> <= <span>$len_2</span>; <span>$j</span>++<span>) { </span><span>17</span> <span>if</span> (<span>$str_1</span>[<span>$i</span> - 1] == <span>$str_2</span>[<span>$j</span> - 1<span>]) { </span><span>18</span> <span>$dp</span>[<span>$i</span>][<span>$j</span>] = <span>$dp</span>[<span>$i</span> - 1][<span>$j</span> - 1] + 1<span>; </span><span>19</span> } <span>else</span><span> { </span><span>20</span> <span>$dp</span>[<span>$i</span>][<span>$j</span>] = <span>$dp</span>[<span>$i</span> - 1][<span>$j</span>] > <span>$dp</span>[<span>$i</span>][<span>$j</span> - 1] ? <span>$dp</span>[<span>$i</span> - 1][<span>$j</span>] : <span>$dp</span>[<span>$i</span>][<span>$j</span> - 1<span>]; </span><span>21</span> <span> } </span><span>22</span> <span> } </span><span>23</span> <span> } </span><span>24</span> <span>25</span> <span>return</span> <span>$dp</span>[<span>$len_1</span>][<span>$len_2</span><span>]; </span><span>26</span> <span> } </span><span>27</span> <span>28</span> <span>//</span><span>拆分字符串 </span> <span>29</span> <span>function</span> mbStringToArray(<span>$string</span>, <span>$encoding</span> = 'UTF-8'<span>) { </span><span>30</span> <span>$arrayResult</span> = <span>array</span><span>(); </span><span>31</span> <span>32</span> <span>while</span> (<span>$iLen</span> = mb_strlen(<span>$string</span>, <span>$encoding</span><span>)) { </span><span>33</span> <span>array_push</span>(<span>$arrayResult</span>, mb_substr(<span>$string</span>, 0, 1, <span>$encoding</span><span>)); </span><span>34</span> <span>$string</span> = mb_substr(<span>$string</span>, 1, <span>$iLen</span>, <span>$encoding</span><span>); </span><span>35</span> <span> } </span><span>36</span> <span>37</span> <span>return</span> <span>$arrayResult</span><span>; </span><span>38</span> <span> } </span><span>39</span> <span>40</span> <span>//</span><span>最长公共子序列中文版 </span> <span>41</span> <span>function</span> LCS_cn(<span>$str1</span>, <span>$str2</span>, <span>$encoding</span> = 'UTF-8'<span>) { </span><span>42</span> <span>$mb_len1</span> = mb_strlen(<span>$str1</span>, <span>$encoding</span><span>); </span><span>43</span> <span>$mb_len2</span> = mb_strlen(<span>$str2</span>, <span>$encoding</span><span>); </span><span>44</span> <span>45</span> <span>$mb_str1</span> = mbStringToArray(<span>$str1</span>, <span>$encoding</span><span>); </span><span>46</span> <span>$mb_str2</span> = mbStringToArray(<span>$str2</span>, <span>$encoding</span><span>); </span><span>47</span> <span>48</span> <span>$len</span> = <span>$mb_len1</span> > <span>$mb_len2</span> ? <span>$mb_len1</span> : <span>$mb_len2</span><span>; </span><span>49</span> <span>50</span> <span>$dp</span> = <span>array</span><span>(); </span><span>51</span> <span>for</span> (<span>$i</span> = 0; <span>$i</span> <= <span>$len</span>; <span>$i</span>++<span>) { </span><span>52</span> <span>$dp</span>[<span>$i</span>] = <span>array</span><span>(); </span><span>53</span> <span>$dp</span>[<span>$i</span>][0] = 0<span>; </span><span>54</span> <span>$dp</span>[0][<span>$i</span>] = 0<span>; </span><span>55</span> <span> } </span><span>56</span> <span>57</span> <span>for</span> (<span>$i</span> = 1; <span>$i</span> <= <span>$mb_len1</span>; <span>$i</span>++<span>) { </span><span>58</span> <span>for</span> (<span>$j</span> = 1; <span>$j</span> <= <span>$mb_len2</span>; <span>$j</span>++<span>) { </span><span>59</span> <span>if</span> (<span>$mb_str1</span>[<span>$i</span> - 1] == <span>$mb_str2</span>[<span>$j</span> - 1<span>]) { </span><span>60</span> <span>$dp</span>[<span>$i</span>][<span>$j</span>] = <span>$dp</span>[<span>$i</span> - 1][<span>$j</span> - 1] + 1<span>; </span><span>61</span> } <span>else</span><span> { </span><span>62</span> <span>$dp</span>[<span>$i</span>][<span>$j</span>] = <span>$dp</span>[<span>$i</span> - 1][<span>$j</span>] > <span>$dp</span>[<span>$i</span>][<span>$j</span> - 1] ? <span>$dp</span>[<span>$i</span> - 1][<span>$j</span>] : <span>$dp</span>[<span>$i</span>][<span>$j</span> - 1<span>]; </span><span>63</span> <span> } </span><span>64</span> <span> } </span><span>65</span> <span> } </span><span>66</span> <span>67</span> <span>return</span> <span>$dp</span>[<span>$mb_len1</span>][<span>$mb_len2</span><span>]; </span><span>68</span> }

PHP仍然流行的原因是其易用性、灵活性和强大的生态系统。1)易用性和简单语法使其成为初学者的首选。2)与web开发紧密结合,处理HTTP请求和数据库交互出色。3)庞大的生态系统提供了丰富的工具和库。4)活跃的社区和开源性质使其适应新需求和技术趋势。

PHP和Python都是高层次的编程语言,广泛应用于Web开发、数据处理和自动化任务。1.PHP常用于构建动态网站和内容管理系统,而Python常用于构建Web框架和数据科学。2.PHP使用echo输出内容,Python使用print。3.两者都支持面向对象编程,但语法和关键字不同。4.PHP支持弱类型转换,Python则更严格。5.PHP性能优化包括使用OPcache和异步编程,Python则使用cProfile和异步编程。

PHP主要是过程式编程,但也支持面向对象编程(OOP);Python支持多种范式,包括OOP、函数式和过程式编程。PHP适合web开发,Python适用于多种应用,如数据分析和机器学习。

PHP起源于1994年,由RasmusLerdorf开发,最初用于跟踪网站访问者,逐渐演变为服务器端脚本语言,广泛应用于网页开发。Python由GuidovanRossum于1980年代末开发,1991年首次发布,强调代码可读性和简洁性,适用于科学计算、数据分析等领域。

PHP适合网页开发和快速原型开发,Python适用于数据科学和机器学习。1.PHP用于动态网页开发,语法简单,适合快速开发。2.Python语法简洁,适用于多领域,库生态系统强大。

PHP在现代化进程中仍然重要,因为它支持大量网站和应用,并通过框架适应开发需求。1.PHP7提升了性能并引入了新功能。2.现代框架如Laravel、Symfony和CodeIgniter简化开发,提高代码质量。3.性能优化和最佳实践进一步提升应用效率。

PHPhassignificantlyimpactedwebdevelopmentandextendsbeyondit.1)ItpowersmajorplatformslikeWordPressandexcelsindatabaseinteractions.2)PHP'sadaptabilityallowsittoscaleforlargeapplicationsusingframeworkslikeLaravel.3)Beyondweb,PHPisusedincommand-linescrip

PHP类型提示提升代码质量和可读性。1)标量类型提示:自PHP7.0起,允许在函数参数中指定基本数据类型,如int、float等。2)返回类型提示:确保函数返回值类型的一致性。3)联合类型提示:自PHP8.0起,允许在函数参数或返回值中指定多个类型。4)可空类型提示:允许包含null值,处理可能返回空值的函数。


热AI工具

Undresser.AI Undress
人工智能驱动的应用程序,用于创建逼真的裸体照片

AI Clothes Remover
用于从照片中去除衣服的在线人工智能工具。

Undress AI Tool
免费脱衣服图片

Clothoff.io
AI脱衣机

AI Hentai Generator
免费生成ai无尽的。

热门文章

热工具

记事本++7.3.1
好用且免费的代码编辑器

SecLists
SecLists是最终安全测试人员的伙伴。它是一个包含各种类型列表的集合,这些列表在安全评估过程中经常使用,都在一个地方。SecLists通过方便地提供安全测试人员可能需要的所有列表,帮助提高安全测试的效率和生产力。列表类型包括用户名、密码、URL、模糊测试有效载荷、敏感数据模式、Web shell等等。测试人员只需将此存储库拉到新的测试机上,他就可以访问到所需的每种类型的列表。

PhpStorm Mac 版本
最新(2018.2.1 )专业的PHP集成开发工具

Atom编辑器mac版下载
最流行的的开源编辑器

ZendStudio 13.5.1 Mac
功能强大的PHP集成开发环境