Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
weel-airmed (0) - 2 freq weel-lairned (2) - 1 freq weel-wirked (2) - 1 freq weel-lared (3) - 4 freq weel-yaised (3) - 2 freq weel-earned (3) - 2 freq weel-rigged (3) - 1 freq weel-faured (3) - 3 freq weel-iled (3) - 1 freq well-formed (3) - 1 freq weel-cared (3) - 1 freq weel-armit (3) - 1 freq weel-uised (3) - 1 freq weel-wared (3) - 2 freq alairmed (4) - 2 freq weel-kenned (4) - 1 freq weel-leared (4) - 3 freq weel-luved (4) - 1 freq weil-faured (4) - 1 freq weel-heeled (4) - 1 freq weil-lared (4) - 1 freq weel-thoomed (4) - 1 freq declaimed (4) - 1 freq weel-lo'ed (4) - 1 freq weel-chowed (4) - 1 freq |
weel-airmed (0) - 2 freq weel-earned (4) - 2 freq weel-wirked (4) - 1 freq weel-armit (4) - 1 freq weel-lairned (4) - 1 freq weel-cared (5) - 1 freq weel-groomed (5) - 1 freq well-formed (5) - 1 freq weel-wared (5) - 2 freq weel-uised (5) - 1 freq weel-iled (5) - 1 freq weel-rigged (5) - 1 freq weel-yaised (5) - 2 freq weel-faured (5) - 3 freq weel-lared (5) - 4 freq weel-used (6) - 1 freq weel-tuned (6) - 1 freq weel-fed (6) - 2 freq weel-rade (6) - 1 freq weel-looed (6) - 1 freq weel-trained (6) - 2 freq weel-loved (6) - 1 freq grey-armed (6) - 1 freq weill-airmit (6) - 1 freq weelthoumed (6) - 1 freq |
SoundEx code - W465 weel-worn - 3 freq weel-lairnt - 2 freq weel-armit - 1 freq weel-airmed - 2 freq weel-earned - 2 freq weill-roundit - 1 freq weel-lairned - 1 freq weill-airmit - 1 freq well-worn - 1 freq |
MetaPhone code - WLRMT weel-armit - 1 freq weel-airmed - 2 freq weill-airmit - 1 freq |
WEEL-AIRMED |
Time to execute Levenshtein function - 0.278267 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.603570 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.028410 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.073113 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.000883 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. |