| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hoggetscauf (0) - 1 freq hogget (5) - 1 freq hertscaud (5) - 5 freq heartscaud (5) - 1 freq longstaff (6) - 1 freq 'glesca (6) - 1 freq doggerland (6) - 2 freq heirt-scaud (6) - 1 freq howzitgaun (6) - 3 freq forgettan (6) - 6 freq hotspur (6) - 2 freq hoolets (6) - 5 freq houlets (6) - 1 freq homespun (6) - 1 freq heidscarf (6) - 1 freq forgets (6) - 9 freq large-scale (6) - 1 freq sodgets (6) - 1 freq hoggston (6) - 1 freq hogg's (6) - 12 freq suggestan (6) - 1 freq forgetful (6) - 2 freq hairtscad (6) - 2 freq howlets (6) - 1 freq poetical (6) - 3 freq |
hoggetscauf (0) - 1 freq hertscaud (8) - 5 freq heartscaud (8) - 1 freq hogget (8) - 1 freq hoggs (9) - 1 freq nuggets (9) - 6 freq hogg's (9) - 12 freq haggisfan (9) - 1 freq hoggston (9) - 1 freq hairtscad (9) - 2 freq bugger-aff (10) - 1 freq forgetfu (10) - 2 freq glesca (10) - 168 freq heidscaurf (10) - 1 freq joggers (10) - 1 freq €˜glesca (10) - 2 freq haggit (10) - 3 freq haggis (10) - 76 freq higgs' (10) - 1 freq huggsss (10) - 1 freq maggots (10) - 4 freq haggis's (10) - 1 freq thescotscafe (10) - 6 freq higgins (10) - 23 freq higgins' (10) - 2 freq |
SoundEx code - H232 heichts - 11 freq hichts - 10 freq hechts - 3 freq hostage - 7 freq hoasts - 8 freq hosts - 13 freq hysts - 1 freq howzitgaun - 3 freq heights - 3 freq haystack - 2 freq hostess - 2 freq high-tech - 2 freq hechtsome - 1 freq hashtags - 2 freq hoosedug - 1 freq hestigeo - 2 freq heests - 2 freq hoggetscauf - 1 freq hashtag-ad - 1 freq hey-stack - 1 freq hoosehauds - 5 freq heysts - 1 freq hashtag - 7 freq heywechts - 2 freq hectic - 1 freq hgducrs - 1 freq hgtokpnr - 1 freq hugggggggsdss - 1 freq hostages - 1 freq hostesses - 1 freq hctko - 1 freq hktwkwqa - 1 freq howzitgoan - 10 freq hkzetswlvw - 1 freq hjtkb - 1 freq |
MetaPhone code - HKTSKF hoggetscauf - 1 freq |
HOGGETSCAUF |
| Time to execute Levenshtein function - 0.230380 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.408361 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.027943 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.037519 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.000935 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. |