| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hepburns (0) - 1 freq hepburn (1) - 6 freq €˜burns (3) - 1 freq returns (3) - 29 freq newborns (3) - 1 freq seaburds (3) - 1 freq taeburns (3) - 1 freq joeyburns (3) - 1 freq herns (3) - 1 freq neeburs (3) - 7 freq burns (3) - 381 freq spurns (3) - 1 freq 'burns (3) - 3 freq herbours (3) - 2 freq hertburn (3) - 2 freq heppens (3) - 4 freq holburn (3) - 3 freq neebur's (3) - 4 freq hurts (4) - 17 freq huns (4) - 10 freq hearkens (4) - 6 freq coburn (4) - 3 freq 'burds (4) - 1 freq burrs (4) - 2 freq earns (4) - 3 freq |
hepburns (0) - 1 freq hepburn (2) - 6 freq herbours (5) - 2 freq heppens (5) - 4 freq 'burns (5) - 3 freq hipbones (5) - 1 freq burns (5) - 381 freq holburn (5) - 3 freq spurns (5) - 1 freq taeburns (5) - 1 freq €˜burns (5) - 1 freq joeyburns (5) - 1 freq newborns (5) - 1 freq herns (5) - 1 freq harbours (6) - 2 freq herbourous (6) - 1 freq hippens (6) - 5 freq happens (6) - 207 freq herrins (6) - 2 freq haycorns (6) - 13 freq harbour's (6) - 1 freq hiberno (6) - 1 freq horns (6) - 43 freq heppenins (6) - 1 freq hairns (6) - 8 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 - HPBRNS hepburns - 1 freq |
HEPBURNS |
| Time to execute Levenshtein function - 0.209318 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.349959 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.027315 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.037886 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.000941 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. |