| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kin-hertit (0) - 1 freq kind-hertit (1) - 1 freq kyn-hertit (1) - 1 freq lion-hertit (2) - 1 freq hen-hertit (2) - 1 freq inheritit (3) - 3 freq insertit (3) - 2 freq dishertit (3) - 1 freq guid-hertit (3) - 2 freq hail-hertit (3) - 2 freq ill-hertit (3) - 7 freq inherit (3) - 7 freq invertit (3) - 3 freq doon-hertit (3) - 3 freq infestit (4) - 3 freq fingertip (4) - 1 freq non-herdin (4) - 1 freq inheritin (4) - 2 freq inkervit (4) - 1 freq inveetit (4) - 4 freq concertit (4) - 1 freq leal-hertit (4) - 4 freq convertit (4) - 10 freq inflectit (4) - 3 freq big-heidit (4) - 3 freq |
kin-hertit (0) - 1 freq kyn-hertit (1) - 1 freq kind-hertit (2) - 1 freq hen-hertit (3) - 1 freq lion-hertit (3) - 1 freq doon-hertit (4) - 3 freq inheritit (5) - 3 freq hail-hertit (5) - 2 freq ill-hertit (5) - 7 freq guid-hertit (5) - 2 freq leal-hertit (6) - 4 freq insertit (6) - 2 freq kinichtit (6) - 1 freq doonhertit (6) - 1 freq hauf-hertit (6) - 1 freq open-hairtit (6) - 1 freq dishertit (6) - 1 freq inherit (6) - 7 freq invertit (6) - 3 freq inherent (7) - 7 freq fause-hertit (7) - 1 freq guid-hairtit (7) - 1 freq warm-hertit (7) - 1 freq noo-hatit (7) - 1 freq saft-hertit (7) - 1 freq |
SoundEx code - K563 kyn-hertit - 1 freq kinred - 2 freq kin-hertit - 1 freq kinraddie - 1 freq kinnaird - 1 freq kennyritch - 1 freq |
MetaPhone code - KNHRTT kyn-hertit - 1 freq kin-hertit - 1 freq |
KIN-HERTIT |
| Time to execute Levenshtein function - 0.618615 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.280190 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.096105 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.097646 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.001226 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. |