| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| notification (0) - 1 freq notifications (1) - 4 freq mortification (2) - 2 freq ratification (2) - 2 freq codification (2) - 3 freq ersification (3) - 1 freq modrification (3) - 1 freq sanctification (3) - 1 freq mystification (3) - 3 freq anglification (3) - 1 freq certification (3) - 1 freq gratification (3) - 1 freq justification (3) - 3 freq scottification (3) - 1 freq purification (3) - 1 freq beatification (3) - 1 freq glorification (3) - 1 freq uglification (3) - 8 freq non-fiction (3) - 4 freq teerification (4) - 1 freq peerification (4) - 1 freq terrification (4) - 2 freq nochtfiction (4) - 1 freq reunification (4) - 1 freq ramifications (4) - 4 freq |
notification (0) - 1 freq notifications (2) - 4 freq ratification (3) - 2 freq beatification (4) - 1 freq mortification (4) - 2 freq codification (4) - 3 freq purification (5) - 1 freq justification (5) - 3 freq identification (5) - 1 freq non-fiction (5) - 4 freq uglification (5) - 8 freq gratification (5) - 1 freq certification (5) - 1 freq ersification (5) - 1 freq mystification (5) - 3 freq sanctification (5) - 1 freq anglification (5) - 1 freq intoxicatin (6) - 1 freq edumification (6) - 1 freq notation (6) - 1 freq intimidation (6) - 2 freq anticipation (6) - 23 freq qualification (6) - 7 freq nochtfiction (6) - 1 freq teerification (6) - 1 freq |
SoundEx code - N312 notebook - 14 freq note-book - 6 freq notebooks - 1 freq notebuik - 1 freq natives - 13 freq nottbook - 1 freq nott-book - 1 freq notebeuk - 1 freq ndpbs - 3 freq notification - 1 freq notifications - 4 freq notebuiks - 1 freq naitves - 1 freq |
MetaPhone code - NTFKXN notification - 1 freq |
NOTIFICATION |
| Time to execute Levenshtein function - 0.794587 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 - 1.997096 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.187049 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.117082 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.001101 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. |