Home/ Questions/Q 8426983
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-06-10T04:40:42+00:00

I’m looking for a way to compare 2 strings partial. I need to clear

  • 0

I’m looking for a way to compare 2 strings partial. I need to clear this with an example.

The base string is “equality”.
The string I need to check is spelled wrong: “equallaty”. I want to conform this is partially correct so the input, even not right in a grammar way, is the same as the base string.

Now I can of course parse the string to an char array. Now I can check every single character, but if I check the first 4 characters they will be right, the rest will be wrong even if there are only 2 mistakes. So the check I want to use is that a minimum of 70 procent of the characters should match.

Is anyone able to help me get on the right track?

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    Compare the strings with an edit-distance metric like the Levenshtein distance. Such a metric basically counts the number of changes needed to make the strings equal. If the number of changes is small relative to the total size of the string, then you can consider the strings similar.

    • 0