| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| newlins (0) - 2 freq newsins (1) - 4 freq healins (2) - 1 freq trewlins (2) - 3 freq yerlins (2) - 1 freq peelins (2) - 4 freq perlins (2) - 3 freq newbies (2) - 1 freq newlands (2) - 2 freq newsin (2) - 29 freq mellins (2) - 1 freq jewlis (2) - 1 freq dealins (2) - 5 freq newlie (2) - 1 freq norlins (2) - 1 freq heilins (2) - 1 freq nyowlins (2) - 1 freq newin (2) - 1 freq pewlin (2) - 1 freq mewlin (2) - 1 freq newsing (2) - 1 freq tellins (2) - 3 freq nearlins (2) - 6 freq feelins (2) - 73 freq newmains (2) - 1 freq |
newlins (0) - 2 freq newsins (2) - 4 freq nyowlins (2) - 1 freq nearlins (3) - 6 freq norlins (3) - 1 freq weelins (3) - 1 freq newlands (3) - 2 freq newmains (3) - 1 freq newmilns (3) - 4 freq yealins (4) - 1 freq newsin (4) - 29 freq ceilins (4) - 8 freq derlins (4) - 1 freq yerlins (4) - 1 freq eilins (4) - 4 freq norlans (4) - 1 freq lowlans (4) - 1 freq lawlans (4) - 6 freq walins (4) - 2 freq inklins (4) - 2 freq nylons (4) - 1 freq healins (4) - 1 freq feelins (4) - 73 freq trewlins (4) - 3 freq peelins (4) - 4 freq |
SoundEx code - N452 nolan's - 2 freq nae-weelness - 1 freq newlins - 2 freq nylons - 1 freq neilmac - 1 freq nyowlins - 1 freq nilyungun - 11 freq €œnilyungun - 1 freq nailing - 3 freq nolongnow - 1 freq nlmkccvmv - 1 freq nalliancescot - 1 freq neilmacpherso - 1 freq nolongtiltheygo - 1 freq neilmackay - 1 freq neilmclaughlin - 1 freq |
MetaPhone code - NLNS nolan's - 2 freq newlins - 2 freq nylons - 1 freq |
NEWLINS |
| Time to execute Levenshtein function - 0.247570 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.408150 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.028537 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.040100 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.000816 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. |