| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| re-focuses (0) - 1 freq refuses (3) - 17 freq focuses (3) - 2 freq refuse (4) - 25 freq refused (4) - 41 freq responses (4) - 12 freq crocuses (4) - 2 freq rescues (4) - 1 freq excuses (4) - 25 freq re-freezes (4) - 1 freq focused (4) - 27 freq refaised (5) - 1 freq refusal (5) - 2 freq reckonise (5) - 1 freq rescuers (5) - 2 freq retches (5) - 1 freq reliques (5) - 1 freq elocuted (5) - 1 freq relocate (5) - 2 freq rescoursed (5) - 4 freq becouse (5) - 2 freq restores (5) - 2 freq refuted (5) - 1 freq defuse (5) - 2 freq confuses (5) - 3 freq |
re-focuses (0) - 1 freq focuses (5) - 2 freq refuses (5) - 17 freq re-freezes (6) - 1 freq recess (7) - 3 freq focused (7) - 27 freq rescues (7) - 1 freq excuses (7) - 25 freq crocuses (7) - 2 freq refuse (7) - 25 freq refused (7) - 41 freq responses (7) - 12 freq re-cut (8) - 1 freq recesses (8) - 4 freq tea-houss (8) - 1 freq recoorse (8) - 1 freq ruses (8) - 1 freq infuses (8) - 1 freq focussed (8) - 8 freq realises (8) - 9 freq refusit (8) - 6 freq defenses (8) - 1 freq circuses (8) - 1 freq reinforces (8) - 2 freq refuised (8) - 1 freq |
SoundEx code - R122 refugees - 15 freq ravages - 2 freq rubbish-cowp - 1 freq rapacious - 5 freq refuses - 17 freq ribcage - 2 freq repossessed - 2 freq re-focuses - 1 freq raiphsays - 97 freq rebeccahislop - 1 freq |
MetaPhone code - RFKSS re-focuses - 1 freq |
RE-FOCUSES |
| Time to execute Levenshtein function - 0.257951 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 0.422927 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.037916 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.039577 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.001003 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |