| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hyper-birl (0) - 2 freq hypermobile (4) - 1 freq hyperdrive (4) - 1 freq hyperion (4) - 1 freq ither-bill (4) - 1 freq hyperbole (4) - 7 freq open-air (5) - 3 freq dyperin (5) - 1 freq herbert (5) - 1 freq hole-bit (5) - 1 freq super-bitch (5) - 1 freq repertoire (5) - 8 freq hypernova (5) - 1 freq yin-bill (5) - 1 freq uppermair (5) - 4 freq peter-uill (5) - 1 freq hyperion's (5) - 1 freq yersail (5) - 1 freq herbor (5) - 1 freq herbie (5) - 11 freq adverbial (5) - 1 freq hyperspace (5) - 1 freq herbal (5) - 5 freq cyber-pal (5) - 1 freq chapel-bell (5) - 1 freq |
hyper-birl (0) - 2 freq hyperbole (6) - 7 freq hypermobile (6) - 1 freq hyperdrive (7) - 1 freq ither-bill (7) - 1 freq mid-birl (8) - 1 freq chapel-bell (8) - 1 freq hertburn (8) - 2 freq hair-oil (8) - 1 freq herbor (8) - 1 freq herber (8) - 5 freq paper-back (8) - 1 freq herbal (8) - 5 freq hyperion (8) - 1 freq hurly-burly (8) - 3 freq herbert (8) - 1 freq sportbible (9) - 1 freq hairtburn (9) - 1 freq hairbur (9) - 1 freq hypobole (9) - 1 freq hara-kiri (9) - 1 freq here-but (9) - 1 freq herbrie (9) - 6 freq hertbrak (9) - 1 freq hapsburg (9) - 1 freq |
SoundEx code - H161 hyperbole - 7 freq haverpokes - 2 freq hyperapology - 1 freq hover-flees - 1 freq haver-havering - 1 freq hie-profile - 1 freq hyper-birl - 2 freq hoverflies - 1 freq |
MetaPhone code - PRBRL hyper-birl - 2 freq |
HYPER-BIRL |
| Time to execute Levenshtein function - 0.221323 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.393864 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.031635 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.046888 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.000883 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. |