| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nicobarese (0) - 1 freq nicolytes (4) - 1 freq nicolas (4) - 1 freq nichtmares (4) - 10 freq coalese (4) - 1 freq nicknames' (4) - 1 freq coarse (4) - 67 freq kickarse (4) - 2 freq nicoles (4) - 1 freq nicola's (4) - 16 freq nicolas (4) - 1 freq nicknames (4) - 1 freq nighbers (5) - 11 freq vicars (5) - 1 freq scotarea (5) - 1 freq unicorms (5) - 1 freq rig-banes (5) - 1 freq icebergs (5) - 5 freq cortese (5) - 1 freq baese (5) - 1 freq nightdress (5) - 1 freq cabaret (5) - 2 freq necklaces (5) - 3 freq recourse (5) - 2 freq caese (5) - 2 freq |
nicobarese (0) - 1 freq nicolas (6) - 1 freq nicola's (6) - 16 freq nickers (6) - 1 freq nibors (6) - 2 freq necbours (6) - 1 freq kickarse (6) - 2 freq nicoles (6) - 1 freq nicolytes (6) - 1 freq coarse (6) - 67 freq unicorns (7) - 9 freq nicklaus (7) - 1 freq 'coorse (7) - 14 freq cobles (7) - 2 freq pictures (7) - 79 freq nirse (7) - 1 freq nayburs (7) - 1 freq course (7) - 498 freq neichbours (7) - 2 freq coars (7) - 1 freq neebirs (7) - 9 freq carse (7) - 17 freq cores (7) - 3 freq jacobites (7) - 16 freq coorse (7) - 831 freq |
SoundEx code - N216 neighbour - 42 freq neighbourin - 5 freq nae-use-fur-nothin - 1 freq neighbours - 45 freq neighbourhood - 4 freq neighbour's - 6 freq neighbours' - 3 freq nighbers - 11 freq nighber - 7 freq nighberheid - 1 freq new-sprung - 1 freq neighboor - 1 freq neighbor - 2 freq nighberin - 1 freq ïnnkeeper - 1 freq nighbours - 3 freq nighbors - 1 freq necbours - 1 freq neichbours - 2 freq neichbour - 1 freq neighbouran - 1 freq nicobarese - 1 freq neighbouring - 1 freq neighbourhoods - 1 freq nickybyrneoffic - 9 freq nickybyrne - 4 freq neighbours - 1 freq nickprochford - 1 freq nickyforvictory - 1 freq |
MetaPhone code - NKBRS necbours - 1 freq nicobarese - 1 freq |
NICOBARESE |
| Time to execute Levenshtein function - 0.232555 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.439069 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.027201 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.037640 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.000944 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. |