| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| refuses (0) - 17 freq refused (1) - 41 freq refuse (1) - 25 freq infuses (2) - 1 freq reeses (2) - 1 freq refuise (2) - 1 freq defuse (2) - 2 freq refugee (2) - 5 freq refusit (2) - 6 freq fuses (2) - 1 freq refuted (2) - 1 freq reuse (2) - 2 freq ruses (2) - 1 freq refusal (2) - 2 freq reduces (2) - 1 freq rufus's (2) - 1 freq refuge (2) - 6 freq refugees (2) - 15 freq refusin (2) - 16 freq refuised (2) - 1 freq rises (3) - 42 freq tresses (3) - 1 freq reassess (3) - 1 freq rennies (3) - 4 freq reuls (3) - 2 freq |
refuses (0) - 17 freq refuse (2) - 25 freq refused (2) - 41 freq ruses (3) - 1 freq rufus's (3) - 1 freq refusin (3) - 16 freq refuised (3) - 1 freq fuses (3) - 1 freq refugees (3) - 15 freq refusal (3) - 2 freq infuses (3) - 1 freq refuise (3) - 1 freq reeses (3) - 1 freq refusit (3) - 6 freq fuss (4) - 20 freq refaised (4) - 1 freq refers (4) - 27 freq raises (4) - 24 freq ruises (4) - 1 freq refeese (4) - 1 freq refaise (4) - 1 freq rinses (4) - 1 freq recess (4) - 3 freq rifles (4) - 13 freq roses (4) - 102 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 - RFSS refuses - 17 freq rufus's - 1 freq raiphsays - 97 freq |
REFUSES |
| Time to execute Levenshtein function - 0.181672 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.329647 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.027828 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.037214 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.000923 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. |