Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
hbovftataj (0) - 1 freq bottam (5) - 3 freq horchata (5) - 2 freq potata (5) - 1 freq boyata (5) - 1 freq bolotana (5) - 1 freq howgate (6) - 2 freq abortit (6) - 2 freq bafta (6) - 1 freq tomata (6) - 5 freq hostipal (6) - 2 freq hallstaan (6) - 1 freq bottil (6) - 6 freq bottem (6) - 1 freq bàstat' (6) - 1 freq hottit (6) - 1 freq blottan (6) - 1 freq sottar (6) - 10 freq hoatch (6) - 1 freq boatman (6) - 1 freq brettan (6) - 1 freq botany (6) - 3 freq botswanan (6) - 1 freq boatle (6) - 12 freq abott (6) - 2 freq |
hbovftataj (0) - 1 freq habitats (9) - 4 freq hiftit (9) - 1 freq habitat (9) - 3 freq heftit (9) - 5 freq bottam (9) - 3 freq boattil (10) - 1 freq boattum (10) - 4 freq hesitate (10) - 10 freq hootit (10) - 2 freq 'beefeater (10) - 1 freq hesitatin (10) - 4 freq barfittit (10) - 1 freq botton (10) - 1 freq hesitates (10) - 1 freq bottul (10) - 1 freq bottom (10) - 161 freq hoastit (10) - 11 freq 'bottom (10) - 1 freq hesitated (10) - 11 freq befitted (10) - 1 freq befittin (10) - 2 freq botts (10) - 3 freq hivtae (10) - 1 freq huvtae (10) - 6 freq |
SoundEx code - H113 hauf-happit - 2 freq hippopotamus - 4 freq heavy-fittit - 1 freq hauf-howped - 1 freq hbovftataj - 1 freq |
MetaPhone code - BFFTTJ hbovftataj - 1 freq |
HBOVFTATAJ |
Time to execute Levenshtein function - 0.202134 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.364569 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.028234 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.038437 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.000889 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. |