| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| refugees (0) - 15 freq refugee (1) - 5 freq refuses (2) - 17 freq referees (2) - 2 freq refuge (2) - 6 freq refleks (3) - 1 freq reflexes (3) - 1 freq refuise (3) - 1 freq reinges (3) - 5 freq reengers (3) - 2 freq refused (3) - 41 freq reuters (3) - 6 freq refters (3) - 1 freq refuted (3) - 1 freq reneges (3) - 1 freq reduces (3) - 1 freq requires (3) - 10 freq refuised (3) - 1 freq refereed (3) - 1 freq reenges (3) - 4 freq refers (3) - 27 freq referee (3) - 15 freq refuse (3) - 25 freq refeese (3) - 1 freq refunded (3) - 1 freq |
refugees (0) - 15 freq refugee (2) - 5 freq refuge (3) - 6 freq referees (3) - 2 freq refuses (3) - 17 freq refuse (4) - 25 freq refeese (4) - 1 freq refers (4) - 27 freq reneges (4) - 1 freq reenges (4) - 4 freq refuise (4) - 1 freq reinges (4) - 5 freq rogueys (5) - 1 freq reengs (5) - 1 freq reings (5) - 2 freq ruggs (5) - 2 freq rages (5) - 9 freq refaise (5) - 1 freq reefs (5) - 6 freq rufus (5) - 5 freq rugas (5) - 1 freq rugs (5) - 10 freq ravages (5) - 2 freq ranges (5) - 2 freq rifles (5) - 13 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 - RFJS refugees - 15 freq ravages - 2 freq |
REFUGEES |
| Time to execute Levenshtein function - 0.202289 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.498836 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.027849 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.077278 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.000898 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. |