| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| narratit (0) - 1 freq narrator (2) - 30 freq narrate (2) - 3 freq narrates (2) - 1 freq narrative (2) - 41 freq arrayit (2) - 2 freq parrotit (2) - 1 freq narration (2) - 1 freq starratt (3) - 1 freq negatit (3) - 1 freq narrete (3) - 1 freq narraed (3) - 1 freq arrivit (3) - 7 freq barratrie (3) - 1 freq saatit (3) - 1 freq laceratit (3) - 1 freq narrae (3) - 15 freq narra (3) - 38 freq warstit (3) - 1 freq erratic (3) - 4 freq farrant (3) - 21 freq tartit (3) - 1 freq nairrative (3) - 3 freq barrett (3) - 1 freq narrowin (3) - 5 freq |
narratit (0) - 1 freq parrotit (3) - 1 freq narration (3) - 1 freq narrative (3) - 41 freq narrator (3) - 30 freq narrate (3) - 3 freq narrates (3) - 1 freq barrett (4) - 1 freq narrest (4) - 6 freq norration (4) - 1 freq unnerratit (4) - 2 freq nairrative (4) - 3 freq narrete (4) - 1 freq arrayit (4) - 2 freq markatt (5) - 1 freq dairtit (5) - 1 freq earrant (5) - 1 freq forritt (5) - 5 freq nairator (5) - 1 freq varrit (5) - 1 freq nairative (5) - 3 freq pairtit (5) - 21 freq narrie (5) - 1 freq arrestit (5) - 7 freq narraer (5) - 1 freq |
SoundEx code - N633 narratit - 1 freq nae-airtit - 1 freq |
MetaPhone code - NRTT narratit - 1 freq nae-airtit - 1 freq |
NARRATIT |
| Time to execute Levenshtein function - 0.244827 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.384269 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.028380 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.038063 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.000922 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. |