| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jeddart (0) - 2 freq edwart (2) - 5 freq jethart (2) - 6 freq teddirt (2) - 1 freq teddert (2) - 2 freq geddert (2) - 1 freq eidart (2) - 1 freq seawart (3) - 4 freq ledder (3) - 23 freq leopart (3) - 1 freq redars (3) - 1 freq stoddart (3) - 4 freq nedder (3) - 18 freq heart (3) - 184 freq heddir (3) - 4 freq hodgart (3) - 1 freq heddit (3) - 1 freq dart (3) - 16 freq edder (3) - 21 freq weeda't (3) - 1 freq laddert (3) - 1 freq redder (3) - 15 freq reddir (3) - 6 freq ledars (3) - 1 freq peart (3) - 1 freq |
jeddart (0) - 2 freq teddert (3) - 2 freq teddirt (3) - 1 freq geddert (3) - 1 freq laddert (4) - 1 freq jethart (4) - 6 freq edwart (4) - 5 freq eidart (4) - 1 freq tedders (5) - 1 freq eddir (5) - 10 freq eddir' (5) - 1 freq feddit (5) - 1 freq landart (5) - 2 freq wedder (5) - 3 freq tedder (5) - 2 freq reddit (5) - 13 freq kineddart (5) - 4 freq fedders (5) - 21 freq fedder (5) - 36 freq beddit (5) - 16 freq hedder (5) - 11 freq suddarts (5) - 1 freq ledders (5) - 2 freq neddir (5) - 3 freq depart (5) - 7 freq |
SoundEx code - J363 jethart - 6 freq jeddart - 2 freq jcdrytr - 1 freq joedwards - 10 freq jethrotull - 1 freq |
MetaPhone code - JTRT geddert - 1 freq geddered - 1 freq jeddart - 2 freq |
JEDDART |
| Time to execute Levenshtein function - 0.204958 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.358150 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.027483 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.045110 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.000922 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. |