blocks|key|1418901|text|您可以使用string-similarity库。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|1418902|1418903|根据Dice的系数找到字符串之间的相似度，这通常比Levenshtein距离更好。|blockquote|1418904|1418905|1418906|var+a+=+"Hello+Blue+World";
var+b+=+"Hello+Blut+World?";

var+stringSimilarity+=+require("string-similarity");
var+similarityCoef+=+stringSimilarity.compareTwoStrings(a,+b);

if+(similarityCoef+>+0.8)+{+console.log(true);+}|code-block|syntax|javascript|1418907|请注意，当字符串的匹配率为80%25+(0.8)时，similarityCoef将输出true。您可以根据需要调整此值。|style|CODE|1418908|entityMap|0|LINK|mutability|MUTABLE|url|https://www.npmjs.com/package/string-similarity^0|5|H|0|0|0|0|0|0|0|O|E|0^^$0|@$1|2|3|4|5|6|7|10|8|@]|9|@$A|11|B|12|1|13]]|C|$]]|$1|D|3|-4|5|6|7|14|8|@]|9|@]|C|$]]|$1|E|3|F|5|G|7|15|8|@]|9|@]|C|$]]|$1|H|3|-4|5|6|7|16|8|@]|9|@]|C|$]]|$1|I|3|-4|5|6|7|17|8|@]|9|@]|C|$]]|$1|J|3|K|5|L|7|18|8|@]|9|@]|C|$M|N]]|$1|O|3|P|5|6|7|19|8|@$A|1A|B|1B|Q|R]]|9|@]|C|$]]|$1|S|3|-4|5|6|7|1C|8|@]|9|@]|C|$]]]|T|$U|$5|V|W|X|C|$Y|Z]]]]

<p>You could use <a href="https://www.npmjs.com/package/string-similarity" rel="nofollow noreferrer">string-similarity</a> library.</p>
<blockquote>
<p>Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.</p>
</blockquote>
<pre><code>var a = &quot;Hello Blue World&quot;;
var b = &quot;Hello Blut World?&quot;;

var stringSimilarity = require(&quot;string-similarity&quot;);
var similarityCoef = stringSimilarity.compareTwoStrings(a, b);

if (similarityCoef &gt; 0.8) { console.log(true); }
</code></pre>
<p>Note that <code>similarityCoef</code> print true when the string matches at 80% (0.8). You can adjust this value to your needs.</p>


blocks|key|1418915|text|这很棘手。因为你必须以百分比的方式告诉你相似性对你来说意味着什么。这种方法怎么样？|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1418916|您可以逐个字符串地比较它们，并计算匹配项。我知道，一旦一个字符串中有一个非常早的额外字符，这就会失败。但首先，这应该足够了。|1418917|var+a+=+"Hello+Blue+World";
var+b+=+"Hello+Blut+World?";

+//+only+compare+both+strings+with+their+mutual+length,+because+of+the+loop+we+use
const+mutualLength+=+(a.length+>+b.length)+?+b.length+:+a.length;
const+similarityAt+=+90;+//+percent
let+matchCount+=+0;

//+with+each+match+increase+matchCount+by+1
for+(let+pointer+=+0;+pointer+<+mutualLength;+pointer%2B%2B)+{
++++if+(a.substring(pointer,+1)+===+(b.substring(pointer,+1)+{
++++++++matchCount%2B%2B;
++++}
}

+//+compute+similarity+in+percent
const+similarity+=+(matchCount+*+100)+/+mutualLength;

console.log('Similarity+given:+'+%2B+(similarity+>=+similarityAt));|code-block|syntax|javascript|1418918|entityMap^0|0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|L|8|@]|9|@]|A|$]]|$1|D|3|E|5|F|7|M|8|@]|9|@]|A|$G|H]]|$1|I|3|-4|5|6|7|N|8|@]|9|@]|A|$]]]|J|$]]

<p>That's tricky. Because you have somehow to tell in percent what similarity means for you. What about this approach?</p>
<p>You compare them string by string and count the matches. I know that this will fail as soon as there is one additional character very early in one of the strings. But for a start it should suffice.</p>
<pre><code>var a = &quot;Hello Blue World&quot;;
var b = &quot;Hello Blut World?&quot;;

 // only compare both strings with their mutual length, because of the loop we use
const mutualLength = (a.length &gt; b.length) ? b.length : a.length;
const similarityAt = 90; // percent
let matchCount = 0;

// with each match increase matchCount by 1
for (let pointer = 0; pointer &lt; mutualLength; pointer++) {
    if (a.substring(pointer, 1) === (b.substring(pointer, 1) {
        matchCount++;
    }
}

 // compute similarity in percent
const similarity = (matchCount * 100) / mutualLength;

console.log('Similarity given: ' + (similarity &gt;= similarityAt));
</code></pre>


blocks|key|1633975|text|if+'n'+is+zero+then+strings+are+equal|type|code-block|depth|inlineStyleRanges|entityRanges|data|syntax|javascript|1633976|​|unstyled|1633977|++var+str1+=+"ab";
++var+str2+=+"cd";
++var+n+=+str1.localeCompare(str2);
++console.log(n);|1633978|1633979|entityMap^0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|L|8|@]|9|@]|A|$B|C]]|$1|D|3|E|5|F|7|M|8|@]|9|@]|A|$]]|$1|G|3|H|5|6|7|N|8|@]|9|@]|A|$B|C]]|$1|I|3|E|5|F|7|O|8|@]|9|@]|A|$]]|$1|J|3|-4|5|F|7|P|8|@]|9|@]|A|$]]]|K|$]]

<pre><code>if 'n' is zero then strings are equal
</code></pre>
<p><div class="snippet" data-lang="js" data-hide="false" data-console="true" data-babel="false">
<div class="snippet-code">
<pre class="snippet-code-js lang-js prettyprint-override"><code>  var str1 = "ab";
  var str2 = "cd";
  var n = str1.localeCompare(str2);
  console.log(n);</code></pre>
</div>
</div>
</p>


blocks|key|5418261|text|B"H|type|unstyled|depth|inlineStyleRanges|entityRanges|data|5418262|取决于相似程度，但如果您想要百分比数量来告诉您哪些匹配，您可以简单地循环最短字符串，并跟踪每个字符与最长字符串的后续索引匹配的次数(或者向最短字符串添加空格，但这可能会扰乱一些计算)，然后将匹配总数与(最短)字符串的长度相除，以获得相等百分比|5418263|var+str1+=+"Hello+blue+world"
var+str2+=+"Hello+blut+world?!"

var+shortest+=+str2.length+>=+str1.length?str1:str2
var+longest+=+str2.length+<+str1.length?str1:str2

var+matches=+0

shortest
.split("")
//Just+check+if+index+of+shortest
//Matches+index+of+longest,+and+if+so+(&&+means+do+next
//Expression)+add+the+total+number+of+matches+by+one
.forEach+(
(x,k)=>
((x==longest[k])+&&+(matches%2B%2B)+)
)

//Final+result,+divide+matches+by+total+length
var+similarity+=+matches+/+shortest.length|code-block|syntax|javascript|5418264|entityMap^0|0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|L|8|@]|9|@]|A|$]]|$1|D|3|E|5|F|7|M|8|@]|9|@]|A|$G|H]]|$1|I|3|-4|5|6|7|N|8|@]|9|@]|A|$]]]|J|$]]

<p>B&quot;H</p>
<p>Depends on degree of similarity, but if you want a percent amount to tell you what matches, you can simply loop through the shortest, and keep track of how many times each character matches with the subsequent index of the longest string (or add whitespace to the shortest string, but that might mess up some calculations), and then divide the total number of matches with the length of the (shortest) string to get the percent of equality</p>
<pre><code>
var str1 = &quot;Hello blue world&quot;
var str2 = &quot;Hello blut world?!&quot;

var shortest = str2.length &gt;= str1.length?str1:str2
var longest = str2.length &lt; str1.length?str1:str2

var matches= 0

shortest
.split(&quot;&quot;)
//Just check if index of shortest
//Matches index of longest, and if so (&amp;&amp; means do next
//Expression) add the total number of matches by one
.forEach (
(x,k)=&gt;
((x==longest[k]) &amp;&amp; (matches++) )
)

//Final result, divide matches by total length
var similarity = matches / shortest.length
</code></pre>


<p>How to compare 2 text strings to see if they are similar, for example:</p>
<pre class="lang-js prettyprint-override"><code>var a = &quot;Hello Blue World&quot;;
var b = &quot;Hello Blut World?&quot;;

if(a similar b)
{
    console.log(true);
}
</code></pre>


Check similarity between strings in Javascript

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

如何比较两个文本字符串是否相似，例如：var a = "Hello Blue World";var b = "Hello Blut World?";if(a similar b){    console.log(true);}

问检查Javascript中字符串之间的相似性
EN

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问检查Javascript中字符串之间的相似性EN