| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ecairt-wheels (0) - 1 freq cairt-wheels (1) - 1 freq cart-wheels (2) - 2 freq cairtwheels (2) - 2 freq cartwheels (3) - 1 freq cairtwheel (3) - 1 freq cairtwheeled (4) - 1 freq cartwheel (4) - 1 freq pit-wheel (5) - 1 freq cartwheeled (5) - 1 freq caithess (6) - 1 freq watterwheels (6) - 1 freq cairtel (6) - 1 freq sidewheels (6) - 1 freq cairt-horse (6) - 4 freq cairthorses (6) - 1 freq cairt-hoarse (6) - 1 freq ecisweel (6) - 1 freq watter-wheels (6) - 3 freq cairt-fu's (6) - 1 freq kert-wheelin (6) - 1 freq carmichaels (6) - 1 freq starwheel (6) - 1 freq cairters (6) - 1 freq cairties (6) - 1 freq |
ecairt-wheels (0) - 1 freq cairt-wheels (1) - 1 freq cart-wheels (2) - 2 freq cairtwheels (3) - 2 freq cartwheels (4) - 1 freq cairtwheel (5) - 1 freq cairtwheeled (6) - 1 freq cartwheel (6) - 1 freq cartwheeled (7) - 1 freq cairt-hoarse (8) - 1 freq kert-wheelin (8) - 1 freq cairt-horse (8) - 4 freq pit-wheel (8) - 1 freq cairt-fu's (9) - 1 freq pulley-wheels (9) - 1 freq watter-wheels (9) - 3 freq watterwheels (9) - 1 freq cairt-horses (9) - 3 freq cartowes (9) - 1 freq carmichaels (9) - 1 freq coort-hoose (10) - 1 freq fareweels (10) - 1 freq wirtwhile (10) - 1 freq warthwhile (10) - 1 freq ecairt-cuddy (10) - 1 freq |
SoundEx code - E263 exertin - 1 freq ecairt-wheels - 1 freq ecairrit - 1 freq escort - 3 freq esartshall - 1 freq exertion - 3 freq ecairt-cuddy - 1 freq ecairted - 1 freq exert - 1 freq ekurt - 1 freq exerted - 1 freq escortit - 2 freq ex-scorrie-ation - 1 freq esquierdo - 1 freq exertit - 2 freq ecairriet - 1 freq eco-riots - 2 freq exertions - 2 freq escorts - 1 freq escorted - 1 freq eaccreative - 2 freq |
MetaPhone code - EKRTHLS ecairt-wheels - 1 freq |
ECAIRT-WHEELS |
| Time to execute Levenshtein function - 0.465026 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.821455 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.047717 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.075356 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.000937 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. |