| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| urchin (0) - 2 freq lurchin (1) - 1 freq archin (1) - 1 freq urchins (1) - 2 freq hurchin (1) - 11 freq tichin (2) - 1 freq marchin (2) - 24 freq furckin (2) - 1 freq itchin (2) - 11 freq lachin (2) - 46 freq brechin (2) - 14 freq hurchins (2) - 2 freq pechin (2) - 86 freq machin (2) - 1 freq sichin (2) - 8 freq huchin (2) - 1 freq munchin (2) - 12 freq trehin (2) - 7 freq erchie (2) - 59 freq orchis (2) - 1 freq orchid (2) - 5 freq bunchin (2) - 1 freq inchin (2) - 2 freq dunchin (2) - 5 freq chin (2) - 151 freq |
urchin (0) - 2 freq archin (1) - 1 freq airchin (2) - 3 freq hurchin (2) - 11 freq lurchin (2) - 1 freq urchins (2) - 2 freq merchin (3) - 2 freq etchin (3) - 1 freq sechin (3) - 2 freq chin (3) - 151 freq inchin (3) - 2 freq arcin (3) - 2 freq bachin (3) - 2 freq kychin (3) - 1 freq reachin (3) - 32 freq rochian (3) - 1 freq arhin (3) - 1 freq orchid (3) - 5 freq archie (3) - 92 freq hechin (3) - 3 freq achin (3) - 14 freq marchin (3) - 24 freq pechin (3) - 86 freq brechin (3) - 14 freq lachin (3) - 46 freq |
SoundEx code - U625 urgency - 9 freq urchin - 2 freq urgent - 16 freq urgently - 7 freq urchins - 2 freq urjent - 1 freq urging - 1 freq urzum - 1 freq |
MetaPhone code - URXN urchin - 2 freq |
URCHIN |
| Time to execute Levenshtein function - 0.198355 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.371488 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.029009 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.038399 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.000912 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. |