| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| necbours (0) - 1 freq neebours (1) - 33 freq neibours (1) - 19 freq neibour (2) - 28 freq neebour's (2) - 5 freq neibours' (2) - 1 freq neipours (2) - 8 freq neebours' (2) - 1 freq neeburs (2) - 7 freq neebors (2) - 79 freq herbours (2) - 2 freq neibour's (2) - 1 freq neebour (2) - 37 freq neichbours (2) - 2 freq neibors (2) - 7 freq nighbours (3) - 3 freq neebirs (3) - 9 freq neebor's (3) - 5 freq nacrous (3) - 1 freq neebur's (3) - 4 freq laabours (3) - 1 freq nervous (3) - 80 freq neichbour (3) - 1 freq lecturs (3) - 4 freq newborn (3) - 11 freq |
necbours (0) - 1 freq neibours (2) - 19 freq neebours (2) - 33 freq neeburs (3) - 7 freq neebors (3) - 79 freq neichbours (3) - 2 freq neibors (3) - 7 freq nacrous (4) - 1 freq nibors (4) - 2 freq neebour (4) - 37 freq neebirs (4) - 9 freq nayburs (4) - 1 freq neibour's (4) - 1 freq neibour (4) - 28 freq neebour's (4) - 5 freq neipours (4) - 8 freq neibours' (4) - 1 freq neebours' (4) - 1 freq herbours (4) - 2 freq neibourin (5) - 5 freq neebourly (5) - 1 freq recourse (5) - 2 freq neebors' (5) - 2 freq anchors (5) - 1 freq neebourin (5) - 3 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 |
NECBOURS |
| Time to execute Levenshtein function - 0.196396 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.366514 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.029333 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.037113 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.000906 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. |