| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| infoboxes (0) - 3 freq infobox (2) - 1 freq infobears (3) - 1 freq indoors (4) - 9 freq inboos (4) - 1 freq in-box (4) - 1 freq nobles (4) - 7 freq informs (4) - 9 freq fuseboxes (4) - 1 freq infuses (4) - 1 freq ngobos (4) - 1 freq boxes (4) - 64 freq informers (4) - 2 freq foxes (4) - 9 freq incomes (4) - 1 freq infamous (4) - 7 freq inaboots (4) - 3 freq inflooans (4) - 1 freq involves (4) - 7 freq inrowes (4) - 1 freq infors (4) - 1 freq invoices (4) - 1 freq eastboxes (4) - 1 freq inbox (4) - 4 freq gearboxes (4) - 1 freq |
infoboxes (0) - 3 freq infobox (3) - 1 freq infobears (4) - 1 freq inaboots (6) - 3 freq foxes (6) - 9 freq inflooans (6) - 1 freq infamous (6) - 7 freq infors (6) - 1 freq inbox (6) - 4 freq eastboxes (6) - 1 freq tuilboxes (6) - 1 freq in-aboots (6) - 1 freq boxes (6) - 64 freq informs (6) - 9 freq nobles (6) - 7 freq in-box (6) - 1 freq gearboxes (6) - 1 freq fuseboxes (6) - 1 freq toolboxes (6) - 3 freq ngobos (6) - 1 freq infuses (6) - 1 freq inboos (6) - 1 freq naebdies (7) - 1 freq reflexes (7) - 1 freq nibbles (7) - 2 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 - INFBKSS infoboxes - 3 freq |
INFOBOXES |
| Time to execute Levenshtein function - 0.193873 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.392670 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.028170 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.037378 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.000935 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. |