| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ytpyt (0) - 1 freq ytt (2) - 1 freq ytp (2) - 5 freq ytgt (2) - 1 freq tiyt (2) - 1 freq pyt (2) - 2 freq dopyt (2) - 1 freq ygt (3) - 1 freq steyd (3) - 9 freq pleyt (3) - 1 freq ydp (3) - 1 freq pyg (3) - 1 freq yolt (3) - 1 freq 'thy' (3) - 2 freq 'telt (3) - 1 freq tatt (3) - 1 freq yaist (3) - 21 freq ypiy (3) - 1 freq tippt (3) - 1 freq tpea (3) - 1 freq yappit (3) - 1 freq ykypy (3) - 1 freq yset (3) - 2 freq ettlt (3) - 21 freq yat (3) - 1 freq |
ytpyt (0) - 1 freq output (3) - 2 freq ootput (3) - 2 freq tipt (3) - 1 freq ootpit (3) - 28 freq dopyt (3) - 1 freq typit (3) - 3 freq ytgt (3) - 1 freq ytt (3) - 1 freq pyt (3) - 2 freq ytp (3) - 5 freq tiyt (3) - 1 freq tot (4) - 4 freq tumt (4) - 1 freq tout (4) - 3 freq thit (4) - 568 freq 'pit (4) - 15 freq pupit (4) - 1 freq telt (4) - 1569 freq thut (4) - 29 freq tant (4) - 1 freq tilt (4) - 30 freq stopt (4) - 5 freq sypit (4) - 2 freq wipit (4) - 5 freq |
SoundEx code - Y313 ytpyt - 1 freq |
MetaPhone code - TPT dippit - 12 freq tippit - 10 freq dipped - 23 freq teapot - 10 freq tiptoe - 6 freq tipped - 14 freq tiptae - 6 freq daupit - 3 freq tapped - 17 freq dowpit - 26 freq taypot - 5 freq typit - 3 freq toppet - 2 freq taupit - 1 freq deputy - 6 freq toppit - 1 freq tappit - 6 freq dappit - 1 freq typed - 10 freq doped - 2 freq taped - 4 freq 'dippit - 1 freq topped - 1 freq taepot - 1 freq taptoo - 1 freq tapp't - 1 freq toppd - 1 freq depute - 21 freq tippt - 1 freq tippytae - 1 freq tap-aat - 1 freq dept - 7 freq depot - 1 freq teapit - 1 freq doupit - 1 freq dowped - 1 freq tipt - 1 freq dawpit - 1 freq tea-pat - 1 freq tepid - 1 freq ytpyt - 1 freq dpd - 1 freq tpwd - 1 freq twhpt - 1 freq dopyt - 1 freq tapadh - 1 freq |
YTPYT |
| Time to execute Levenshtein function - 0.384381 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.704516 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.076078 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.040958 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.000910 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. |