| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| newsagent (0) - 2 freq newsagents (1) - 4 freq newsagent's (2) - 1 freq newfangelt (3) - 2 freq newsnet (3) - 2 freq newsmen (3) - 2 freq newspages (3) - 1 freq newsan (3) - 2 freq hereanent (4) - 1 freq new-fangelt (4) - 3 freq newspaper (4) - 63 freq newsins (4) - 4 freq easement (4) - 9 freq leistent (4) - 3 freq messaging (4) - 1 freq neatest (4) - 1 freq wakent (4) - 5 freq resurgent (4) - 1 freq ane-saet (4) - 1 freq newbiggit (4) - 1 freq nerve-agent (4) - 1 freq newsround (4) - 1 freq regent (4) - 6 freq newmarket (4) - 1 freq resident (4) - 16 freq |
newsagent (0) - 2 freq newsagents (2) - 4 freq newsnet (4) - 2 freq newsagent's (4) - 1 freq newsmen (5) - 2 freq newsan (5) - 2 freq newest (6) - 15 freq newsin (6) - 29 freq eensident (6) - 1 freq ensident (6) - 1 freq newsing (6) - 1 freq nascent (6) - 3 freq newbiggit (6) - 1 freq newsnight (6) - 2 freq designt (6) - 1 freq lowsent (6) - 2 freq newsround (6) - 1 freq newsins (6) - 4 freq newspages (6) - 1 freq newfangelt (6) - 2 freq newman (7) - 20 freq nearest (7) - 64 freq newman' (7) - 1 freq incessant (7) - 1 freq festent (7) - 1 freq |
SoundEx code - N225 newsagents - 4 freq newsagent - 2 freq newsagent's - 1 freq njoosin - 1 freq niceconvos - 1 freq nkohagjmah - 1 freq noseisnumb - 1 freq |
MetaPhone code - NSJNT newsagent - 2 freq |
NEWSAGENT |
| Time to execute Levenshtein function - 0.393519 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.728668 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.082574 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.098684 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.001159 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. |