| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| caibinet-vricht (0) - 2 freq casbinet-vricht (1) - 1 freq caibinet-vricht' (1) - 1 freq carbinet-vricht (1) - 3 freq catbinet-vricht (1) - 1 freq copiericht (7) - 20 freq caibinets (7) - 1 freq cawnle-licht (7) - 1 freq caibinet (7) - 2 freq caibinetmakers (7) - 1 freq coapiericht (7) - 4 freq man-vrocht (7) - 2 freq blindin-bricht (7) - 2 freq birthricht (7) - 4 freq bane-ticht (7) - 1 freq fait-wrocht (7) - 1 freq centre-richt (7) - 1 freq online-price (8) - 1 freq awericht (8) - 2 freq super-bricht (8) - 2 freq caunlelicht (8) - 2 freq in-flicht (8) - 1 freq cairt-trink (8) - 1 freq callanetics (8) - 2 freq man-wrocht (8) - 3 freq |
caibinet-vricht (0) - 2 freq casbinet-vricht (2) - 1 freq carbinet-vricht (2) - 3 freq catbinet-vricht (2) - 1 freq caibinet-vricht' (2) - 1 freq man-vrocht (10) - 2 freq centre-richt (10) - 1 freq fait-wrocht (11) - 1 freq bane-ticht (11) - 1 freq birthricht (11) - 4 freq cawnle-licht (11) - 1 freq man-wrocht (12) - 3 freq twinty-aicht (12) - 2 freq saint-vincent (12) - 1 freq stane-wrocht (12) - 1 freq ninety-echt (12) - 3 freq haund-wrocht (12) - 1 freq freest-bricht (12) - 3 freq oot-richt (12) - 2 freq whun-bricht (12) - 1 freq hecht-richt (12) - 1 freq caibinetmakers (12) - 1 freq copiericht (12) - 20 freq blindin-bricht (12) - 2 freq coapiericht (12) - 4 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 - KBNTFRXT caibinet-vricht' - 1 freq caibinet-vricht - 2 freq |
CAIBINET-VRICHT |
| Time to execute Levenshtein function - 0.234971 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.425982 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.028190 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.037111 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.000924 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. |