| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| willyart (0) - 7 freq wullyart (1) - 1 freq wullyard (2) - 1 freq billiart (2) - 1 freq willnae (3) - 101 freq 'willard (3) - 1 freq millya (3) - 1 freq willa (3) - 3 freq lyart (3) - 7 freq sillert (3) - 1 freq willit (3) - 1 freq unlyart (3) - 1 freq william' (3) - 4 freq pillars (3) - 12 freq millport (3) - 1 freq pillar (3) - 15 freq william (3) - 239 freq sillars (3) - 2 freq fullyary (3) - 1 freq willae (3) - 2 freq williams (3) - 32 freq tullyard (3) - 2 freq willans (3) - 1 freq misleart (3) - 1 freq collart (3) - 1 freq |
willyart (0) - 7 freq wullyart (1) - 1 freq billiart (3) - 1 freq wullyard (3) - 1 freq walmart (4) - 1 freq sillert (4) - 1 freq willint (4) - 5 freq willit (4) - 1 freq collart (4) - 1 freq millar (5) - 11 freq wishart (5) - 19 freq wallopit (5) - 1 freq will'a (5) - 1 freq billiard (5) - 1 freq allyat (5) - 2 freq willan (5) - 5 freq willreid (5) - 13 freq wildcat (5) - 1 freq wullt (5) - 1 freq gullert (5) - 18 freq weel-leart (5) - 1 freq wallet (5) - 23 freq bullert (5) - 2 freq wullint (5) - 1 freq wallit (5) - 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 - WLYRT willyart - 7 freq wullyard - 1 freq wullyart - 1 freq |
WILLYART |
| Time to execute Levenshtein function - 0.182915 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.349061 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.032029 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.041678 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.000950 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. |