| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yillmuirs (0) - 1 freq yillmuir (1) - 8 freq yilmuir (2) - 1 freq fillums (4) - 5 freq killers (4) - 9 freq hillies (4) - 11 freq yill's (4) - 1 freq yirlins (4) - 1 freq fillers (4) - 1 freq pillars (4) - 12 freq tillies (4) - 1 freq smuirs (4) - 3 freq fillims (4) - 2 freq millies (4) - 1 freq willies (4) - 6 freq lillias (4) - 1 freq villains (4) - 3 freq muirs (4) - 21 freq villius (4) - 2 freq lillies (4) - 1 freq millburn (4) - 2 freq sillies (4) - 1 freq sillars (4) - 2 freq billies (4) - 14 freq iyillies (4) - 1 freq |
yillmuirs (0) - 1 freq yillmuir (2) - 8 freq yilmuir (4) - 1 freq illums (5) - 1 freq villagers (6) - 5 freq yul-girs (6) - 1 freq sillars (6) - 2 freq lillies (6) - 1 freq iyillies (6) - 1 freq yills (6) - 2 freq fulmars (6) - 2 freq allers (6) - 1 freq pillers (6) - 2 freq muirs (6) - 21 freq fluirs (6) - 4 freq vimmirs (6) - 1 freq pillars (6) - 12 freq smuirs (6) - 3 freq yill's (6) - 1 freq killers (6) - 9 freq fillums (6) - 5 freq fillims (6) - 2 freq fillers (6) - 1 freq lillias (6) - 1 freq limmers (6) - 4 freq |
SoundEx code - Y456 yellowhammer - 3 freq yillmuir - 8 freq yilmuir - 1 freq yillmuirs - 1 freq |
MetaPhone code - YLMRS yillmuirs - 1 freq |
YILLMUIRS |
| Time to execute Levenshtein function - 0.214489 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.367085 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.029882 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.038262 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.000901 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. |