| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eco-riots (0) - 2 freq scotriots (2) - 7 freq chariots (3) - 1 freq cheriots (3) - 2 freq scrious (4) - 1 freq courit (4) - 7 freq chairiots (4) - 1 freq copious (4) - 2 freq coits (4) - 1 freq eco-trow (4) - 1 freq corrects (4) - 1 freq decorous (4) - 2 freq comfirts (4) - 1 freq couriet (4) - 1 freq patriots (4) - 2 freq courts (4) - 14 freq chariot (4) - 4 freq coories (4) - 5 freq convicts (4) - 1 freq consists (4) - 11 freq cooriet (4) - 8 freq scourit (4) - 2 freq florists (4) - 1 freq scorpions (4) - 3 freq economists (4) - 1 freq |
eco-riots (0) - 2 freq chariots (4) - 1 freq cheriots (4) - 2 freq scotriots (4) - 7 freq courts (5) - 14 freq cairrots (5) - 7 freq carrots (5) - 33 freq crits (5) - 1 freq chairiots (5) - 1 freq currots (5) - 1 freq coorts (5) - 9 freq cheviots (6) - 1 freq cheriot (6) - 2 freq commits (6) - 7 freq co-ops (6) - 1 freq coorit (6) - 2 freq comfits (6) - 6 freq curios (6) - 1 freq forrits (6) - 17 freq corries (6) - 15 freq clarts (6) - 2 freq cairts (6) - 34 freq coverts (6) - 1 freq chairts (6) - 8 freq coots (6) - 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 - EKRTS eco-riots - 2 freq |
ECO-RIOTS |
| Time to execute Levenshtein function - 0.205033 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.402694 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.033615 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.040799 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.000942 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. |