| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ignite (0) - 4 freq ignire (1) - 1 freq igniter (1) - 2 freq ignited (1) - 1 freq inite (1) - 6 freq minite (2) - 1 freq dignit (2) - 1 freq dignity (2) - 29 freq iolite (2) - 1 freq nite (2) - 87 freq unite (2) - 11 freq invite (2) - 43 freq finite (2) - 3 freq reignite (2) - 1 freq grite (2) - 1 freq ignore (2) - 58 freq ignitit (2) - 1 freq indite (2) - 1 freq gite (2) - 2 freq ioniae (2) - 1 freq innate (2) - 3 freq danite (2) - 5 freq inate (2) - 1 freq init (2) - 1 freq snite (2) - 2 freq |
ignite (0) - 4 freq ignited (2) - 1 freq inite (2) - 6 freq igniter (2) - 2 freq ignire (2) - 1 freq snite (3) - 2 freq init (3) - 1 freq innate (3) - 3 freq tonite (3) - 6 freq danite (3) - 5 freq innit (3) - 10 freq dignitie (3) - 2 freq gite (3) - 2 freq inte (3) - 129 freq signit (3) - 9 freq ignitin (3) - 1 freq inate (3) - 1 freq nite (3) - 87 freq finite (3) - 3 freq dignity (3) - 29 freq dignit (3) - 1 freq minite (3) - 1 freq reignite (3) - 1 freq unite (3) - 11 freq ignitit (3) - 1 freq |
SoundEx code - I253 isn't - 33 freq igniter - 2 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 - IKNT ignite - 4 freq |
IGNITE |
| Time to execute Levenshtein function - 0.190821 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.387437 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.027279 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.036986 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.000810 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. |