| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ullans (0) - 32 freq uplans (1) - 2 freq islans (2) - 5 freq shullans (2) - 1 freq uplands (2) - 2 freq plans (2) - 104 freq uplan (2) - 4 freq alans (2) - 2 freq loans (2) - 11 freq allan (2) - 91 freq cleans (2) - 9 freq willans (2) - 1 freq ulls (2) - 1 freq sulla's (2) - 1 freq leans (2) - 17 freq ulan (2) - 1 freq uncans (2) - 4 freq allays (2) - 1 freq ellons (2) - 1 freq gullane (2) - 2 freq flans (2) - 3 freq uplins (2) - 1 freq lans (2) - 15 freq gleans (2) - 1 freq uplauns (2) - 2 freq |
ullans (0) - 32 freq uplans (2) - 2 freq ellons (2) - 1 freq gleans (3) - 1 freq uplauns (3) - 2 freq lans (3) - 15 freq flans (3) - 3 freq albans (3) - 1 freq uplins (3) - 1 freq sloans (3) - 1 freq lallans (3) - 136 freq ellan (3) - 2 freq ella's (3) - 10 freq solans (3) - 3 freq allays (3) - 1 freq hallans (3) - 1 freq clans (3) - 26 freq millans (3) - 1 freq allan (3) - 91 freq loans (3) - 11 freq alans (3) - 2 freq plans (3) - 104 freq willans (3) - 1 freq cleans (3) - 9 freq ulls (3) - 1 freq |
SoundEx code - U452 ullans - 32 freq ullanscentre - 2 freq uillymac - 1 freq |
MetaPhone code - ULNS ullans - 32 freq |
ULLANS |
| Time to execute Levenshtein function - 0.203281 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.352353 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.030049 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.038206 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.000916 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. |