Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
cutbacks (0) - 1 freq cumback (2) - 1 freq attacks (3) - 12 freq haudbacks (3) - 1 freq cloacks (3) - 5 freq stacks (3) - 7 freq mudbanks (3) - 2 freq contracks (3) - 4 freq castback (3) - 1 freq chacks (3) - 1 freq tracks (3) - 49 freq cracks (3) - 39 freq humpbacks (3) - 1 freq tacks (3) - 3 freq contacks (3) - 2 freq extracks (3) - 3 freq backs (3) - 93 freq attracks (3) - 1 freq quacks (3) - 1 freq gusbracks (3) - 1 freq cumnocks (3) - 1 freq buttocks (3) - 2 freq husbands (4) - 8 freq cubbart (4) - 1 freq back' (4) - 2 freq |
cutbacks (0) - 1 freq cumback (4) - 1 freq extracks (5) - 3 freq cracks (5) - 39 freq contacks (5) - 2 freq attracks (5) - 1 freq buttocks (5) - 2 freq cumnocks (5) - 1 freq tracks (5) - 49 freq backs (5) - 93 freq tacks (5) - 3 freq chacks (5) - 1 freq haudbacks (5) - 1 freq attacks (5) - 12 freq cloacks (5) - 5 freq stacks (5) - 7 freq contracks (5) - 4 freq castback (5) - 1 freq cupcakes (6) - 1 freq connecks (6) - 3 freq catcaals (6) - 2 freq tucks (6) - 6 freq becks (6) - 8 freq elbucks (6) - 6 freq crocks (6) - 5 freq |
SoundEx code - C312 cattyface - 2 freq cattie-face - 14 freq cutbacks - 1 freq city-fowk - 1 freq cuddy-back - 1 freq cheatie-pussie - 7 freq cattie-faces - 9 freq €˜cattie-faces - 1 freq catfish - 1 freq codification - 3 freq cod-fish - 1 freq catfacebatface - 1 freq cdfky - 1 freq ctypvshdg - 1 freq cdpsdg - 1 freq ctfgdel - 1 freq ctvk - 1 freq |
MetaPhone code - KTBKS cutbacks - 1 freq |
CUTBACKS |
Time to execute Levenshtein function - 0.194991 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.334768 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.027055 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.039585 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.000812 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. |