| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| neighbour (0) - 42 freq neighbours (1) - 44 freq neighboor (1) - 1 freq neichbour (1) - 1 freq neighbor (1) - 2 freq neighbouran (2) - 1 freq neichbours (2) - 2 freq neibour (2) - 28 freq neighbour's (2) - 5 freq nighbours (2) - 3 freq neighbourin (2) - 5 freq neighbours' (2) - 1 freq neighboo (2) - 1 freq nighber (3) - 7 freq neibor (3) - 3 freq neighbouring (3) - 1 freq neighbours (3) - 1 freq nichtbour (3) - 2 freq neibours (3) - 19 freq neebour (3) - 37 freq nighbors (3) - 1 freq neibours' (4) - 1 freq seigneur (4) - 1 freq nzlabour (4) - 1 freq neethur (4) - 2 freq |
neighbour (0) - 42 freq neighboor (1) - 1 freq neighbor (1) - 2 freq neichbour (2) - 1 freq neighbours (2) - 44 freq nighbours (3) - 3 freq neighbourin (3) - 5 freq nighber (3) - 7 freq neighbouran (3) - 1 freq neighboo (3) - 1 freq nighbors (4) - 1 freq neighbour's (4) - 5 freq neichbours (4) - 2 freq neighbours' (4) - 1 freq neibour (4) - 28 freq neebour (5) - 37 freq nichtbour (5) - 2 freq nighbers (5) - 11 freq neighbouring (5) - 1 freq neibor (5) - 3 freq neebur (6) - 11 freq neigh (6) - 4 freq neibours (6) - 19 freq neeboor (6) - 1 freq neiger (6) - 1 freq |
SoundEx code - N216 neighbour - 42 freq neighbourin - 5 freq nae-use-fur-nothin - 1 freq neighbours - 44 freq neighbourhood - 4 freq neighbour's - 5 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 neighbours' - 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 - NFBR neighbour - 42 freq nighber - 7 freq neighboor - 1 freq neighbor - 2 freq |
NEIGHBOUR |
| Time to execute Levenshtein function - 0.216323 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.388329 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.027786 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.037238 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.000887 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. |