two sets of strings, how to compare the percentage they are the same?

Question

I have a set of strings that look like this,

{0:{question:"1f31f", answer:"1f31a"},1:{question:"1f32f", answer:"1fada"}}

I'm trying to use Javascript to show the percentage similarity between these strong strings - wondering if there's a simple way to do this?

Based on the index of the string, how many are correctly positioned.

good point. I suppose, based on the index of the string, how many are correct positioned. — LeCoda, Aug 19 '21 at 12:37
Typically the Levenstein algorithm is used to quantify similarities between string. Do a search on Google and you will find dozens of implementations. — I wrestled a bear once., Aug 19 '21 at 12:38
Does this answer your question? [Sort an array by the "Levenshtein Distance" with best performance in Javascript](https://stackoverflow.com/questions/11919065/sort-an-array-by-the-levenshtein-distance-with-best-performance-in-javascript) — I wrestled a bear once., Aug 19 '21 at 12:38

score 2 · Accepted Answer · answered Aug 19 '21 at 12:38

2

If the strings are always of the same length, consider calculating their Hamming distance. If they are not always of the same length, look into the Levenshtein distance.

answered Aug 19 '21 at 12:38

Alexander van Oostenrijk

4,644
3
23
37

always same length – LeCoda Aug 19 '21 at 12:43

bluejambo · Answer 2 · 2021-08-19T12:57:04.237

Since I don't know how complex you want your answer to be and others already provided some great methods, I figured I just submit the most simple, plain answer since sometimes that is all you need. Just comparing how many indices are the same:

let s1 = "1f31f";
let s2 = "1f31a"
let s3 = "1fada";

compare(s1, s2);
compare(s1, s3);

function compare(s1, s2) {
  let correct = 0;
  for (let i = 0; i < s1.length; i++) {
    if (s1.charAt(i) == s2.charAt(i)) {
      correct += 1;
    }
  }

  console.log(((correct / s1.length) * 100) + "%");
}

two sets of strings, how to compare the percentage they are the same?

2 Answers2