| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yerb (0) - 1 freq yerk (1) - 3 freq yerl (1) - 1 freq kerb (1) - 6 freq yerd (1) - 7 freq yere (1) - 7 freq herb (1) - 2 freq yer (1) - 8074 freq yers (1) - 20 freq yerbs (1) - 2 freq verb (1) - 129 freq yerw (1) - 1 freq yeus (2) - 4 freq herbs (2) - 14 freq derby (2) - 13 freq germ (2) - 3 freq ytri (2) - 2 freq eery (2) - 2 freq aere (2) - 1 freq evb (2) - 1 freq pero (2) - 1 freq erk (2) - 5 freq yrw (2) - 1 freq ger- (2) - 1 freq yeee (2) - 1 freq |
yerb (0) - 1 freq yerw (2) - 1 freq yerbs (2) - 2 freq rb (2) - 8 freq arb (2) - 4 freq orb (2) - 2 freq yers (2) - 20 freq reeb (2) - 1 freq verb (2) - 129 freq kerb (2) - 6 freq yerl (2) - 1 freq yerk (2) - 3 freq yer (2) - 8074 freq yerd (2) - 7 freq herb (2) - 2 freq yere (2) - 7 freq yvb (3) - 1 freq rib (3) - 8 freq yirp (3) - 1 freq heb (3) - 1 freq ecb (3) - 1 freq rbi (3) - 1 freq xeb (3) - 1 freq beeb (3) - 1 freq arab (3) - 4 freq |
SoundEx code - Y610 yerb - 1 freq yirp - 1 freq yrivvi - 1 freq yoruba - 1 freq yyrof - 1 freq |
MetaPhone code - YRB yerb - 1 freq yoruba - 1 freq |
YERB |
| Time to execute Levenshtein function - 0.284049 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.414910 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.030916 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.039828 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.001412 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. |