| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cabinet (0) - 26 freq cabinets (1) - 3 freq caibinet (1) - 2 freq cabin (2) - 20 freq caint (2) - 3 freq cainnt (2) - 1 freq cain't (2) - 1 freq sabine (2) - 3 freq cabaret (2) - 2 freq clarinet (2) - 3 freq caine (2) - 1 freq cabins (2) - 2 freq caibinets (2) - 1 freq canine (2) - 3 freq cairnet (2) - 1 freq chainey (3) - 1 freq gainit (3) - 2 freq abinn (3) - 5 freq karine (3) - 2 freq coined (3) - 3 freq maxine (3) - 1 freq caiort (3) - 1 freq caaing (3) - 1 freq ainst (3) - 2 freq abiine (3) - 3 freq |
cabinet (0) - 26 freq caibinet (1) - 2 freq cabinets (2) - 3 freq cabaret (3) - 2 freq cairnet (3) - 1 freq caibinets (3) - 1 freq cabins (3) - 2 freq caint (3) - 3 freq cainnt (3) - 1 freq cabin (3) - 20 freq baint (4) - 1 freq cant (4) - 40 freq cairnt (4) - 1 freq croint (4) - 5 freq cannit (4) - 1 freq cahunt (4) - 1 freq chyint (4) - 1 freq clint (4) - 4 freq bayonet (4) - 6 freq cabons (4) - 1 freq cornet (4) - 4 freq bint (4) - 10 freq caibin (4) - 5 freq coronet (4) - 1 freq cannot (4) - 19 freq |
SoundEx code - C153 cabinet - 26 freq caibinet - 2 freq chippendale - 2 freq caibinets - 1 freq cabinets - 3 freq caibinet-vricht' - 1 freq caibinet-vricht - 2 freq caibinetmakers - 1 freq coventry - 4 freq copy-and-paste - 1 freq coventicle - 1 freq cofounder - 1 freq |
MetaPhone code - KBNT cabinet - 26 freq caibinet - 2 freq |
CABINET |
| Time to execute Levenshtein function - 0.198251 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.334216 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.027653 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.037750 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.000813 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. |