Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
hulmawater (0) - 1 freq lungawater (3) - 2 freq pettawater (4) - 1 freq culminated (4) - 1 freq fulmmaker (4) - 1 freq chulemaster (4) - 1 freq saltwater (4) - 1 freq hulmalees (4) - 1 freq lawyer (5) - 33 freq smaaer (5) - 7 freq schuilmaister (5) - 3 freq manager (5) - 54 freq plater (5) - 1 freq cultivated (5) - 1 freq sklater (5) - 1 freq stamagaster (5) - 4 freq quanter (5) - 4 freq fulmart (5) - 1 freq sulwath (5) - 4 freq smairter (5) - 1 freq sumgates (5) - 1 freq hashter (5) - 4 freq laiter (5) - 4 freq quaiter (5) - 4 freq fulmartis (5) - 1 freq |
hulmawater (0) - 1 freq lungawater (6) - 2 freq saltwater (6) - 1 freq chulemaster (6) - 1 freq hamster (7) - 6 freq heidmaster (7) - 1 freq helter (7) - 3 freq plowter (7) - 6 freq haimster (7) - 2 freq heidmaister (7) - 5 freq halter (7) - 5 freq helecopter (7) - 1 freq helicopter (7) - 31 freq headmaster (7) - 2 freq lamiter (7) - 1 freq hexameter (7) - 1 freq hulmalees (7) - 1 freq fulmmaker (7) - 1 freq culminated (7) - 1 freq pettawater (7) - 1 freq platter (8) - 11 freq rainwater (8) - 1 freq hubster (8) - 1 freq flachter (8) - 1 freq 'water (8) - 2 freq |
SoundEx code - H453 heilant - 1 freq heilanders - 2 freq hielanders - 7 freq hieland - 16 freq helmets - 9 freq helmet - 15 freq holland - 17 freq hielandmen - 1 freq hielant - 4 freq hielants - 1 freq hielands - 11 freq 'hole-in-the-waas' - 1 freq heiland - 2 freq helmits - 1 freq hielandman's - 1 freq hielandman - 1 freq hulmawater - 1 freq hielander - 2 freq hole-in-the-wa - 1 freq hielenders - 1 freq heilands - 1 freq hollande - 1 freq €˜hielands - 1 freq heelands - 1 freq helentrevone - 1 freq hielandcoo - 3 freq helenohtroy - 1 freq heeland - 1 freq |
MetaPhone code - HLMWTR hulmawater - 1 freq |
HULMAWATER |
Time to execute Levenshtein function - 0.621309 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.385276 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.096094 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.103489 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.000897 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. |