| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| inleid (0) - 1 freq inlaid (1) - 3 freq fleid (2) - 2 freq inlet (2) - 1 freq insteid (2) - 309 freq iled (2) - 1 freq inked (2) - 4 freq gleid (2) - 1 freq indeed (2) - 178 freq ingrid (2) - 17 freq €˜leid (2) - 2 freq intend (2) - 10 freq inland (2) - 5 freq byleid (2) - 9 freq cleid (2) - 10 freq leid (2) - 1517 freq isteid (2) - 2 freq bleid (2) - 1 freq ineed (2) - 1 freq inlaik (2) - 1 freq inded (2) - 1 freq undeid (2) - 3 freq intead (2) - 2 freq asleid (2) - 1 freq binlid (2) - 1 freq |
inleid (0) - 1 freq inlaid (1) - 3 freq inlaik (3) - 1 freq ineed (3) - 1 freq inded (3) - 1 freq leid (3) - 1517 freq bleid (3) - 1 freq intead (3) - 2 freq unload (3) - 3 freq binlid (3) - 1 freq asleid (3) - 1 freq cleid (3) - 10 freq undeid (3) - 3 freq neid (3) - 1 freq inked (3) - 4 freq iled (3) - 1 freq inlet (3) - 1 freq fleid (3) - 2 freq gleid (3) - 1 freq indeed (3) - 178 freq inland (3) - 5 freq byleid (3) - 9 freq tiled (4) - 2 freq endid (4) - 4 freq sled (4) - 7 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 - INLT inleid - 1 freq 'inleit' - 1 freq inlaid - 3 freq inlat - 32 freq inlet - 1 freq |
INLEID |
| Time to execute Levenshtein function - 0.258915 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.394649 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.027449 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.036954 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.000903 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. |