| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| reenges (0) - 4 freq reenge (1) - 60 freq reengers (1) - 2 freq breenges (1) - 10 freq reengs (1) - 1 freq reinges (1) - 5 freq reenger (1) - 1 freq creenges (1) - 1 freq reenged (1) - 8 freq reengin (2) - 34 freq peenies (2) - 7 freq keengs (2) - 5 freq revenge (2) - 23 freq beenge (2) - 1 freq weenged (2) - 1 freq reeng (2) - 3 freq henges (2) - 1 freq reeves (2) - 5 freq feenger (2) - 1 freq reings (2) - 2 freq breenge (2) - 27 freq reinged (2) - 5 freq ranges (2) - 2 freq meentes (2) - 1 freq creenged (2) - 2 freq |
reenges (0) - 4 freq reengs (1) - 1 freq reinges (1) - 5 freq reenged (2) - 8 freq reings (2) - 2 freq reneges (2) - 1 freq creenges (2) - 1 freq ranges (2) - 2 freq reengers (2) - 2 freq reenger (2) - 1 freq breenges (2) - 10 freq reenge (2) - 60 freq reengin (3) - 34 freq rennies (3) - 4 freq reinge (3) - 27 freq weengs (3) - 9 freq oranges (3) - 7 freq raenge (3) - 1 freq reinged (3) - 5 freq rungs (3) - 3 freq reeng (3) - 3 freq rangs (3) - 2 freq rings (3) - 112 freq henges (3) - 1 freq raings (3) - 1 freq |
SoundEx code - R522 rinses - 1 freq ramshackle - 6 freq ransacked - 2 freq ramseys - 1 freq rummages - 1 freq ringostar - 2 freq 'ramshackle - 1 freq reenges - 4 freq runcigill - 1 freq ranges - 2 freq ramsay's - 6 freq raingeese - 1 freq reinges - 5 freq ransack - 1 freq reimishis - 1 freq reneges - 1 freq re-engaged - 1 freq ransackin - 1 freq ryankeckler - 1 freq ronnycostello - 1 freq renniesusanc - 12 freq renniesusanc's - 1 freq ryanmcguigan - 1 freq |
MetaPhone code - RNJS reenges - 4 freq ranges - 2 freq wrangeous - 1 freq raingeese - 1 freq reinges - 5 freq reneges - 1 freq |
REENGES |
| Time to execute Levenshtein function - 0.211016 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.343997 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.027471 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.037199 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.000873 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. |