| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| castback (0) - 1 freq cashback (1) - 1 freq eastbank (2) - 1 freq cumback (3) - 1 freq cast-aff (3) - 2 freq abstrack (3) - 4 freq castrati (3) - 1 freq mastrick (3) - 3 freq catwalk (3) - 1 freq capstick (3) - 1 freq atrack (3) - 1 freq contack (3) - 37 freq castan (3) - 1 freq cutbacks (3) - 1 freq haystack (3) - 2 freq camtacs (3) - 6 freq cossack (3) - 8 freq andback (3) - 1 freq attrack (3) - 4 freq a-back (3) - 1 freq faw-back (3) - 2 freq stack (3) - 50 freq aback (3) - 41 freq laidback (3) - 1 freq payback (3) - 1 freq |
castback (0) - 1 freq cashback (2) - 1 freq coontback (4) - 1 freq eastbank (4) - 1 freq strack (5) - 9 freq haystack (5) - 2 freq cossack (5) - 8 freq stack (5) - 50 freq comeback (5) - 7 freq cutbacks (5) - 1 freq cantick (5) - 1 freq contrack (5) - 3 freq contack (5) - 37 freq mastrick (5) - 3 freq abstrack (5) - 4 freq cumback (5) - 1 freq capstick (5) - 1 freq castocks (5) - 1 freq cattrick (5) - 1 freq instinck (6) - 2 freq cheerback (6) - 1 freq biteback (6) - 1 freq cystic (6) - 1 freq sate-back (6) - 1 freq 'stick (6) - 4 freq |
SoundEx code - C231 cast-aff - 2 freq chastifyin - 1 freq cost-free - 1 freq castback - 1 freq causative - 1 freq cheesedoff - 1 freq |
MetaPhone code - KSTBK castback - 1 freq |
CASTBACK |
| Time to execute Levenshtein function - 0.236155 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.417705 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.027516 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.069818 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.000865 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. |