| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| overalls (0) - 4 freq overall (1) - 6 freq coverall (2) - 1 freq recalls (3) - 5 freq overkill (3) - 2 freq emeralds (3) - 10 freq overlap (3) - 1 freq averill (3) - 1 freq overs (3) - 2 freq verball (3) - 1 freq overseas (3) - 2 freq averillb (3) - 1 freq overly (3) - 6 freq operas (3) - 3 freq orally (3) - 2 freq vera's (3) - 3 freq gomerals (3) - 1 freq eyeballs (3) - 4 freq rover'll (3) - 1 freq iterally (3) - 1 freq oversell (3) - 1 freq owerhails (3) - 1 freq operates (3) - 4 freq overtly (3) - 1 freq verbals (3) - 1 freq |
overalls (0) - 4 freq overall (2) - 6 freq averill (4) - 1 freq averillb (4) - 1 freq verbals (4) - 1 freq coverall (4) - 1 freq trolls (5) - 6 freq verbally (5) - 1 freq owerhails (5) - 1 freq overflow (5) - 2 freq overtly (5) - 1 freq trills (5) - 2 freq drills (5) - 14 freq miralles (5) - 2 freq rills (5) - 1 freq rolls (5) - 94 freq oversell (5) - 1 freq frills (5) - 1 freq valles (5) - 1 freq orrals (5) - 12 freq overlap (5) - 1 freq emeralds (5) - 10 freq overly (5) - 6 freq iterally (5) - 1 freq overseas (5) - 2 freq |
SoundEx code - O164 overly - 6 freq overruled - 3 freq overlooking - 2 freq overwhelmed - 7 freq overloaded - 2 freq overall - 6 freq overlappin - 2 freq overwhelmin - 7 freq overlap - 1 freq overladen - 1 freq overload - 2 freq overalls - 4 freq overwhelms - 1 freq o'freeloaders - 1 freq overlandertheb - 2 freq overlooked - 1 freq overwhelming - 1 freq |
MetaPhone code - OFRLS overalls - 4 freq |
OVERALLS |
| Time to execute Levenshtein function - 0.228957 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.351526 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.031046 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.036609 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.000828 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. |