| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jethart (0) - 6 freq jeddart (2) - 2 freq gethirt (2) - 1 freq tethert (2) - 2 freq jethro (2) - 2 freq gethert (2) - 41 freq fethert (2) - 1 freq mithert (3) - 1 freq retort (3) - 3 freq beart (3) - 1 freq aether (3) - 1 freq -that (3) - 1 freq wishart (3) - 19 freq eethir (3) - 10 freq netwark (3) - 2 freq owthar (3) - 5 freq athwart (3) - 6 freq thar (3) - 102 freq edwart (3) - 5 freq owthars (3) - 2 freq eidart (3) - 1 freq €¦that (3) - 2 freq ether (3) - 26 freq bethern (3) - 1 freq 'that (3) - 72 freq |
jethart (0) - 6 freq fethert (3) - 1 freq jethro (3) - 2 freq gethert (3) - 41 freq tethert (3) - 2 freq gethirt (3) - 1 freq bathert (4) - 11 freq weathert (4) - 1 freq athort (4) - 122 freq bothert (4) - 37 freq githert (4) - 3 freq soothart (4) - 1 freq withert (4) - 4 freq authort (4) - 2 freq bithert (4) - 2 freq gathert (4) - 3 freq leathert (4) - 1 freq dithert (4) - 1 freq mithert (4) - 1 freq jeddart (4) - 2 freq wuthert (4) - 7 freq nithert (4) - 2 freq orchart (5) - 9 freq ootwart (5) - 2 freq thwart (5) - 1 freq |
SoundEx code - J363 jethart - 6 freq jeddart - 2 freq jcdrytr - 1 freq joedwards - 10 freq jethrotull - 1 freq |
MetaPhone code - J0RT gethert - 41 freq gethered - 8 freq githered - 18 freq githert - 3 freq gethirt - 1 freq jethart - 6 freq |
JETHART |
| Time to execute Levenshtein function - 0.180350 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.321553 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.031070 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.036870 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.000842 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. |