Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
retiredgreyhound (0) - 2 freq adoptagreyhound (7) - 1 freq greyhound (7) - 3 freq retirement (8) - 17 freq deerhound (8) - 1 freq fairground (8) - 1 freq foreground (8) - 1 freq neirhaund (9) - 1 freq croquetground (9) - 1 freq retributioun (9) - 1 freq strangehold (9) - 1 freq retired (9) - 42 freq retrograwd (9) - 1 freq retirement's (9) - 1 freq unitedrewind (9) - 1 freq leather-bound (9) - 3 freq efterhaund (9) - 4 freq nearesthaund (9) - 1 freq releigioun (9) - 4 freq foregrund (9) - 1 freq retreaded (9) - 1 freq deerhund (9) - 1 freq reteired (9) - 3 freq tradeetioun (9) - 2 freq rewerend (9) - 1 freq |
retiredgreyhound (0) - 2 freq greyhound (11) - 3 freq adoptagreyhound (11) - 1 freq retrograwd (12) - 1 freq fairground (12) - 1 freq foreground (12) - 1 freq deerhound (12) - 1 freq underground (13) - 8 freq efterhaund (13) - 4 freq foregrund (13) - 1 freq deerhund (13) - 1 freq retrograde (13) - 1 freq unitedrewind (13) - 1 freq retreaded (13) - 1 freq strengthened (13) - 1 freq strangehold (13) - 1 freq retirement (13) - 17 freq strengthen (14) - 2 freq returned (14) - 48 freq trudged (14) - 6 freq unnergroond (14) - 2 freq tradeeshin (14) - 1 freq reverend (14) - 40 freq warld-renouned (14) - 1 freq strengthens (14) - 2 freq |
SoundEx code - R363 retorts - 2 freq retard - 2 freq retired - 42 freq retreat - 26 freq retorted - 5 freq retirt - 1 freq rotterdam - 7 freq retort - 3 freq retortit - 2 freq retirit - 3 freq retreating - 1 freq retards - 1 freq rudyard - 2 freq retreatit - 7 freq retoured - 14 freq retreat't - 1 freq roadworthy - 2 freq reteired - 3 freq ratrettit - 1 freq rid-haired - 1 freq rid-rid - 1 freq retreatin - 1 freq retourt - 1 freq retiret - 1 freq rotary-dial - 1 freq retir't - 1 freq radioruderham - 1 freq rtreyd - 1 freq retreaded - 1 freq rethered - 1 freq ruthieredart - 10 freq retiredgreyhound - 2 freq |
MetaPhone code - RTRTKRHN |
RETIREDGREYHOUND |
Time to execute Levenshtein function - 0.492043 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.697228 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.060218 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.039732 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.000950 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. |