| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| trollop (0) - 1 freq trollopy (1) - 1 freq trollope (1) - 2 freq trollops (1) - 1 freq trolley (2) - 27 freq trolly (2) - 1 freq collop (2) - 1 freq troll (2) - 11 freq rolltop (2) - 1 freq rollon (2) - 1 freq dollop (2) - 3 freq troop (2) - 11 freq trolls (2) - 6 freq gollop (2) - 9 freq trolled (2) - 1 freq trollin (2) - 1 freq rollie (3) - 4 freq trolleys (3) - 4 freq 'hollow (3) - 1 freq traller (3) - 1 freq groop (3) - 1 freq treelip (3) - 2 freq tohlp (3) - 1 freq roller (3) - 27 freq trollach (3) - 1 freq |
trollop (0) - 1 freq trollope (1) - 2 freq trollopy (1) - 1 freq trollops (2) - 1 freq trolls (3) - 6 freq trolled (3) - 1 freq troll (3) - 11 freq trollin (3) - 1 freq trolly (3) - 1 freq trolley (3) - 27 freq trills (4) - 2 freq trollies (4) - 1 freq trillion (4) - 1 freq treelip (4) - 2 freq trilled (4) - 1 freq trillin (4) - 1 freq trill (4) - 3 freq trellis (4) - 1 freq trellan (4) - 2 freq traller (4) - 1 freq rolltop (4) - 1 freq gollop (4) - 9 freq dollop (4) - 3 freq troop (4) - 11 freq rollon (4) - 1 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 - TRLP trollope - 2 freq trollop - 1 freq treelip - 2 freq trollopy - 1 freq |
TROLLOP |
| Time to execute Levenshtein function - 0.174752 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.450204 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.031542 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.040657 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.000930 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. |