| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hauf-deid (0) - 8 freq half-deid (1) - 1 freq hauf-leid (1) - 1 freq lang-deid (3) - 3 freq cauf-deep (3) - 1 freq hauf-mad (3) - 1 freq hauf-yin (3) - 10 freq hauf-daft (3) - 1 freq hauf-lit (3) - 4 freq hauf-blin (3) - 1 freq haunded (3) - 19 freq hauf-day (3) - 1 freq half-hid (3) - 1 freq hauf-muin (3) - 1 freq haughheid (3) - 1 freq auld-deid (3) - 1 freq hauf-dernt (3) - 1 freq hauf-mete (3) - 1 freq hous-heid (3) - 1 freq haufed (3) - 2 freq hauf-seas (3) - 1 freq hauf-wey (3) - 4 freq haun-med (3) - 1 freq hauf-heard (3) - 1 freq hauf-tuim (3) - 1 freq |
hauf-deid (0) - 8 freq hauf-leid (2) - 1 freq half-deid (2) - 1 freq hauf-day (4) - 1 freq hauf-mad (4) - 1 freq haufed (5) - 2 freq hauf-mete (5) - 1 freq hauf-seas (5) - 1 freq hous-heid (5) - 1 freq hauf-tuim (5) - 1 freq hauded (5) - 2 freq auld-deid (5) - 1 freq hauf-heard (5) - 1 freq haun-med (5) - 1 freq hauf-wey (5) - 4 freq hauf-lit (5) - 4 freq hauf-yin (5) - 10 freq cauf-deep (5) - 1 freq haunded (5) - 19 freq hauf-daft (5) - 1 freq half-hid (5) - 1 freq hauf-muin (5) - 1 freq hie-heid (6) - 3 freq hous-maid (6) - 1 freq huffed (6) - 3 freq |
SoundEx code - H133 heftit - 5 freq hauf-deid - 8 freq hiftit - 1 freq heavy-duty - 2 freq habitautioun - 2 freq habitats - 4 freq habitat - 3 freq hefted - 24 freq habitation - 6 freq €œhabitat - 1 freq hypothetical - 1 freq hypotheticals - 1 freq hypothetical- - 1 freq |
MetaPhone code - HFTT heftit - 5 freq hauf-deid - 8 freq hiftit - 1 freq heavy-duty - 2 freq hefted - 24 freq |
HAUF-DEID die - 122 freq died - 152 freq dee - 1204 freq dee'd - 93 freq deid - 946 freq deadly - 18 freq deidly - 19 freq hauf-deid - 8 freq deidlie - 7 freq deidkist - 2 freq lang-deid - 3 freq deid-centre - 1 freq half-deid - 1 freq deadline - 4 freq deadpan - 3 freq ston-dead - 1 freq braindead - 1 freq |
| Time to execute Levenshtein function - 0.201688 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.327672 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.027505 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.037098 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.000973 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. |