| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jerbs (0) - 1 freq kerbs (1) - 3 freq serbs (1) - 2 freq verbs (1) - 98 freq jerks (1) - 1 freq yerbs (1) - 2 freq herbs (1) - 14 freq jeegs (2) - 1 freq yerds (2) - 4 freq terms (2) - 133 freq berts (2) - 1 freq jesus (2) - 835 freq errs (2) - 1 freq kerds (2) - 1 freq jeyes (2) - 1 freq terrs (2) - 1 freq cerys (2) - 1 freq yer's (2) - 2 freq derby (2) - 13 freq perks (2) - 9 freq jambs (2) - 1 freq her's (2) - 3 freq ferns (2) - 7 freq yerns (2) - 1 freq yers (2) - 19 freq |
jerbs (0) - 1 freq yerbs (2) - 2 freq jerks (2) - 1 freq herbs (2) - 14 freq verbs (2) - 98 freq kerbs (2) - 3 freq serbs (2) - 2 freq jobs (3) - 78 freq jarls (3) - 11 freq jervis (3) - 1 freq joris (3) - 1 freq rbs (3) - 1 freq gorbs (3) - 1 freq urbs (3) - 1 freq jabs (3) - 2 freq jars (3) - 21 freq barbs (3) - 1 freq joabs (3) - 33 freq rebs (3) - 3 freq jrb (3) - 3 freq jeers (3) - 1 freq jambs (3) - 1 freq debs (4) - 1 freq teribus (4) - 1 freq probs (4) - 8 freq |
SoundEx code - J612 jury-boax - 4 freq jervis - 1 freq jury-box - 19 freq jorvik - 1 freq jury-fowk - 1 freq jerbs - 1 freq |
MetaPhone code - JRBS jerbs - 1 freq |
JERBS |
| Time to execute Levenshtein function - 0.501086 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.506715 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.028156 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.039218 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.001113 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. |