Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
citizenveurm (0) - 1 freq citizen' (5) - 1 freq citizentommy (5) - 1 freq citizens (5) - 28 freq citizen (5) - 10 freq citizenship (5) - 9 freq fitiver (6) - 65 freq fitever (6) - 14 freq pittenweem (6) - 12 freq citizenstheatre (6) - 1 freq fitivver (6) - 31 freq stiever (6) - 1 freq cantilever (6) - 1 freq ceitizens (6) - 2 freq witever (6) - 2 freq witherer (7) - 2 freq convert (7) - 12 freq condenser (7) - 1 freq cinners (7) - 4 freq millenium (7) - 3 freq citroen (7) - 2 freq mutineer (7) - 1 freq dissenters (7) - 2 freq centaurs (7) - 2 freq caiver (7) - 1 freq |
citizenveurm (0) - 1 freq citizentommy (7) - 1 freq citizenship (8) - 9 freq citizen (8) - 10 freq citizens (8) - 28 freq citizen' (8) - 1 freq ceitizens (9) - 2 freq cairngorm (10) - 6 freq ceetizens (10) - 6 freq fitever (10) - 14 freq ceetizen (10) - 1 freq ceitizans (10) - 1 freq cautioner (10) - 1 freq fitiver (10) - 65 freq convers (10) - 1 freq convert (10) - 12 freq wytin-ruim (10) - 1 freq fitivver (10) - 31 freq sitteen-room (10) - 2 freq pittenweem (10) - 12 freq cantilever (10) - 1 freq stiever (10) - 1 freq ceetizenship (10) - 1 freq witever (10) - 2 freq convener (11) - 18 freq |
SoundEx code - C325 catchin - 52 freq citizens - 28 freq cawd-cannie - 1 freq catchment - 3 freq cadgin - 2 freq catchen - 2 freq catching - 8 freq catchin' - 2 freq chuddy-chaaen - 1 freq citizen' - 1 freq citizen - 10 freq catchan - 12 freq catchments - 1 freq catacombs - 2 freq cathkin - 7 freq ceitizans - 1 freq ceitizens - 2 freq cøttikin - 1 freq ceetizenship - 1 freq citizenship - 9 freq €œcitizens - 8 freq ceitezans - 4 freq ceitezan - 2 freq ceetizen - 1 freq ceetizens - 6 freq cÃtizen - 1 freq cow-the-gowan - 1 freq cdgm - 1 freq ctogngxyyo - 1 freq citizenveurm - 1 freq citizenstheatre - 1 freq citizentommy - 1 freq cwdsnmo - 1 freq ctznmgyp - 1 freq |
MetaPhone code - STSNFRM citizenveurm - 1 freq |
CITIZENVEURM |
Time to execute Levenshtein function - 0.500441 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.677887 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.027762 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.067630 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.000791 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. |