Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
habile (0) - 6 freq habble (1) - 2 freq halie (2) - 83 freq hailes (2) - 3 freq hazle (2) - 1 freq heile (2) - 1 freq dabble (2) - 2 freq anbile (2) - 1 freq habbie (2) - 9 freq rabble (2) - 10 freq table (2) - 674 freq babie (2) - 1 freq haill (2) - 411 freq mobile (2) - 57 freq haigle (2) - 1 freq hassle (2) - 20 freq bile (2) - 56 freq haime (2) - 26 freq yable (2) - 7 freq yabble (2) - 1 freq habbil (2) - 1 freq hail- (2) - 1 freq kamile (2) - 37 freq hanle (2) - 4 freq hawie (2) - 1 freq |
habile (0) - 6 freq habble (2) - 2 freq able (3) - 430 freq hail (3) - 259 freq haily (3) - 27 freq fable (3) - 8 freq hale (3) - 959 freq hazily (3) - 1 freq 'bile (3) - 2 freq gable (3) - 8 freq haunle (3) - 26 freq hubble (3) - 3 freq -able (3) - 1 freq hailie (3) - 9 freq cable (3) - 10 freq hamil (3) - 2 freq halle (3) - 4 freq hanle (3) - 4 freq habit (3) - 49 freq mable (3) - 2 freq sable (3) - 2 freq haill (3) - 411 freq mobile (3) - 57 freq haigle (3) - 1 freq habbie (3) - 9 freq |
SoundEx code - H140 huffily - 3 freq happily - 40 freq hauflie - 1 freq 'hevylie - 1 freq hayvul - 1 freq howpfully - 6 freq heavily - 8 freq hoopful - 3 freq habile - 6 freq hovel - 4 freq 'hovel' - 1 freq habble - 2 freq happilie - 1 freq howpfullie - 1 freq hubble - 3 freq habbil - 1 freq hoopfully - 2 freq hvl - 2 freq |
MetaPhone code - HBL habile - 6 freq habble - 2 freq hubble - 3 freq habbil - 1 freq |
HABILE |
Time to execute Levenshtein function - 0.200086 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.337219 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.027143 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.037261 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.000875 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. |