| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uyeasound (0) - 1 freq ultrasound (3) - 1 freq seasoun (3) - 1 freq unsound (3) - 1 freq sound (4) - 174 freq treason (4) - 14 freq abound (4) - 2 freq menshund (4) - 1 freq sandsound (4) - 3 freq runaround (4) - 1 freq rebound (4) - 1 freq newsround (4) - 1 freq refound (4) - 1 freq resounds (4) - 2 freq seatoun (4) - 1 freq yasou (4) - 1 freq seasoned (4) - 7 freq expound (4) - 1 freq unsoond (4) - 1 freq €˜sound (4) - 2 freq season (4) - 118 freq teason (4) - 2 freq seasons (4) - 39 freq reasoned (4) - 3 freq unbound (4) - 2 freq |
uyeasound (0) - 1 freq sound (4) - 174 freq unsound (4) - 1 freq asoond (4) - 7 freq sund (5) - 2 freq unsoond (5) - 1 freq reasoned (5) - 3 freq soundo (5) - 1 freq seasoned (5) - 7 freq soundy (5) - 1 freq around (5) - 158 freq saund (5) - 31 freq abound (5) - 2 freq soond (5) - 405 freq seasoun (5) - 1 freq secund (6) - 1 freq yond (6) - 1 freq souns (6) - 52 freq baund (6) - 21 freq wound (6) - 29 freq yeusin (6) - 1 freq easins (6) - 6 freq sounds (6) - 115 freq eapand (6) - 1 freq mound (6) - 8 freq |
SoundEx code - U253 uqmdwv - 1 freq uyeasound - 1 freq |
MetaPhone code - UYSNT uyeasound - 1 freq |
UYEASOUND |
| Time to execute Levenshtein function - 0.222984 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.394695 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.031195 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.038579 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.000896 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. |