| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| newsagents (0) - 4 freq newsagent (1) - 2 freq newsagent's (1) - 1 freq newspages (3) - 1 freq newsan (4) - 2 freq newman's (4) - 6 freq newlands (4) - 2 freq newspapers (4) - 38 freq newfangelt (4) - 2 freq peasants (4) - 11 freq newsmen (4) - 2 freq newsins (4) - 4 freq waments (4) - 1 freq €œreagents (4) - 1 freq messages (4) - 148 freq testaments (4) - 4 freq vestments (4) - 1 freq bew-prents (4) - 1 freq agents (4) - 7 freq residents (4) - 6 freq newmains (4) - 1 freq newsnet (4) - 2 freq resydents (4) - 1 freq repents (5) - 2 freq waen's (5) - 1 freq |
newsagents (0) - 4 freq newsagent's (2) - 1 freq newsagent (2) - 2 freq newsnet (6) - 2 freq newsins (6) - 4 freq newspages (6) - 1 freq waments (7) - 1 freq €œreagents (7) - 1 freq resydents (7) - 1 freq newmains (7) - 1 freq agents (7) - 7 freq residents (7) - 6 freq newsmen (7) - 2 freq newspapers (7) - 38 freq newman's (7) - 6 freq newsan (7) - 2 freq peasants (7) - 11 freq newlands (7) - 2 freq sants (8) - 1 freq resigns (8) - 1 freq wagons (8) - 7 freq scents (8) - 5 freq newsnight (8) - 2 freq saunts (8) - 5 freq nieaevents (8) - 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 - NSJNTS newsagents - 4 freq newsagent's - 1 freq |
NEWSAGENTS |
| Time to execute Levenshtein function - 0.243979 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.488989 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.038893 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.055401 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.001468 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. |