| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| neeborhoose (0) - 1 freq neeborhood (2) - 2 freq neeburhood (3) - 1 freq neebouhood (3) - 1 freq neebourhood (3) - 1 freq neebors' (4) - 2 freq keb-hoose (4) - 1 freq neebors (4) - 79 freq eebroos (4) - 20 freq neeborheids (4) - 1 freq neebor's (4) - 5 freq neeborheid (4) - 2 freq neibourhood (4) - 1 freq keep-hoose (4) - 3 freq neebours (5) - 33 freq alehoose (5) - 1 freq nort-hoose (5) - 1 freq neebours' (5) - 1 freq claverhoose (5) - 3 freq bylerhoose (5) - 5 freq weedowhood (5) - 1 freq broose (5) - 1 freq treehoose (5) - 3 freq fermhoose (5) - 12 freq neebour's (5) - 5 freq |
neeborhoose (0) - 1 freq neeborhood (3) - 2 freq neebourhood (4) - 1 freq neeburhood (4) - 1 freq neebor's (5) - 5 freq neeborheids (5) - 1 freq neeborheid (5) - 2 freq neibourhood (5) - 1 freq neebors (5) - 79 freq neebouhood (5) - 1 freq neebirs (6) - 9 freq neeburs (6) - 7 freq neibors (6) - 7 freq eebroos (6) - 20 freq neebours (6) - 33 freq neebors' (6) - 2 freq keb-hoose (6) - 1 freq neebur's (6) - 4 freq neebour's (6) - 5 freq neebourheid (6) - 1 freq newhouse (7) - 1 freq e'ebroos (7) - 1 freq newborns (7) - 1 freq neebor (7) - 43 freq torhouse (7) - 1 freq |
SoundEx code - N162 neebors - 79 freq neibors - 7 freq neeburs - 7 freq niebuhrs - 2 freq niebuhr's - 2 freq novercal - 1 freq neebours - 33 freq neep-perk - 2 freq neibours - 19 freq neibour's - 1 freq neibours' - 1 freq nappers - 6 freq neebor's - 5 freq neebour's - 5 freq neebours' - 1 freq never-stap - 2 freq 'never-stap - 1 freq neebur's - 4 freq neepers - 5 freq nivvers - 1 freq nippers - 2 freq nibors - 2 freq neipours - 8 freq nivver's - 1 freq napier's - 1 freq neebirs - 9 freq neebors' - 2 freq neeborhoose - 1 freq neipers - 2 freq nefariously - 1 freq niffers - 1 freq neep-park - 3 freq nbhorizons - 1 freq newburgh - 1 freq newburghfc - 1 freq nayburs - 1 freq |
MetaPhone code - NBRHS neeborhoose - 1 freq |
NEEBORHOOSE |
| Time to execute Levenshtein function - 0.361219 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.784808 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.097506 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.141750 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.000873 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. |