| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hepburn (0) - 6 freq hepburns (1) - 1 freq holburn (2) - 3 freq hertburn (2) - 2 freq heppen (3) - 11 freq spurn (3) - 2 freq neebur (3) - 11 freq sinburn (3) - 2 freq newborn (3) - 11 freq keyburd (3) - 1 freq seturn (3) - 12 freq neeburs (3) - 7 freq lisburn (3) - 1 freq whitburn (3) - 5 freq woburn (3) - 1 freq auburn (3) - 4 freq 'burn (3) - 1 freq coburn (3) - 3 freq herbour (3) - 23 freq return (3) - 132 freq heejun (3) - 1 freq re-born (3) - 1 freq upturn (3) - 1 freq glenburn (3) - 2 freq hapsburg (3) - 1 freq |
hepburn (0) - 6 freq hepburns (2) - 1 freq holburn (3) - 3 freq hertburn (4) - 2 freq reborn (5) - 7 freq purn (5) - 1 freq raeburn (5) - 1 freq heppin (5) - 1 freq heartburn (5) - 1 freq hapsburg (5) - 1 freq herbeur (5) - 1 freq wudburn (5) - 11 freq herbor (5) - 1 freq herber (5) - 5 freq hubberin (5) - 1 freq harbourin (5) - 1 freq hiberno (5) - 1 freq herbert (5) - 1 freq burn (5) - 455 freq herbours (5) - 2 freq upturn (5) - 1 freq hamburg (5) - 3 freq rayburn (5) - 1 freq woburn (5) - 1 freq auburn (5) - 4 freq |
SoundEx code - H165 hap-wairms - 1 freq haverin - 25 freq haiverins - 2 freq hoverin - 23 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.199851 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.345101 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.027970 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.038010 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.000943 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. |