Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
cigar (0) - 19 freq cigars (1) - 5 freq iar (2) - 2 freq char (2) - 2 freq cfar (2) - 1 freq 'ciar (2) - 1 freq hagar (2) - 1 freq cesar (2) - 2 freq tiger (2) - 27 freq vicar (2) - 1 freq cupar (2) - 5 freq edgar (2) - 10 freq cigale (2) - 1 freq gigas (2) - 1 freq liar (2) - 24 freq coar (2) - 3 freq liga' (2) - 1 freq rigor (2) - 1 freq figur (2) - 2 freq igor (2) - 6 freq cia (2) - 3 freq einar (2) - 27 freq wigan (2) - 1 freq cider (2) - 38 freq cedar (2) - 4 freq |
cigar (0) - 19 freq cigars (2) - 5 freq ceegar (2) - 1 freq cougar (2) - 1 freq figir (3) - 11 freq car (3) - 413 freq cedar (3) - 4 freq igor (3) - 6 freq cider (3) - 38 freq niger (3) - 1 freq caar (3) - 1 freq clear (3) - 492 freq cigs (3) - 1 freq aiger (3) - 2 freq lugar (3) - 4 freq figur (3) - 2 freq gar (3) - 162 freq sugar (3) - 88 freq cig (3) - 1 freq tiger (3) - 27 freq cupar (3) - 5 freq edgar (3) - 10 freq rigor (3) - 1 freq hagar (3) - 1 freq char (3) - 2 freq |
SoundEx code - C260 cooker - 21 freq couser - 2 freq cigar - 19 freq cheshire - 10 freq choisir - 1 freq cocker - 1 freq choaker - 7 freq chaser - 9 freq cesare - 1 freq cooser - 3 freq cashier - 1 freq cesar - 2 freq chowker - 7 freq cheugher - 1 freq cookery - 4 freq caesar - 17 freq caesarea - 1 freq checker - 5 freq choocher - 1 freq choker - 1 freq cicero - 1 freq caesura - 2 freq 'chaser' - 4 freq chaucer - 4 freq ceegar - 1 freq €˜ceegar - 1 freq cuikery - 1 freq co-cairry - 1 freq cougar - 1 freq chakra - 1 freq cowzer - 1 freq chekker - 1 freq |
MetaPhone code - SKR sugar - 88 freq square - 164 freq sgair - 1 freq sugary - 11 freq skyrie - 30 freq sikkar - 7 freq screw - 24 freq skyre - 6 freq skaur - 1 freq scry - 4 freq secure - 22 freq score - 94 freq scourie - 2 freq scare - 20 freq cigar - 19 freq scary - 55 freq skeer - 2 freq scoor - 12 freq sucker - 3 freq sikker - 1 freq skare - 4 freq squere - 1 freq scaur - 14 freq scurrie - 3 freq sicker - 8 freq scair - 2 freq scairry - 1 freq scoorie - 3 freq skour - 3 freq scar - 16 freq sooker - 2 freq skroo - 14 freq squarie - 1 freq skara - 4 freq squire - 2 freq skera - 1 freq skier - 2 freq seeker - 2 freq scrae - 1 freq 'square - 1 freq 'sugar - 1 freq scur - 1 freq squaarie - 2 freq score' - 1 freq siecar - 1 freq scaar - 20 freq skerry - 7 freq scrow - 2 freq squar - 7 freq skeerie - 6 freq skrow - 1 freq secrie - 2 freq skair - 8 freq skarr - 2 freq scurry - 3 freq skoor - 1 freq scree - 7 freq scroo - 2 freq scorrie - 1 freq scarey - 2 freq scour - 4 freq squerr - 2 freq skirr - 1 freq scarrae - 1 freq skurrie - 1 freq seicrie - 2 freq ceegar - 1 freq €˜ceegar - 1 freq €˜square- - 1 freq skrie - 1 freq zucker - 1 freq scurra - 1 freq 'sugar' - 1 freq squarr - 1 freq sker - 1 freq €œsugar - 1 freq xcureiw - 1 freq skurry - 1 freq skeery - 1 freq sqr - 1 freq sgurr - 1 freq skaar - 1 freq scorie - 1 freq |
CIGAR |
Time to execute Levenshtein function - 0.375559 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.731997 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.061405 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.044350 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.001228 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. |