| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| catapult (0) - 1 freq cataract (3) - 5 freq catall (3) - 1 freq catalyst (3) - 8 freq rattult (3) - 2 freq caalt (3) - 24 freq cattle (4) - 26 freq tapp't (4) - 1 freq tanglt (4) - 1 freq cahunt (4) - 1 freq caulf (4) - 2 freq catalans (4) - 3 freq clappet (4) - 1 freq stavelt (4) - 1 freq calpol (4) - 1 freq cackelt (4) - 1 freq catcht (4) - 37 freq caal (4) - 98 freq caalm (4) - 1 freq cruppilt (4) - 1 freq caul (4) - 79 freq adapt (4) - 6 freq campt (4) - 2 freq chappit (4) - 45 freq taunt (4) - 2 freq |
catapult (0) - 1 freq caalt (5) - 24 freq cataract (5) - 5 freq rattult (5) - 2 freq compelt (5) - 1 freq catalyst (5) - 8 freq catall (5) - 1 freq cheaply (6) - 2 freq sattilt (6) - 9 freq carpet (6) - 52 freq catchet (6) - 5 freq crumpelt (6) - 2 freq chappet (6) - 2 freq clappit (6) - 46 freq sattlt (6) - 4 freq tumult (6) - 2 freq cheapest (6) - 3 freq output (6) - 2 freq compilit (6) - 1 freq consult (6) - 8 freq toult (6) - 1 freq clappt (6) - 4 freq cathal (6) - 10 freq tappit (6) - 6 freq cancelt (6) - 3 freq |
SoundEx code - C314 cadboll - 1 freq cat-flap - 1 freq catapult - 1 freq catflap - 1 freq |
MetaPhone code - KTPLT catapult - 1 freq |
CATAPULT |
| Time to execute Levenshtein function - 0.221455 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.423855 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.027420 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.038134 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.000971 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. |