is there a way to see what is most closely related to a given string in an array?

Asked Sep 18 '20 at 23:48

Active Sep 19 '20 at 00:01

Viewed 42 times

I mean like even if you misspell Pikachi it auto corrects to Pikachu because its the most closely related

For example

let array = ["Pikachu","Rawrr","Squirtle]
let string = "Pikachi"
function(string) // will return "Pikachu"

In my case, I gave the string Pikachi and it was most related to Pikachu and it does not match any string in the array so it chose that. How can I do this in javascript?

asked Sep 18 '20 at 23:48

king

Consider factoring in the concept of edit distance perhaps? The one with minimum edit distance matches most closely – Sнаđошƒаӽ Sep 18 '20 at 23:50
search `levenshtein javascript`, quite a few packages out there – Lawrence Cherone Sep 18 '20 at 23:52
@Lawrence Cherone do you think using a package would be the fastest option? – king Sep 18 '20 at 23:53
define fastest? writing it yourself, running or installing? there is other examples/snippets you could use https://gist.github.com/andrei-m/982927 – Lawrence Cherone Sep 18 '20 at 23:55
Ill try to implement a test using it right now – king Sep 18 '20 at 23:59
I jumped the gun on duping it was a PHP one, but here is one in js: https://stackoverflow.com/questions/11919065/sort-an-array-by-the-levenshtein-distance-with-best-performance-in-javascript/11958496 – Lawrence Cherone Sep 19 '20 at 00:00
1

using linked dupes function, it doesn't show an example to sort, so here is one: https://playcode.io/674126/ - could answer but think it's bad form – Lawrence Cherone Sep 19 '20 at 00:36

is there a way to see what is most closely related to a given string in an array?

0 Answers0