| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hulsyde (0) - 1 freq outsyde (2) - 2 freq lyde (3) - 1 freq hulme (3) - 1 freq blyde (3) - 112 freq hussie (3) - 1 freq wulsome (3) - 2 freq hunde (3) - 1 freq insyde (3) - 1 freq clyde (3) - 67 freq upsydes (3) - 2 freq aulde (3) - 1 freq outside (3) - 87 freq fultyme (3) - 1 freq asyde (3) - 13 freq burnsyde (3) - 1 freq hussy (3) - 2 freq disyde (3) - 1 freq upside (3) - 37 freq hushie (3) - 3 freq ootsyde (3) - 4 freq fulyie (3) - 2 freq hushle (3) - 1 freq subside (3) - 2 freq syde (3) - 37 freq |
hulsyde (0) - 1 freq hailsed (4) - 2 freq halse (4) - 1 freq hunsed (4) - 1 freq hillside (4) - 15 freq huls (4) - 6 freq outsyde (4) - 2 freq halesome (5) - 9 freq helped (5) - 92 freq hosed (5) - 1 freq hls (5) - 1 freq hols (5) - 6 freq horsed (5) - 3 freq huils (5) - 5 freq hyde (5) - 16 freq halted (5) - 2 freq hauls (5) - 1 freq hoased (5) - 1 freq halled (5) - 2 freq haused (5) - 3 freq hailsome (5) - 3 freq lsd (5) - 2 freq hilda (5) - 23 freq houls (5) - 10 freq haled (5) - 1 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 |
HULSYDE |
| Time to execute Levenshtein function - 0.395294 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 - 1.110843 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.087794 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.125439 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.001260 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. |