| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| open-hairtit (0) - 1 freq open-haundit (3) - 1 freq broken-hairtit (3) - 4 freq open-haerted (3) - 1 freq leal-hairtit (4) - 1 freq gweed-hairtit (4) - 3 freq guid-hairtit (4) - 1 freq blak-hairtit (4) - 1 freq bleck-hairtit (4) - 1 freq open-gabbit (4) - 1 freq open-air (4) - 3 freq warm-hairtit (4) - 1 freq doonhairtit (4) - 3 freq hen-hertit (4) - 1 freq nae-airtit (4) - 1 freq haird-hairtit (5) - 1 freq lion-hertit (5) - 1 freq enchantit (5) - 2 freq pairtit (5) - 21 freq owenhargie (5) - 1 freq enairmit (5) - 1 freq €˜enchauntit (5) - 1 freq ower-hingit (5) - 1 freq apen-mindit (5) - 1 freq göd-haertit (5) - 1 freq |
open-hairtit (0) - 1 freq open-haerted (4) - 1 freq hen-hertit (5) - 1 freq open-haundit (5) - 1 freq lion-hertit (6) - 1 freq doon-hertit (6) - 3 freq kin-hertit (6) - 1 freq doonhairtit (6) - 3 freq kyn-hertit (6) - 1 freq nae-airtit (6) - 1 freq leal-hairtit (6) - 1 freq guid-hairtit (6) - 1 freq broken-hairtit (6) - 4 freq warm-hairtit (7) - 1 freq gweed-hairtit (7) - 3 freq blak-hairtit (7) - 1 freq open-gabbit (7) - 1 freq open-air (7) - 3 freq guid-hertit (8) - 2 freq lang-hairit (8) - 1 freq enchauntit (8) - 3 freq leal-hertit (8) - 4 freq doonhertit (8) - 1 freq open-handed (8) - 1 freq true-heartit (8) - 1 freq |
SoundEx code - O156 opener - 4 freq openers - 2 freq open-air - 3 freq open-hairtit - 1 freq open-haerted - 1 freq openwark - 3 freq openyerlugs - 1 freq |
MetaPhone code - OPNHRTT open-hairtit - 1 freq open-haerted - 1 freq |
OPEN-HAIRTIT |
| Time to execute Levenshtein function - 0.300276 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.540178 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.027976 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.073146 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.001038 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. |