| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rantin (0) - 9 freq ratin (1) - 1 freq ranin (1) - 1 freq mantin (1) - 1 freq cantin (1) - 4 freq santin (1) - 1 freq wantin (1) - 321 freq pantin (1) - 9 freq gantin (1) - 23 freq rantit (1) - 1 freq rantins (1) - 2 freq grantin (1) - 2 freq ranting (1) - 4 freq rentin (1) - 2 freq hantin (1) - 6 freq rankin (1) - 16 freq rangin (1) - 2 freq fantin (1) - 20 freq rantan (1) - 1 freq chantin (2) - 28 freq sartin (2) - 6 freq prancin (2) - 3 freq wankin (2) - 4 freq raitir (2) - 1 freq muntin (2) - 11 freq |
rantin (0) - 9 freq rentin (1) - 2 freq rantan (1) - 1 freq hantin (2) - 6 freq ranting (2) - 4 freq grantin (2) - 2 freq fantin (2) - 20 freq renton (2) - 4 freq rantins (2) - 2 freq rangin (2) - 2 freq rankin (2) - 16 freq cantin (2) - 4 freq mantin (2) - 1 freq rantit (2) - 1 freq ratin (2) - 1 freq santin (2) - 1 freq ranin (2) - 1 freq gantin (2) - 23 freq pantin (2) - 9 freq wantin (2) - 321 freq jauntin (3) - 1 freq huntin (3) - 66 freq ration (3) - 4 freq sauntin (3) - 1 freq rinkin (3) - 1 freq |
SoundEx code - R535 random-rooble - 1 freq rantin - 9 freq renton - 4 freq rantan - 1 freq random - 35 freq rantins - 2 freq rentin - 2 freq 'random - 1 freq run-o-the-mill - 1 freq randan - 5 freq ran-dan - 2 freq randomly - 3 freq run-doon - 2 freq rin-doon - 1 freq roondness - 1 freq roondan - 4 freq 'rum-tum-tum-tiddle-um - 1 freq rum-tum-tum-tiddle-um - 1 freq ruinaetion - 1 freq ranting - 4 freq randiness - 1 freq roondin - 1 freq reunitin - 1 freq rain-daunce - 1 freq room-temperature-runny - 1 freq renationalisin - 1 freq renting - 2 freq renton'll - 1 freq rhymetime - 1 freq reuniting - 1 freq rantinrovin - 1 freq rhondamckenna - 2 freq |
MetaPhone code - RNTN rantin - 9 freq renton - 4 freq rantan - 1 freq rentin - 2 freq randan - 5 freq ran-dan - 2 freq run-doon - 2 freq rin-doon - 1 freq roondan - 4 freq roondin - 1 freq reunitin - 1 freq |
RANTIN |
| Time to execute Levenshtein function - 0.188770 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.340583 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.028141 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.037919 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.000866 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. |