| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| weel-leart (0) - 1 freq weel-meant (2) - 2 freq weel-lairt (2) - 1 freq weel-leared (2) - 3 freq weel-luvit (3) - 1 freq weel-lairnt (3) - 2 freq weel-likit (3) - 1 freq weel-kent (3) - 79 freq weel-tellt (3) - 2 freq weel-lared (3) - 4 freq weel-kept (3) - 2 freq weel-kennt (3) - 15 freq weel-luved (4) - 1 freq weel-sawn (4) - 1 freq weelkeent (4) - 1 freq weel-bein (4) - 5 freq willyart (4) - 7 freq weil-lared (4) - 1 freq weel-earned (4) - 2 freq weel-luckit (4) - 3 freq weel-ordert (4) - 1 freq leal-hert (4) - 1 freq weel-keepit (4) - 1 freq weel-fed (4) - 2 freq weelkent (4) - 1 freq |
weel-leart (0) - 1 freq weel-lairt (2) - 1 freq weel-leared (3) - 3 freq weel-likit (4) - 1 freq weel-lared (4) - 4 freq weel-lairnt (4) - 2 freq weel-meant (4) - 2 freq weel-luvit (4) - 1 freq wullyart (5) - 1 freq willyart (5) - 7 freq weil-lared (5) - 1 freq weel-kept (5) - 2 freq weel-kent (5) - 79 freq weel-tellt (5) - 2 freq weel-heukit (6) - 1 freq wud-feart (6) - 1 freq weel-cut (6) - 1 freq weel-usit (6) - 1 freq weel-worn (6) - 3 freq weel-built (6) - 1 freq weel-cared (6) - 1 freq weel-loved (6) - 1 freq weel-iled (6) - 1 freq ill-leirit (6) - 1 freq weel-faur (6) - 1 freq |
SoundEx code - W463 weel-ordert - 1 freq 'willard - 1 freq willyart - 7 freq woolworths - 1 freq weel-wared - 2 freq wullyard - 1 freq weel-leared - 3 freq wullyart - 1 freq weel-rade - 1 freq weill-wurdie - 1 freq weill-airtit - 1 freq weil-lared - 1 freq weel-lairt - 1 freq weill-hertitness - 1 freq willyart-lik - 1 freq weel-lared - 4 freq weel-leart - 1 freq wooliered - 1 freq willreid - 13 freq |
MetaPhone code - WLLRT weel-leared - 3 freq weil-lared - 1 freq weel-lairt - 1 freq weel-lared - 4 freq weel-leart - 1 freq |
WEEL-LEART |
| Time to execute Levenshtein function - 0.206467 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.359683 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.029122 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.037955 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.000989 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. |