| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uising (0) - 2 freq uisin' (1) - 1 freq rising (1) - 14 freq uisin (1) - 105 freq using (1) - 35 freq casing (2) - 1 freq liking (2) - 20 freq kissing (2) - 2 freq wishing (2) - 7 freq risking (2) - 3 freq uisein (2) - 9 freq airing (2) - 1 freq pining (2) - 1 freq risins (2) - 2 freq suiting (2) - 1 freq biding (2) - 9 freq aisin (2) - 1 freq piping (2) - 5 freq hosing (2) - 1 freq usin (2) - 97 freq living (2) - 49 freq eisin (2) - 1 freq raising (2) - 7 freq listing (2) - 4 freq mining (2) - 5 freq |
uising (0) - 2 freq using (1) - 35 freq sing (2) - 350 freq yasing (2) - 2 freq yaising (2) - 1 freq uisin (2) - 105 freq rising (2) - 14 freq uisin' (2) - 1 freq musing (3) - 1 freq unsung (3) - 2 freq usin' (3) - 1 freq aisling (3) - 1 freq desing (3) - 2 freq losing (3) - 14 freq aisins (3) - 1 freq asang (3) - 1 freq sang (3) - 623 freq sung (3) - 68 freq saying (3) - 109 freq song (3) - 144 freq icing (3) - 8 freq singe (3) - 3 freq eisins (3) - 1 freq seeing (3) - 60 freq hosing (3) - 1 freq |
SoundEx code - U252 using - 35 freq uising - 2 freq uwjenc - 1 freq uknyc - 1 freq ukchange - 2 freq uqngch - 1 freq ugnz - 1 freq ucknqo - 1 freq usmoocqvlc - 1 freq ukcongress - 1 freq |
MetaPhone code - USNK using - 35 freq uising - 2 freq |
UISING |
| Time to execute Levenshtein function - 0.602756 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 - 1.094948 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.086457 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.099757 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.000892 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. |