Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
halikit (0) - 1 freq haikit (1) - 1 freq haliket (1) - 2 freq halakit (1) - 1 freq walkit (2) - 37 freq halibut (2) - 5 freq hankit (2) - 2 freq haipit (2) - 1 freq haikin (2) - 8 freq raikit (2) - 12 freq hallibit (2) - 1 freq likit (2) - 158 freq alikie (2) - 1 freq haltit (2) - 3 freq baikit (2) - 1 freq halpit (2) - 12 freq talkit (2) - 2 freq yalkit (2) - 1 freq maikit (2) - 1 freq vaikit (2) - 1 freq hainit (2) - 6 freq hackit (2) - 49 freq haitit (2) - 1 freq jaikit (2) - 16 freq hailit (2) - 1 freq |
halikit (0) - 1 freq haliket (1) - 2 freq halakit (1) - 1 freq haikit (2) - 1 freq yalkit (3) - 1 freq talkit (3) - 2 freq hackit (3) - 49 freq hawkit (3) - 1 freq harkit (3) - 10 freq haltit (3) - 3 freq hikit (3) - 2 freq hailit (3) - 1 freq halpit (3) - 12 freq halibut (3) - 5 freq likit (3) - 158 freq hankit (3) - 2 freq walkit (3) - 37 freq hokkit (4) - 1 freq hackt (4) - 1 freq haulit (4) - 3 freq claikit (4) - 2 freq lykit (4) - 5 freq glakit (4) - 4 freq liket (4) - 4 freq cleikit (4) - 12 freq |
SoundEx code - H423 hailsteens - 5 freq hailstanes - 2 freq heelster-gowdie - 6 freq hallockit - 7 freq heelster-gowdle - 1 freq hillside - 15 freq hillsides - 2 freq hilshed - 1 freq holiest - 2 freq holstered - 1 freq helcht - 1 freq halikit - 1 freq halakit - 1 freq heelstergoudie - 1 freq holistic - 4 freq hailstane - 1 freq haliket - 2 freq holo-exit - 3 freq heelster - 2 freq heelstergowdie - 7 freq 'hillside' - 1 freq hailsed - 2 freq hielichts - 1 freq hielicht - 3 freq hie-liggit - 1 freq hallstaan - 1 freq houliston - 2 freq halliget - 1 freq hailsteen - 1 freq hulsyde - 1 freq hulstert - 1 freq hailstones - 1 freq hailstone - 1 freq hielichtit - 1 freq heelichts - 1 freq hailsteenes - 1 freq |
MetaPhone code - HLKT hallockit - 7 freq halikit - 1 freq halakit - 1 freq haliket - 2 freq hie-liggit - 1 freq |
HALIKIT |
Time to execute Levenshtein function - 0.189856 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.371932 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.027992 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.039228 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.000868 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. |