| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ignitin (0) - 1 freq ignition (1) - 2 freq igniting (1) - 1 freq ignitit (1) - 1 freq ignited (2) - 1 freq dignitie (2) - 2 freq unitin (2) - 2 freq ignorin (2) - 35 freq gitin (2) - 2 freq ignite (2) - 4 freq incitin (2) - 1 freq igniter (2) - 2 freq invitin (2) - 16 freq intin (2) - 2 freq ignites (2) - 1 freq €™nittin (3) - 1 freq visitin (3) - 22 freq inciting (3) - 1 freq whitin (3) - 25 freq pyntin (3) - 80 freq greitin (3) - 26 freq glintin (3) - 15 freq pintin (3) - 17 freq cuntin (3) - 1 freq gjittin (3) - 1 freq |
ignitin (0) - 1 freq ignition (1) - 2 freq ignitit (2) - 1 freq igniting (2) - 1 freq igniter (3) - 2 freq intin (3) - 2 freq ignites (3) - 1 freq gitin (3) - 2 freq ignite (3) - 4 freq ignited (3) - 1 freq gantin (3) - 23 freq unitin (3) - 2 freq ignorin (3) - 35 freq gettin (4) - 1172 freq duntin (4) - 24 freq rantin (4) - 9 freq gwetin (4) - 1 freq giftin (4) - 2 freq puntin (4) - 5 freq gainin (4) - 11 freq ginin (4) - 1 freq gottin (4) - 2 freq inten (4) - 2 freq ignoran (4) - 2 freq cantin (4) - 4 freq |
SoundEx code - I253 isn't - 34 freq igniter - 2 freq ignites - 1 freq isiand - 1 freq ignite - 4 freq isnt' - 1 freq is'nt - 1 freq ignited - 1 freq ignitin - 1 freq ignitit - 1 freq ignition - 2 freq igniting - 1 freq iskander - 70 freq €œiskander - 3 freq isnÂ’t - 2 freq isnt - 2 freq isntb - 1 freq |
MetaPhone code - IKNTN ignitin - 1 freq |
IGNITIN |
| Time to execute Levenshtein function - 0.318250 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.586389 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.027324 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.069260 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.000927 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. |