| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| infobox (0) - 1 freq infoboxes (2) - 3 freq in-box (2) - 1 freq inbox (2) - 4 freq inboos (3) - 1 freq inoo (3) - 10 freq info (3) - 36 freq yifoox (3) - 1 freq informs (3) - 9 freq infors (3) - 1 freq ngobo (3) - 4 freq ngobos (3) - 1 freq informt (3) - 1 freq infoarm (3) - 3 freq snuffbox (3) - 2 freq indoor (3) - 6 freq inflood (3) - 1 freq influx (3) - 1 freq infor (3) - 1 freq infowar (3) - 1 freq inform (3) - 18 freq infers (4) - 1 freq inhibit (4) - 2 freq snoot (4) - 60 freq inroads (4) - 4 freq |
infobox (0) - 1 freq in-box (3) - 1 freq inbox (3) - 4 freq infoboxes (3) - 3 freq influx (4) - 1 freq inflood (5) - 1 freq infoarm (5) - 3 freq snuffbox (5) - 2 freq inform (5) - 18 freq nfxo (5) - 1 freq infowar (5) - 1 freq infor (5) - 1 freq ngobo (5) - 4 freq info (5) - 36 freq nflx (5) - 1 freq inboos (5) - 1 freq yifoox (5) - 1 freq nfb (5) - 1 freq ngobos (5) - 1 freq infors (5) - 1 freq xobx (6) - 1 freq ifbt (6) - 1 freq nobby (6) - 1 freq inaboot (6) - 35 freq solibox (6) - 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 - INFBKS infobox - 1 freq |
INFOBOX |
| Time to execute Levenshtein function - 0.244628 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.419683 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.029790 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.043754 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.001265 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. |