| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hawkergoldie (0) - 1 freq pawkerie (5) - 2 freq hertilie (6) - 1 freq awbodie (6) - 37 freq haerald (6) - 1 freq jokeroonie (6) - 1 freq harold (6) - 13 freq herraldit (6) - 1 freq hinnerlie (6) - 10 freq likegold (6) - 1 freq lanerlie (6) - 2 freq awreddie (6) - 2 freq invergowrie (6) - 1 freq naeboadie (6) - 11 freq hairdlie (6) - 2 freq hairyollies (6) - 2 freq harlie (6) - 6 freq haurdlie (6) - 9 freq prawperlie (6) - 1 freq heraldin (6) - 1 freq hairmonie (6) - 1 freq gaerdie (6) - 1 freq aerlie (6) - 10 freq back-rollin (6) - 1 freq hawker (6) - 1 freq |
hawkergoldie (0) - 1 freq wergild (8) - 2 freq hawker (9) - 1 freq likegold (9) - 1 freq hunker-slid (9) - 1 freq pawkerie (9) - 2 freq hankered (9) - 2 freq harold (9) - 13 freq haerald (9) - 1 freq sickerlie (10) - 1 freq heraldit (10) - 1 freq hertilie (10) - 1 freq haurlie (10) - 4 freq hyperbole (10) - 7 freq heelstergoudie (10) - 1 freq heraldic (10) - 2 freq hawking (10) - 1 freq kingoodie (10) - 1 freq hawkie (10) - 1 freq heelstergowdie (10) - 7 freq harld (10) - 1 freq marigold (10) - 2 freq hairldy (10) - 1 freq hunkered (10) - 29 freq awkartly (10) - 1 freq |
SoundEx code - H262 houswark - 1 freq hoosewark - 5 freq high-rise - 4 freq hcro's - 1 freq hookers - 2 freq hoosework - 6 freq highers - 12 freq hoosewirk - 2 freq hoo's-yersel - 2 freq howkers - 1 freq hacker's - 1 freq hause-rigid - 1 freq highrise - 2 freq hege-raws - 1 freq heckers - 1 freq housework - 3 freq hikers - 2 freq hoose-work - 1 freq hqrkwrq - 1 freq hawkergoldie - 1 freq hegris - 2 freq hackers - 1 freq hooswark - 1 freq |
MetaPhone code - HKRKLT hawkergoldie - 1 freq |
HAWKERGOLDIE |
| Time to execute Levenshtein function - 0.490955 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.740540 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.059777 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.047448 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.001251 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. |