| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| novations (0) - 1 freq novation (1) - 1 freq notions (2) - 40 freq donations (2) - 2 freq innovations (2) - 4 freq locations (2) - 9 freq rotations (2) - 1 freq nations (2) - 65 freq notation (2) - 1 freq notion' (3) - 1 freq equations (3) - 5 freq citations (3) - 3 freq norration (3) - 1 freq invasions (3) - 1 freq notion (3) - 223 freq innovation (3) - 6 freq location (3) - 35 freq notions' (3) - 1 freq conotations (3) - 4 freq neitions (3) - 1 freq ations (3) - 1 freq nooatimes (3) - 1 freq stations (3) - 10 freq denotations (3) - 2 freq nation's (3) - 10 freq |
novations (0) - 1 freq novation (2) - 1 freq nations (3) - 65 freq innovations (3) - 4 freq notions (3) - 40 freq invasions (4) - 1 freq neitions (4) - 1 freq invocations (4) - 1 freq devotions (4) - 4 freq natiouns (4) - 2 freq notation (4) - 1 freq locations (4) - 9 freq donations (4) - 2 freq rotations (4) - 1 freq motivations (5) - 2 freq creations (5) - 3 freq rations (5) - 8 freq quotations (5) - 12 freq solutions (5) - 20 freq dilations (5) - 1 freq negation (5) - 2 freq motions (5) - 17 freq nations' (5) - 2 freq devotiouns (5) - 1 freq intuitions (5) - 1 freq |
SoundEx code - N135 ïnvitin - 1 freq naebody-naebody - 1 freq novations - 1 freq novation - 1 freq neptune - 19 freq naw-votin - 1 freq npdhenohd - 1 freq |
MetaPhone code - NFXNS novations - 1 freq |
NOVATIONS |
| Time to execute Levenshtein function - 0.398519 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.786772 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.036445 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.104546 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.001196 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. |