| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| heelster (0) - 2 freq sheenster (2) - 150 freq wheelter (2) - 16 freq peester (2) - 3 freq deester (2) - 2 freq helter (2) - 3 freq heeter (2) - 9 freq haister (3) - 2 freq teeter (3) - 1 freq brewster (3) - 3 freq hamster (3) - 6 freq heezsel (3) - 1 freq easter (3) - 42 freq enster (3) - 2 freq chester (3) - 1 freq healer (3) - 3 freq heiter (3) - 1 freq sneester (3) - 3 freq haeter (3) - 2 freq haimster (3) - 2 freq pedester (3) - 1 freq hereefter (3) - 3 freq seestem (3) - 35 freq deesters (3) - 1 freq ulster (3) - 420 freq |
heelster (0) - 2 freq helter (3) - 3 freq haimster (4) - 2 freq hestor (4) - 1 freq plester (4) - 2 freq hubster (4) - 1 freq folster (4) - 1 freq hairster (4) - 1 freq bolster (4) - 4 freq halter (4) - 5 freq heestory (4) - 3 freq bleester (4) - 7 freq hulstert (4) - 1 freq ulster (4) - 420 freq hipster (4) - 3 freq wheelter (4) - 16 freq peester (4) - 3 freq haister (4) - 2 freq heeter (4) - 9 freq houster (4) - 1 freq sheenster (4) - 150 freq leister (4) - 2 freq slester (4) - 4 freq havester (4) - 1 freq hamster (4) - 6 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 - HLSTR heelster - 2 freq |
HEELSTER |
| Time to execute Levenshtein function - 0.197639 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.359778 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.027748 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.040523 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.000871 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. |