Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
weel-loved (0) - 1 freq weel-looed (1) - 1 freq weel-luved (1) - 1 freq weel-lo'ed (1) - 1 freq weel-lared (2) - 4 freq best-loved (3) - 2 freq weel-cared (3) - 1 freq weil-lared (3) - 1 freq weel-fed (3) - 2 freq weel-wared (3) - 2 freq weel-chowed (3) - 1 freq weel-luvit (3) - 1 freq weel-leared (3) - 3 freq weel-waled (3) - 1 freq weel-tuned (3) - 1 freq weel-iled (3) - 1 freq weel-uised (3) - 1 freq weel-used (3) - 1 freq best-loed (4) - 1 freq jeellied (4) - 1 freq weel-lairt (4) - 1 freq weel-chosen (4) - 1 freq weel-made (4) - 1 freq weel-likit (4) - 1 freq weel-on (4) - 1 freq |
weel-loved (0) - 1 freq weel-luved (1) - 1 freq weel-looed (2) - 1 freq weel-lo'ed (2) - 1 freq weel-lared (3) - 4 freq weel-luvit (4) - 1 freq weel-iled (4) - 1 freq weel-leared (4) - 3 freq weil-lared (4) - 1 freq weel-tuned (5) - 1 freq weel-used (5) - 1 freq weel-uised (5) - 1 freq weel-waled (5) - 1 freq weel-fed (5) - 2 freq weel-wared (5) - 2 freq weel-cared (5) - 1 freq re-lived (6) - 1 freq weel-heeled (6) - 1 freq weel-faured (6) - 3 freq weel-earned (6) - 2 freq wallowed (6) - 1 freq welled (6) - 1 freq weelpleased (6) - 1 freq weel-airmed (6) - 2 freq weel-lairned (6) - 1 freq |
SoundEx code - W413 weel-happit - 3 freq weel-luved - 1 freq weel-fittit - 1 freq whalpit - 4 freq wolfit - 1 freq weel-loved - 1 freq walloped - 7 freq welliebuits - 1 freq weel-fed - 2 freq wolfed - 5 freq weillfettilt - 1 freq well-paid - 1 freq weill-wappit - 1 freq wallopit - 1 freq weel-luvit - 1 freq weill-fed - 1 freq |
MetaPhone code - WLLFT weel-luved - 1 freq weel-loved - 1 freq weel-luvit - 1 freq |
WEEL-LOVED |
Time to execute Levenshtein function - 0.322889 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.609783 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.059094 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.037701 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.000851 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. |