entityMap|0|type|LINK|mutability|MUTABLE|data|url|http://en.wikipedia.org/wiki/Levenshtein_distance|1|http://en.wikipedia.org/wiki/Approximate_string_matching|2|https://www.google.com/search?q=approximate%2520string%2520matching%2520library%2520javascript|blocks|key|783944|text|我怀疑你会从校验和中得到一些东西。|unstyled|depth|inlineStyleRanges|entityRanges|783945|如果你不想要一个库，而只需要一个简单的算法，你可以计算Levenshtein+distance。在简单的无字典解决方案中，它可能是最好的。|offset|length|783946|如果你想要更强大的功能，我建议你开始学习approximate+string+matching并搜索relevant+libraries。|783947^0|0|R|K|0|0|K|R|1|1E|I|2|0^^$0|$1|$2|3|4|5|6|$7|8]]|9|$2|3|4|5|6|$7|A]]|B|$2|3|4|5|6|$7|C]]]|D|@$E|F|G|H|2|I|J|T|K|@]|L|@]|6|$]]|$E|M|G|N|2|I|J|U|K|@]|L|@$O|V|P|W|E|X]]|6|$]]|$E|Q|G|R|2|I|J|Y|K|@]|L|@$O|Z|P|10|E|11]|$O|12|P|13|E|14]]|6|$]]|$E|S|G|-4|2|I|J|15|K|@]|L|@]|6|$]]]]

I doubt you'll get something with checksums.

If you don't want a library but just a simple algorithm, you might compute the <a href="http://en.wikipedia.org/wiki/Levenshtein_distance" rel="nofollow">Levenshtein distance</a>. It's probably the best solution among the simple no-dictionary ones.

If you want something morepowerful, I'd suggest you to start studying <a href="http://en.wikipedia.org/wiki/Approximate_string_matching" rel="nofollow">approximate string matching</a> and search <a href="https://www.google.com/search?q=approximate%20string%20matching%20library%20javascript" rel="nofollow">relevant libraries</a>.

entityMap|0|type|LINK|mutability|MUTABLE|data|url|http://www.javascriptspellcheck.com/|1|http://en.wikipedia.org/wiki/Bloom_filter|2|https://stackoverflow.com/questions/2294915/what-algorithm-gives-suggestions-in-a-spell-checker|blocks|key|784052|text|对于这种情况，最好的办法就是使用拼写检查库。这个库(http://www.javascriptspellcheck.com/)就是一个可能工作的例子。进一步了解这个特定的API，您可以通过AJAX阅读以下建议：|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|784053|o+=+$Spelling.AjaxSpellCheckFields(Fields)
o.onValidate+=+function(result)+{+}|code-block|syntax|javascript|784054|我确信有其他优秀的库可以执行类似的操作。|784055|在算法方面，基本思想是计算用户输入的内容与字典中的单词列表之间的距离。我读到有人建议说"Bloom+Filter“是个不错的选择。有关更多信息，请参阅"What+algorithm+gives+suggestions+in+a+spell+checker?“。|784056|总体而言，您的算法需要能够处理以下输入：|784057|784058|User输入字符选择-显而易见，但important|unordered-list-item|style|BOLD|784059|Past+-基本上随着时间的推移，某些错误将是常见的。记住最常见的错误建议，或者用户如何纠正自己的错误，可以随着时间的推移真正提高算法的质量。这些信息甚至可以保存在用户特定的manner|784060|Context中-如果您知道用户应该输入国家/地区代码，那么您的字典可以显著缩小，这意味着您应该能够为提供更好的建议|784062|我认为通过更多的研究，这应该会让你走上正确的道路。祝你好运！|784063^0|Q|10|0|0|0|0|18|C|1|24|1G|2|0|0|0|0|Q|0|0|5|0|0|7|0|0^^$0|$1|$2|3|4|5|6|$7|8]]|9|$2|3|4|5|6|$7|A]]|B|$2|3|4|5|6|$7|C]]]|D|@$E|F|G|H|2|I|J|1C|K|@]|L|@$M|1D|N|1E|E|1F]]|6|$]]|$E|O|G|P|2|Q|J|1G|K|@]|L|@]|6|$R|S]]|$E|T|G|U|2|I|J|1H|K|@]|L|@]|6|$]]|$E|V|G|W|2|I|J|1I|K|@]|L|@$M|1J|N|1K|E|1L]|$M|1M|N|1N|E|1O]]|6|$]]|$E|X|G|Y|2|I|J|1P|K|@]|L|@]|6|$]]|$E|Z|G|-4|2|I|J|1Q|K|@]|L|@]|6|$]]|$E|10|G|11|2|12|J|1R|K|@$M|1S|N|1T|13|14]]|L|@]|6|$]]|$E|15|G|16|2|12|J|1U|K|@$M|1V|N|1W|13|14]]|L|@]|6|$]]|$E|17|G|18|2|12|J|1X|K|@$M|1Y|N|1Z|13|14]]|L|@]|6|$]]|$E|19|G|1A|2|I|J|20|K|@]|L|@]|6|$]]|$E|1B|G|-4|2|I|J|21|K|@]|L|@]|6|$]]]]

Your best bet for something like this is going to be using a spell check library. This library (<a href="http://www.javascriptspellcheck.com/" rel="nofollow noreferrer">http://www.javascriptspellcheck.com/</a>) is one example that might work. Looking further at that particular API, you can read suggestions via AJAX as follows:

<pre><code>o = $Spelling.AjaxSpellCheckFields(Fields)
o.onValidate = function(result) { }
</code></pre>

I'm sure there are other excellent libraries out there that should perform similar operations.

In terms of algorithms the basic idea is to compute the distance between what the user has entered and a list of words in a dictionary. I read suggestions that a "<a href="http://en.wikipedia.org/wiki/Bloom_filter" rel="nofollow noreferrer">Bloom Filter</a>" is a good option. For more information on that see "<a href="https://stackoverflow.com/questions/2294915/what-algorithm-gives-suggestions-in-a-spell-checker">What algorithm gives suggestions in a spell checker?</a>".

Overall, your algorithm needs to be able to handle the following inputs:

<ul>
<li>User entered characters - Obvious, but important</li>
<li>Past selections - basically over time certain mistakes will be common. Remembering the most commonly selected suggestions for any mistake or how the user corrects their own mistake can really improve the quality of your algorithm over time. This information could even be saved in a user specific manner</li>
<li>Context - If you know the user should be entering a country code your dictionary can shrink significantly which means you should be able to provide better suggestions</li>
</ul>

I think with a little more research this should put you on the right track. Best of luck!

entityMap|0|type|LINK|mutability|MUTABLE|data|url|https://stackoverflow.com/questions/11919065/sort-an-array-by-the-levenshtein-distance-with-best-performance-in-javascript|blocks|key|2058621|text|您应该尝试使用像Damerau-Levenshtein距离这样的相似性算法来比较这些值。下面是javascript的一个实现：|unstyled|depth|inlineStyleRanges|entityRanges|2058622|Sort+an+array+by+the+"Levenshtein+Distance"+with+best+performance+in+Javascript|offset|length|2058623^0|0|0|27|0|0^^$0|$1|$2|3|4|5|6|$7|8]]]|9|@$A|B|C|D|2|E|F|N|G|@]|H|@]|6|$]]|$A|I|C|J|2|E|F|O|G|@]|H|@$K|P|L|Q|A|R]]|6|$]]|$A|M|C|-4|2|E|F|S|G|@]|H|@]|6|$]]]]

You should try to compare the values using a similarity algorithm like the Damerau–Levenshtein distance. Here's an implementation in javascript: 

<a href="https://stackoverflow.com/questions/11919065/sort-an-array-by-the-levenshtein-distance-with-best-performance-in-javascript">Sort an array by the &quot;Levenshtein Distance&quot; with best performance in Javascript</a>

I want to perform permissive/lenient string comparison in JavaScript like this:

<pre><code>Morocco = Moroco = Moroko = Morokko = Marocco = Maroco
Russia = Rusia
US = USA
Bucharest = Buharest
Afghanistan = Afganistan
Bangkok = Bankok
etc..
</code></pre>

These comparisons will be used when operating with third-party APIs. I won't make any choices in my application based on them, but my goal is to provide the best options to the user. And the user will decide what's OK for him.

Would you point me the right way? The only idea comes to my mind is use character checksums and compare them. Maybe there could be better approach?

It would be nice also to get a "match integer" like:

<pre><code>var n = compare("Morocco", "Marocco"); // n = 95
var m = compare("Morocco", "Marokko"); // n = 85
</code></pre>

but how to do that?

Thanks.

Lenient string comparison

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

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

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

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

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

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

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

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

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

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

 我想在JavaScript中执行允许/宽松字符串比较，如下所示： Morocco = Moroco = Moroko = Morokko = Marocco = MarocoRussia = RusiaUS = USABucharest = BuharestAfghanistan = AfganistanBangko...

问宽松的字符串比较
EN

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问宽松的字符串比较EN