Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
naitlie (0) - 1 freq nailin (2) - 1 freq maistlie (2) - 19 freq naiture (2) - 4 freq cattlie (2) - 2 freq nairrie (2) - 1 freq namelie (2) - 3 freq sairlie (2) - 6 freq vaillie (2) - 1 freq pairlie (2) - 1 freq laithlie (2) - 1 freq tailie (2) - 7 freq naitir (2) - 1 freq aillie (2) - 1 freq airlie (2) - 47 freq mailie (2) - 3 freq pairtlie (2) - 2 freq saftlie (2) - 2 freq naithin (2) - 3 freq dailie (2) - 8 freq maislie (2) - 1 freq bailie (2) - 6 freq gritlie (2) - 1 freq mainlie (2) - 2 freq natalie (2) - 7 freq |
naitlie (0) - 1 freq natalie (2) - 7 freq naitir (3) - 1 freq naitralie (3) - 1 freq ainlie (3) - 116 freq natale (3) - 1 freq tailie (3) - 7 freq saintlie (3) - 1 freq quaitlie (3) - 2 freq naiture (3) - 4 freq namelie (3) - 3 freq hantle (4) - 115 freq newlie (4) - 1 freq naiterel (4) - 1 freq atli (4) - 1 freq tuilie (4) - 1 freq naetir (4) - 1 freq title (4) - 64 freq naetril (4) - 1 freq notie (4) - 8 freq nellie (4) - 42 freq gantle (4) - 1 freq aantie (4) - 2 freq oantil (4) - 1 freq anelie (4) - 25 freq |
SoundEx code - N340 neatly - 26 freq needle - 39 freq nately - 2 freq nettle - 8 freq noddle - 2 freq noodle - 7 freq natal - 2 freq newtyle - 2 freq ïntil - 2 freq nae-tail - 1 freq needly - 4 freq nyeetle - 1 freq natalie - 7 freq neidil - 1 freq naitlie - 1 freq nae-deal - 1 freq natale - 1 freq nuttella - 1 freq nuttall - 1 freq |
MetaPhone code - NTL neatly - 26 freq needle - 39 freq nately - 2 freq nettle - 8 freq noddle - 2 freq noodle - 7 freq natal - 2 freq newtyle - 2 freq ïntil - 2 freq know-it-all - 1 freq nae-tail - 1 freq needly - 4 freq natalie - 7 freq neidil - 1 freq naitlie - 1 freq nae-deal - 1 freq natale - 1 freq nuttella - 1 freq nuttall - 1 freq |
NAITLIE |
Time to execute Levenshtein function - 0.461185 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.730432 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.087539 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.111057 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.000839 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. |