| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rothesfc (0) - 1 freq rothes (2) - 1 freq rothesay (2) - 4 freq ro'hes (3) - 1 freq rowthness (4) - 1 freq dothers (4) - 5 freq rither (4) - 6 freq rossmc (4) - 1 freq roves (4) - 1 freq robes (4) - 7 freq bathes (4) - 1 freq broths (4) - 1 freq nottesed (4) - 1 freq fotees (4) - 3 freq othe (4) - 4 freq dother's (4) - 1 freq bother (4) - 329 freq potless (4) - 1 freq rote (4) - 2 freq noties (4) - 2 freq rochles (4) - 1 freq notes (4) - 117 freq prophesy (4) - 1 freq lathes (4) - 1 freq other (4) - 579 freq |
rothesfc (0) - 1 freq rothesay (4) - 4 freq rothes (4) - 1 freq ruths (6) - 2 freq ro'hes (6) - 1 freq writhes (7) - 1 freq bathetic (7) - 1 freq routes (7) - 11 freq rethered (7) - 1 freq ruth's (7) - 4 freq theft (7) - 12 freq retches (7) - 1 freq rathsmen (7) - 1 freq rots (7) - 4 freq roth (7) - 2 freq rashes (7) - 30 freq rushes (7) - 20 freq crathes (7) - 1 freq bothies (7) - 13 freq these (7) - 1129 freq tithes (7) - 2 freq pathetic (7) - 28 freq gothic (7) - 5 freq rates (7) - 18 freq ruther's (7) - 1 freq |
SoundEx code - R321 rid-specklt - 1 freq rediscovered - 3 freq rediscover - 2 freq rediscoveran - 1 freq ritesopassageken - 1 freq rdsbzk - 1 freq rdgfoj - 1 freq rdeycbfgrp - 1 freq rothesfc - 1 freq |
MetaPhone code - R0SFK rothesfc - 1 freq |
ROTHESFC |
| Time to execute Levenshtein function - 0.209473 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.371479 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.027116 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.037159 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.000997 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. |