| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| redpath (0) - 2 freq redpath's (2) - 1 freq redials (3) - 1 freq reddish (3) - 1 freq redcoat (3) - 2 freq redcard (3) - 1 freq respite (3) - 4 freq neath (3) - 4 freq repaet (3) - 1 freq death (3) - 168 freq redraw (3) - 2 freq reach (3) - 143 freq teath (3) - 1 freq fitpath (3) - 4 freq depth (3) - 22 freq path (3) - 176 freq rewatch (3) - 1 freq empathy (3) - 7 freq i'path (3) - 1 freq repete (3) - 1 freq beath (3) - 3 freq repay (3) - 1 freq relate (3) - 15 freq repast (3) - 1 freq repeats (3) - 10 freq |
redpath (0) - 2 freq deepth (4) - 1 freq redpath's (4) - 1 freq ripeth (4) - 1 freq depth (4) - 22 freq haddath (5) - 25 freq redcoats (5) - 6 freq repeats (5) - 10 freq reddit (5) - 13 freq repute (5) - 12 freq rebirth (5) - 5 freq repeat (5) - 77 freq 'death (5) - 2 freq dath (5) - 1 freq reipit (5) - 2 freq repete (5) - 1 freq redit (5) - 2 freq creapeth (5) - 1 freq edith (5) - 18 freq path (5) - 176 freq repaet (5) - 1 freq respite (5) - 4 freq death (5) - 168 freq empathy (5) - 7 freq fitpath (5) - 4 freq |
SoundEx code - R313 redoubtable - 1 freq ratified - 9 freq red-tipped - 1 freq redpath's - 1 freq redpath - 2 freq rtepoetry - 1 freq |
MetaPhone code - RTP0 redpath - 2 freq |
REDPATH |
| Time to execute Levenshtein function - 0.192463 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.364605 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.028321 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.037722 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.000926 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. |