| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| reinges (0) - 5 freq reinge (1) - 27 freq reenges (1) - 4 freq reinged (1) - 5 freq reings (1) - 2 freq reined (2) - 2 freq ringed (2) - 7 freq hinges (2) - 19 freq ringer (2) - 6 freq reives (2) - 2 freq ranges (2) - 2 freq fringes (2) - 2 freq reenged (2) - 8 freq reinnen (2) - 1 freq keing's (2) - 15 freq cringes (2) - 1 freq breinge (2) - 7 freq rinses (2) - 1 freq breinged (2) - 6 freq reengs (2) - 1 freq henges (2) - 1 freq reenger (2) - 1 freq reenge (2) - 60 freq keings (2) - 9 freq peinge (2) - 1 freq |
reinges (0) - 5 freq reings (1) - 2 freq reenges (1) - 4 freq reneges (2) - 1 freq reinge (2) - 27 freq ranges (2) - 2 freq raings (2) - 1 freq rings (2) - 112 freq reinged (2) - 5 freq reengs (2) - 1 freq reing (3) - 2 freq oranges (3) - 7 freq ridges (3) - 6 freq breenges (3) - 10 freq reingin (3) - 1 freq binges (3) - 1 freq reins (3) - 21 freq beings (3) - 4 freq rungs (3) - 3 freq raingeese (3) - 1 freq neiges (3) - 1 freq rangs (3) - 2 freq reengers (3) - 2 freq creenges (3) - 1 freq rennies (3) - 4 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 |
REINGES |
| Time to execute Levenshtein function - 0.249973 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.462184 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.027710 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.040162 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.000912 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. |