| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| topple (0) - 1 freq tipple (1) - 3 freq toppled (1) - 3 freq epple (2) - 13 freq topper (2) - 12 freq toggle (2) - 1 freq triple (2) - 12 freq dapple (2) - 2 freq souple (2) - 12 freq aipple (2) - 102 freq toppen (2) - 1 freq toodle (2) - 2 freq apple (2) - 30 freq tripple (2) - 1 freq torfle (2) - 1 freq stoppe (2) - 1 freq topped (2) - 1 freq toozle (2) - 1 freq toppit (2) - 1 freq toole (2) - 1 freq toddle (2) - 3 freq tippie (2) - 3 freq sapple (2) - 1 freq ripple (2) - 7 freq nipple (2) - 3 freq |
topple (0) - 1 freq tipple (1) - 3 freq toppled (2) - 3 freq nipple (3) - 3 freq toppin (3) - 5 freq ripple (3) - 7 freq tippie (3) - 3 freq temple (3) - 87 freq sapple (3) - 1 freq trapple (3) - 3 freq cupple (3) - 2 freq kipple (3) - 2 freq papple (3) - 1 freq toppit (3) - 1 freq toppd (3) - 1 freq toppet (3) - 2 freq supple (3) - 6 freq aipple (3) - 102 freq toppen (3) - 1 freq dapple (3) - 2 freq topper (3) - 12 freq epple (3) - 13 freq apple (3) - 30 freq triple (3) - 12 freq tripple (3) - 1 freq |
SoundEx code - T140 table - 686 freq tipple - 3 freq twa-fal - 1 freq twa-faul - 1 freq tebel - 1 freq taible - 2 freq topple - 1 freq tibble - 18 freq tivoli - 5 freq teeble - 6 freq taibil - 3 freq taeble - 3 freq t'boyl - 1 freq the-ablow - 2 freq tap'll - 1 freq tfel - 1 freq tyfbl - 1 freq table' - 1 freq tvl - 1 freq tbl - 1 freq |
MetaPhone code - TPL deeply - 37 freq deeplie - 1 freq deploy - 4 freq tipple - 3 freq topple - 1 freq tap'll - 1 freq dapple - 2 freq dupl - 1 freq diplo - 1 freq |
TOPPLE |
| Time to execute Levenshtein function - 0.183128 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.356818 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.028343 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.039140 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.000942 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. |