| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| neebourhood (0) - 1 freq neibourhood (1) - 1 freq neeborhood (1) - 2 freq neebouhood (1) - 1 freq neeburhood (1) - 1 freq neebourheid (2) - 1 freq neeborheid (3) - 2 freq neibourheid (3) - 1 freq neibourhuid (3) - 2 freq neighbourhood (3) - 4 freq neeborhoose (3) - 1 freq neighbourhoods (4) - 1 freq neebourin (4) - 3 freq neebour's (4) - 5 freq weedowhood (4) - 1 freq neeborheids (4) - 1 freq neebour (4) - 37 freq neebouring (4) - 1 freq neebourly (4) - 1 freq neebored (4) - 1 freq neebours (4) - 33 freq neebours' (4) - 1 freq netherwood (5) - 7 freq neeboor (5) - 1 freq herbourous (5) - 1 freq |
neebourhood (0) - 1 freq neeburhood (1) - 1 freq neeborhood (1) - 2 freq neibourhood (1) - 1 freq neebourheid (2) - 1 freq neebouhood (2) - 1 freq neibourheid (3) - 1 freq neibourhuid (3) - 2 freq neeborheid (3) - 2 freq neeborhoose (4) - 1 freq neeborheids (5) - 1 freq neighbourhood (5) - 4 freq neebored (5) - 1 freq neebourly (6) - 1 freq neebours' (6) - 1 freq neebouring (6) - 1 freq neebours (6) - 33 freq neebourin (6) - 3 freq neebour (6) - 37 freq neebour's (6) - 5 freq boyhood (7) - 6 freq neibour's (7) - 1 freq neibours' (7) - 1 freq neeburrin (7) - 1 freq neebors (7) - 79 freq |
SoundEx code - N163 neibourheid - 1 freq newport - 3 freq nivver-do-weels - 1 freq neibourhuid - 2 freq neeborhood - 2 freq nivver-the-les - 2 freq nevertheless - 4 freq nivvirdoomynd - 1 freq neibourhood - 1 freq niffered - 2 freq neeborheid - 2 freq neebored - 1 freq niffert - 1 freq nivvertheless - 4 freq nivertheless - 1 freq neebourhood - 1 freq neeborheids - 1 freq neeburhood - 1 freq newportbakery - 1 freq neebourheid - 1 freq nfrtz - 1 freq |
MetaPhone code - NBRHT neibourheid - 1 freq neibourhuid - 2 freq neeborhood - 2 freq neibourhood - 1 freq neeborheid - 2 freq neebourhood - 1 freq neeburhood - 1 freq neebourheid - 1 freq |
NEEBOURHOOD |
| Time to execute Levenshtein function - 0.219194 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.499325 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.062200 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.077827 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.001999 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. |