| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| reengers (0) - 2 freq reenger (1) - 1 freq feengers (1) - 1 freq reenges (1) - 4 freq screengers (2) - 1 freq reevlers (2) - 4 freq breenger (2) - 1 freq rangers (2) - 55 freq wheengers (2) - 1 freq reenge (2) - 60 freq reinges (2) - 5 freq renders (2) - 2 freq teegers (2) - 36 freq streengers (2) - 2 freq deeners (2) - 1 freq avengers (2) - 2 freq feenger (2) - 1 freq creenges (2) - 1 freq reengs (2) - 1 freq feengert (2) - 1 freq teenagers (2) - 10 freq breenges (2) - 10 freq reenged (2) - 8 freq weengs (3) - 9 freq reengin (3) - 34 freq |
reengers (0) - 2 freq reenger (2) - 1 freq rangers (2) - 55 freq reenges (2) - 4 freq feengers (2) - 1 freq renders (3) - 2 freq reinges (3) - 5 freq reengs (3) - 1 freq avengers (3) - 2 freq teenagers (3) - 10 freq hangers (4) - 1 freq dingers (4) - 3 freq ranger (4) - 8 freq singers (4) - 55 freq cringers (4) - 2 freq reings (4) - 2 freq rangers' (4) - 1 freq mangers (4) - 1 freq ruggers (4) - 1 freq loungers (4) - 2 freq fngers (4) - 1 freq rendirs (4) - 2 freq wingers (4) - 1 freq dangers (4) - 11 freq youngers (4) - 1 freq |
SoundEx code - R526 rangers - 55 freq ramskeerie - 1 freq ringer - 6 freq reengers - 2 freq reincarnated - 1 freq ranger - 8 freq rhinoceros - 1 freq rangers' - 1 freq rhinocerous - 1 freq rancour - 2 freq reincarnation - 2 freq reenger - 1 freq ring-a-ring-a - 1 freq €˜rangers - 1 freq rangersfc - 11 freq rangersdied - 1 freq rangersbanter - 1 freq rncgkrzqza - 1 freq ronniegraham - 1 freq rangersclips - 1 freq raymcgrath - 2 freq ryankearney - 1 freq 'rangers - 1 freq |
MetaPhone code - RNJRS rangers - 55 freq reengers - 2 freq rangers' - 1 freq €˜rangers - 1 freq 'rangers - 1 freq |
REENGERS |
| Time to execute Levenshtein function - 0.317289 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.464973 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.029560 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.038993 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.000932 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. |