| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| urchins (0) - 2 freq hurchins (1) - 2 freq urchin (1) - 2 freq chins (2) - 5 freq hurchin (2) - 11 freq archin (2) - 1 freq orchids (2) - 2 freq etchins (2) - 1 freq orichins (2) - 1 freq orchis (2) - 1 freq lurchin (2) - 1 freq grazins (3) - 1 freq sechin (3) - 2 freq cursins (3) - 1 freq chink (3) - 13 freq whins (3) - 12 freq 'rins (3) - 1 freq uncans (3) - 4 freq merchin (3) - 2 freq airchin's (3) - 1 freq airchis (3) - 1 freq chinks (3) - 1 freq shins (3) - 3 freq chips (3) - 118 freq burthens (3) - 1 freq |
urchins (0) - 2 freq orichins (2) - 1 freq urchin (2) - 2 freq hurchins (2) - 2 freq orchis (3) - 1 freq orchids (3) - 2 freq etchins (3) - 1 freq chins (3) - 5 freq rochians (3) - 1 freq archin (3) - 1 freq merchans (4) - 4 freq taichins (4) - 1 freq souchins (4) - 1 freq archie's (4) - 14 freq arches (4) - 17 freq rehns (4) - 1 freq airchin (4) - 3 freq cheins (4) - 2 freq chains (4) - 38 freq schons (4) - 1 freq erches (4) - 1 freq machines (4) - 48 freq chans (4) - 1 freq archives (4) - 9 freq chines (4) - 7 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 - URXNS urchins - 2 freq |
URCHINS |
| Time to execute Levenshtein function - 0.233140 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.419714 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.033234 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.039411 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.000984 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. |