| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| narratives (0) - 2 freq nairratives (1) - 2 freq narrative (1) - 41 freq nairrative (2) - 3 freq 'narrative (2) - 1 freq nairative (2) - 3 freq narrates (2) - 1 freq normative (3) - 1 freq narraes (3) - 1 freq negatives (3) - 3 freq narration (3) - 1 freq arrives (3) - 16 freq nairitive (3) - 1 freq ralatives (3) - 1 freq creatives (3) - 6 freq warranties (3) - 2 freq narratit (3) - 1 freq narrate (3) - 3 freq purgatives (3) - 1 freq natives (3) - 13 freq narrator's (3) - 2 freq laxatives (3) - 2 freq raelative (4) - 1 freq norraes (4) - 2 freq areadies (4) - 2 freq |
narratives (0) - 2 freq nairratives (1) - 2 freq narrative (2) - 41 freq narrates (3) - 1 freq nairrative (3) - 3 freq nairative (4) - 3 freq 'narrative (4) - 1 freq narrate (5) - 3 freq narratit (5) - 1 freq purgatives (5) - 1 freq narrator's (5) - 2 freq creatives (5) - 6 freq natives (5) - 13 freq nairitive (5) - 1 freq ralatives (5) - 1 freq narraes (5) - 1 freq normative (5) - 1 freq narration (5) - 1 freq negatives (5) - 3 freq arrives (5) - 16 freq relatives (6) - 17 freq rareities (6) - 1 freq narcotics (6) - 1 freq imperatives (6) - 9 freq narrautioun (6) - 1 freq |
SoundEx code - N631 narrative - 41 freq narratives - 2 freq 'narrative - 1 freq nortaboot - 1 freq nairratives - 2 freq nairrative - 3 freq nairative - 3 freq nairitive - 1 freq northfield - 1 freq northhop - 1 freq northepolice - 2 freq northbridge - 1 freq |
MetaPhone code - NRTFS narratives - 2 freq nairratives - 2 freq |
NARRATIVES |
| Time to execute Levenshtein function - 0.230795 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.499060 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.029521 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.039648 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.000936 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. |