| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| urban (0) - 42 freq turban (1) - 4 freq 'urban (1) - 1 freq ubtan (2) - 1 freq uncan (2) - 57 freq unean (2) - 1 freq groan (2) - 19 freq urn (2) - 6 freq urbs (2) - 1 freq croan (2) - 1 freq ergan (2) - 1 freq hurtan (2) - 1 freq duran (2) - 3 freq ubun (2) - 1 freq furbas (2) - 1 freq traan (2) - 1 freq ulan (2) - 1 freq wran (2) - 2 freq graan (2) - 14 freq gran (2) - 232 freq ran (2) - 448 freq husban (2) - 4 freq purran (2) - 3 freq cryan (2) - 1 freq curvan (2) - 1 freq |
urban (0) - 42 freq 'urban (2) - 1 freq turban (2) - 4 freq ran (3) - 448 freq ebban (3) - 1 freq arabian (3) - 1 freq arran (3) - 15 freq hoban (3) - 5 freq organ (3) - 16 freq urnae (3) - 31 freq irtan (3) - 1 freq giban (3) - 1 freq rubban (3) - 3 freq iran (3) - 2 freq cuban (3) - 2 freq rba (3) - 1 freq roan (3) - 4 freq urn (3) - 6 freq erran (3) - 3 freq reiban (3) - 2 freq aran (3) - 5 freq urbs (3) - 1 freq ban (3) - 48 freq ubun (3) - 1 freq ryan (3) - 29 freq |
SoundEx code - U615 urban - 42 freq 'urban - 1 freq €˜urban - 1 freq urbanisation - 1 freq urbanisms - 1 freq urbanites - 1 freq urbanpirate - 1 freq |
MetaPhone code - URBN urban - 42 freq 'urban - 1 freq €˜urban - 1 freq |
URBAN |
| Time to execute Levenshtein function - 0.192455 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.321258 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.029798 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.044477 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.000862 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. |