Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
hailsed (0) - 2 freq hailed (1) - 14 freq hailie (2) - 10 freq hailsum (2) - 2 freq sailed (2) - 32 freq mailed (2) - 2 freq hairsted (2) - 1 freq hilshed (2) - 1 freq wailed (2) - 4 freq haiked (2) - 1 freq halse (2) - 1 freq hairmed (2) - 4 freq failed (2) - 50 freq harled (2) - 6 freq hairted (2) - 2 freq heiled (2) - 1 freq raised (2) - 164 freq hallaed (2) - 1 freq tailed (2) - 7 freq hairse (2) - 14 freq hained (2) - 27 freq baised (2) - 3 freq haaled (2) - 21 freq hailsin (2) - 2 freq hails (2) - 6 freq |
hailsed (0) - 2 freq hailed (2) - 14 freq hauled (3) - 21 freq haild (3) - 2 freq halled (3) - 2 freq hailsin (3) - 2 freq haaled (3) - 21 freq haeled (3) - 2 freq hails (3) - 6 freq hailes (3) - 3 freq heised (3) - 1 freq haused (3) - 3 freq halped (3) - 2 freq halted (3) - 2 freq hallaed (3) - 1 freq halved (3) - 2 freq haled (3) - 1 freq hissed (3) - 45 freq hilshed (3) - 1 freq heiled (3) - 1 freq halse (3) - 1 freq hailsum (3) - 2 freq housed (4) - 1 freq hunsed (4) - 1 freq hauld (4) - 17 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 - HLST hillside - 15 freq holiest - 2 freq 'hillside' - 1 freq hailsed - 2 freq hulsyde - 1 freq |
HAILSED |
Time to execute Levenshtein function - 0.375209 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.777613 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.029164 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.084558 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.001176 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. |