| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| narrative (0) - 40 freq nairative (1) - 3 freq nairrative (1) - 3 freq 'narrative (1) - 1 freq narratives (1) - 1 freq narratit (2) - 1 freq nairitive (2) - 1 freq narrate (2) - 3 freq nairratives (2) - 2 freq normative (2) - 1 freq narration (2) - 1 freq narrie (3) - 1 freq narrates (3) - 1 freq narrator (3) - 29 freq hortative (3) - 1 freq lucrative (3) - 2 freq creative (3) - 99 freq norration (3) - 1 freq narrete (3) - 1 freq formative (3) - 2 freq barratrie (3) - 1 freq native (3) - 93 freq raelative (3) - 1 freq negative (3) - 41 freq arrive (3) - 51 freq |
narrative (0) - 40 freq nairrative (1) - 3 freq narratives (2) - 1 freq 'narrative (2) - 1 freq nairative (2) - 3 freq normative (3) - 1 freq nairratives (3) - 2 freq narration (3) - 1 freq narrate (3) - 3 freq nairitive (3) - 1 freq narratit (3) - 1 freq narrete (4) - 1 freq narrator (4) - 29 freq narrates (4) - 1 freq norration (4) - 1 freq raelative (5) - 1 freq negative (5) - 41 freq 'creative (5) - 4 freq native (5) - 93 freq narrae (5) - 15 freq arrive (5) - 51 freq formative (5) - 2 freq hortative (5) - 1 freq barratrie (5) - 1 freq lucrative (5) - 2 freq |
SoundEx code - N631 narrative - 40 freq 'narrative - 1 freq nortaboot - 1 freq nairratives - 2 freq nairrative - 3 freq nairative - 3 freq nairitive - 1 freq narratives - 1 freq northfield - 1 freq northhop - 1 freq northepolice - 2 freq northbridge - 1 freq |
MetaPhone code - NRTF narrative - 40 freq 'narrative - 1 freq nairrative - 3 freq nairative - 3 freq nairitive - 1 freq |
NARRATIVE |
| Time to execute Levenshtein function - 0.190808 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.361727 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.027289 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.036942 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.000782 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. |