| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| inhaled (0) - 3 freq inhales (1) - 1 freq inhaler (1) - 1 freq inhale (1) - 2 freq exhaled (2) - 7 freq inated (2) - 1 freq invaded (2) - 4 freq inhad (2) - 1 freq involed (2) - 1 freq intaed (2) - 1 freq inhalin (2) - 3 freq invalid (2) - 5 freq indaed (2) - 3 freq ingaed (2) - 5 freq impaled (2) - 4 freq haled (2) - 1 freq chafed (3) - 1 freq schale (3) - 1 freq chawed (3) - 17 freq unhalie (3) - 1 freq sneaked (3) - 12 freq hated (3) - 52 freq snared (3) - 5 freq unwaged (3) - 1 freq insane (3) - 8 freq |
inhaled (0) - 3 freq inhaler (2) - 1 freq inhale (2) - 2 freq inhales (2) - 1 freq inhalin (3) - 3 freq haled (3) - 1 freq involed (3) - 1 freq invalid (3) - 5 freq exhaled (3) - 7 freq inhad (3) - 1 freq tholed (4) - 46 freq hailed (4) - 14 freq unfaaled (4) - 2 freq healed (4) - 10 freq hauled (4) - 21 freq nailed (4) - 16 freq inlaid (4) - 3 freq inleid (4) - 1 freq nald (4) - 1 freq inthelead (4) - 1 freq holed (4) - 7 freq enabled (4) - 1 freq haaled (4) - 21 freq haeled (4) - 2 freq intaed (4) - 1 freq |
SoundEx code - I543 inhaled - 3 freq inleid - 1 freq 'inleit' - 1 freq inlaid - 3 freq inlat - 32 freq inlats - 21 freq inlats' - 1 freq inhalation - 2 freq inlet - 1 freq inleitin - 2 freq inaldz - 1 freq innealadair - 5 freq |
MetaPhone code - INHLT inhaled - 3 freq |
INHALED |
| Time to execute Levenshtein function - 0.202941 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.375292 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.029809 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.039297 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.000888 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. |