| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| trilby (0) - 7 freq trills (2) - 2 freq trigly (2) - 6 freq tibby (2) - 16 freq triy (2) - 2 freq frilly (2) - 8 freq tricky (2) - 10 freq trilogy (2) - 2 freq tristy (2) - 1 freq tribe (2) - 26 freq truly (2) - 127 freq tilly (2) - 12 freq wrily (2) - 1 freq drily (2) - 1 freq trolly (2) - 1 freq trippy (2) - 2 freq riley (2) - 4 freq trill (2) - 3 freq zilly (3) - 1 freq tracy (3) - 13 freq thil (3) - 2 freq toby (3) - 7 freq stripey (3) - 3 freq ridy (3) - 3 freq tabby (3) - 15 freq |
trilby (0) - 7 freq trolly (3) - 1 freq trilogy (3) - 2 freq tribe (3) - 26 freq truly (3) - 127 freq trill (3) - 3 freq trelt (4) - 1 freq trailin (4) - 27 freq traill (4) - 2 freq trailer (4) - 13 freq trolley (4) - 27 freq trailt (4) - 7 freq trailen (4) - 1 freq trailed (4) - 17 freq trails (4) - 14 freq truely (4) - 1 freq trb (4) - 1 freq trials (4) - 19 freq troll (4) - 11 freq trills (4) - 2 freq trulie (4) - 4 freq truil (4) - 1 freq trail (4) - 64 freq trialt (4) - 1 freq tricky (4) - 10 freq |
SoundEx code - T641 trollope - 2 freq trollops - 1 freq tirl-aff - 1 freq trollop - 1 freq trilby - 7 freq trailaboot - 1 freq treelip - 2 freq treelips - 2 freq trollopy - 1 freq treelipin - 2 freq trowlybuses - 1 freq therealbennoooo - 1 freq true-life - 1 freq |
MetaPhone code - TRLB trilby - 7 freq |
TRILBY |
| Time to execute Levenshtein function - 0.207342 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.344548 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.035707 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.037958 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.000941 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. |