| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hepburn (0) - 6 freq hepburns (1) - 1 freq holburn (2) - 3 freq hertburn (2) - 2 freq herbour (3) - 23 freq herbours (3) - 1 freq re-born (3) - 1 freq heppin (3) - 1 freq rayburn (3) - 1 freq spurn (3) - 2 freq auburn (3) - 4 freq herber (3) - 5 freq herbert (3) - 1 freq burn (3) - 452 freq hapsburg (3) - 1 freq seturn (3) - 12 freq keyburd (3) - 1 freq hamburg (3) - 3 freq coburn (3) - 3 freq herbeur (3) - 1 freq wudburn (3) - 11 freq herbor (3) - 1 freq whitburn (3) - 5 freq lisburn (3) - 1 freq woburn (3) - 1 freq |
hepburn (0) - 6 freq hepburns (2) - 1 freq holburn (3) - 3 freq hertburn (4) - 2 freq 'burn (5) - 1 freq reborn (5) - 7 freq woburn (5) - 1 freq upturn (5) - 1 freq whitburn (5) - 5 freq herbor (5) - 1 freq sinburn (5) - 2 freq lisburn (5) - 1 freq hiberno (5) - 1 freq harbourin (5) - 1 freq hubberin (5) - 1 freq purn (5) - 1 freq heppen (5) - 11 freq raeburn (5) - 1 freq wudburn (5) - 11 freq heartburn (5) - 1 freq newborn (5) - 11 freq spurn (5) - 2 freq herber (5) - 5 freq herbert (5) - 1 freq rayburn (5) - 1 freq |
SoundEx code - H165 hap-wairms - 1 freq haverin - 24 freq haiverins - 2 freq hoverin - 22 freq haiverin - 18 freq hovering - 7 freq huif-prents - 1 freq hepburn - 6 freq hibernate - 6 freq hovernut - 3 freq hovernuts - 2 freq hibernatin - 6 freq hooverin - 5 freq hooveran - 1 freq hoveran - 1 freq hepburns - 1 freq hubberin - 1 freq havering - 2 freq haparanda - 1 freq hyperion - 1 freq hibernians - 1 freq €˜hiberno-inglish - 1 freq hiberno-inglish - 9 freq hypernova - 1 freq hovrin - 2 freq hyperion's - 1 freq hibernation - 1 freq haverin' - 2 freq hoovering - 2 freq hiberno - 1 freq hibernianfc - 5 freq hypermobile - 1 freq hibeernian - 1 freq hibernating - 1 freq |
MetaPhone code - HPBRN hepburn - 6 freq |
HEPBURN |
| Time to execute Levenshtein function - 0.569360 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.022479 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.109688 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.162811 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.000777 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. |