| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| heich-heidit (0) - 6 freq which-heidit (2) - 1 freq heich-bendit (2) - 2 freq reid-heidit (3) - 5 freq hail-heidit (3) - 2 freq heich-haunit (3) - 1 freq lichtheidit (3) - 1 freq licht-heidit (3) - 4 freq het-heidit (3) - 1 freq haill-heidit (3) - 2 freq heich-leid (3) - 1 freq hie-heidit (3) - 1 freq white-heidit (4) - 1 freq big-heidit (4) - 3 freq haurd-heidit (4) - 1 freq heich-kiltit (4) - 1 freq mell-heidit (4) - 1 freq rid-heidit (4) - 2 freq reed-heidit (4) - 1 freq black-heidit (4) - 2 freq yella-heidit (4) - 1 freq high-heidyin (4) - 1 freq airy-heidit (4) - 1 freq fair-heidit (4) - 2 freq hetheidit (4) - 1 freq |
heich-heidit (0) - 6 freq which-heidit (3) - 1 freq heich-bendit (4) - 2 freq heich-haunit (4) - 1 freq haill-heidit (5) - 2 freq het-heidit (5) - 1 freq hie-heidit (5) - 1 freq heich-leid (5) - 1 freq hail-heidit (5) - 2 freq licht-heidit (5) - 4 freq lichtheidit (5) - 1 freq het-heidet (6) - 1 freq high-heidyin (6) - 1 freq hale-heidit (6) - 5 freq haurd-heidit (6) - 1 freq reid-heidit (6) - 5 freq half-hoidit (7) - 1 freq fair-heidit (7) - 2 freq bee-heidit (7) - 1 freq tuim-heidit (7) - 4 freq much-needit (7) - 1 freq pig-heidit (7) - 1 freq hetheidit (7) - 1 freq heich-kiltit (7) - 1 freq big-heidit (7) - 3 freq |
SoundEx code - H233 hesitatin - 4 freq heistit - 4 freq hoastit - 11 freq hesitation - 12 freq heich-heidit - 6 freq hesitate - 9 freq hesitatit - 25 freq hesitated - 11 freq hostit - 7 freq hesitatin' - 1 freq histit - 1 freq hoistit - 1 freq hystit - 6 freq hoasted - 7 freq hoisted - 3 freq hosted - 3 freq hechtit - 5 freq hysted - 3 freq heystit - 1 freq hesitatingly - 1 freq hasted - 2 freq hesitates - 1 freq hichtit - 1 freq |
MetaPhone code - HXHTT heich-heidit - 6 freq |
HEICH-HEIDIT |
| Time to execute Levenshtein function - 0.238902 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.438443 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.029373 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.044142 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.000777 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. |