| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| castlereagh (0) - 1 freq castlebrae (4) - 1 freq castlegate (4) - 4 freq castlehill (5) - 2 freq castleview (5) - 2 freq caterers (5) - 1 freq antlered (5) - 1 freq castled (5) - 1 freq castle (5) - 157 freq castles (5) - 26 freq pasturage (5) - 1 freq cattleman (5) - 2 freq castleton (5) - 1 freq castkegate (5) - 1 freq cateran (5) - 3 freq caterer (5) - 1 freq castrato (5) - 1 freq cattered (5) - 2 freq castrati (5) - 1 freq castle' (5) - 2 freq cattlemen (5) - 1 freq caterans (5) - 5 freq castlemulk (5) - 1 freq casters (5) - 2 freq cattler (5) - 3 freq |
castlereagh (0) - 1 freq castlegate (6) - 4 freq castlebrae (7) - 1 freq casters (8) - 2 freq cattler (8) - 3 freq castlewynd (8) - 1 freq castrati (8) - 1 freq steerage (8) - 6 freq castlemulk (8) - 1 freq castlemilk (8) - 3 freq castellano (8) - 1 freq castle's (8) - 1 freq caster (8) - 2 freq castrato (8) - 1 freq castle-neuk (8) - 1 freq castrate (8) - 2 freq castle' (8) - 2 freq pasturage (8) - 1 freq castles (8) - 26 freq castle (8) - 157 freq castled (8) - 1 freq castkegate (8) - 1 freq castleton (8) - 1 freq castleview (8) - 2 freq castlehill (8) - 2 freq |
SoundEx code - C234 castle - 157 freq cocktail - 21 freq caistle - 4 freq castle-neuk - 1 freq castle's - 1 freq coastline - 6 freq castles - 26 freq costly - 4 freq coastlie - 1 freq cocktails' - 1 freq castlehill - 2 freq coastal - 11 freq castell - 1 freq cocktails - 9 freq castled - 1 freq castellis - 1 freq castlekennedygardens - 1 freq castlemulk - 1 freq castlereagh - 1 freq castel - 8 freq castels - 2 freq €˜castalian - 1 freq castlemilk - 3 freq caistlehull - 1 freq castlewynd - 1 freq castlegate - 4 freq castleton - 1 freq castiel - 1 freq castellano - 1 freq castlvillageman - 1 freq castle' - 2 freq coastalgrampian - 1 freq castleview - 2 freq castlebrae - 1 freq |
MetaPhone code - KSTLRF castlereagh - 1 freq |
CASTLEREAGH |
| Time to execute Levenshtein function - 0.308747 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.476238 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.027693 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.037654 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.000933 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. |