| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| infeftments (0) - 1 freq intments (3) - 1 freq insentients (3) - 1 freq investment (3) - 23 freq vestments (4) - 1 freq instruments (4) - 37 freq instriments (4) - 1 freq intents (4) - 2 freq inducements (4) - 1 freq interment (4) - 1 freq enactments (4) - 1 freq informants (4) - 1 freq treatments (4) - 3 freq impediments (4) - 2 freq staetments (4) - 6 freq indytements (4) - 1 freq infections (4) - 5 freq ointments (4) - 1 freq pyements (5) - 1 freq engagements (5) - 3 freq inchantment (5) - 1 freq commeetments (5) - 1 freq mizzerments (5) - 1 freq injectet (5) - 1 freq ointment (5) - 5 freq |
infeftments (0) - 1 freq intments (5) - 1 freq informants (6) - 1 freq enactments (6) - 1 freq ointments (6) - 1 freq indytements (6) - 1 freq investment (6) - 23 freq insentients (6) - 1 freq infections (7) - 5 freq instriments (7) - 1 freq eyntments (7) - 1 freq treatments (7) - 3 freq staetments (7) - 6 freq instruments (7) - 37 freq inducements (7) - 1 freq vestments (7) - 1 freq intents (7) - 2 freq infants (8) - 4 freq anointment (8) - 1 freq nfutweets (8) - 1 freq nfustweets (8) - 1 freq appyntments (8) - 2 freq apartments (8) - 2 freq fifteent (8) - 3 freq treatmints (8) - 1 freq |
SoundEx code - I511 infeft - 2 freq invioved - 1 freq infoboxes - 3 freq infobox - 1 freq imbibe - 1 freq immoveable - 1 freq infeftments - 1 freq ionafyfe - 94 freq infobears - 1 freq impoverished - 1 freq iainpope - 6 freq |
MetaPhone code - INFFTMNT |
INFEFTMENTS |
| Time to execute Levenshtein function - 0.332282 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.487770 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.029693 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.039140 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.000866 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. |