| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tumult (0) - 2 freq tumults (1) - 1 freq stumult (1) - 1 freq tumblt (1) - 2 freq tummlt (1) - 8 freq tumilt (1) - 1 freq mumbult (2) - 2 freq tumit (2) - 1 freq fummlt (2) - 1 freq tummlet (2) - 3 freq tumbl't (2) - 1 freq tumt (2) - 1 freq tummelt (2) - 17 freq tummle (2) - 19 freq toult (2) - 1 freq tumml't (2) - 2 freq jumblt (2) - 1 freq hummlt (2) - 3 freq quult (2) - 2 freq tumble (2) - 9 freq rummult (2) - 1 freq rummlt (2) - 1 freq tummilt (2) - 8 freq puult (2) - 4 freq cumuli (2) - 1 freq |
tumult (0) - 2 freq tumilt (1) - 1 freq tumblt (2) - 2 freq tummlt (2) - 8 freq stumult (2) - 1 freq tumults (2) - 1 freq toult (3) - 1 freq tummilt (3) - 8 freq tumt (3) - 1 freq tummelt (3) - 17 freq tumit (3) - 1 freq tummlet (3) - 3 freq timely (4) - 4 freq tumlin (4) - 1 freq tuimt (4) - 8 freq smilt (4) - 1 freq hamilt (4) - 1 freq tempit (4) - 11 freq trialt (4) - 1 freq malt (4) - 19 freq tempt (4) - 9 freq tuimit (4) - 3 freq tamet (4) - 1 freq twalt (4) - 2 freq tirlt (4) - 2 freq |
SoundEx code - T543 tummlet - 3 freq tummilt - 8 freq tummlt - 8 freq tummelt - 17 freq tumults - 1 freq tummled - 4 freq tumult - 2 freq tunnelled - 1 freq tumilt - 1 freq tummelled - 2 freq tömald - 1 freq tumml't - 2 freq |
MetaPhone code - TMLT tumbl't - 1 freq tummlet - 3 freq tummilt - 8 freq tummlt - 8 freq tummelt - 17 freq tumbled - 9 freq tumblt - 2 freq tummled - 4 freq tumult - 2 freq tumilt - 1 freq tummelled - 2 freq tömald - 1 freq tumml't - 2 freq |
TUMULT |
| Time to execute Levenshtein function - 0.196745 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.364845 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.032467 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.037395 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.000857 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. |