| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| sugar (0) - 88 freq sugart (1) - 1 freq sugary (1) - 11 freq 'sugar (1) - 1 freq shugar (1) - 1 freq lugar (1) - 4 freq suger (1) - 1 freq sugars (1) - 2 freq suir (2) - 11 freq swear (2) - 63 freq sugery (2) - 1 freq gar (2) - 162 freq star (2) - 259 freq sonar (2) - 1 freq shar (2) - 6 freq spar (2) - 14 freq smear (2) - 2 freq sagas (2) - 3 freq quhar (2) - 24 freq sgair (2) - 1 freq sagan (2) - 1 freq rugas (2) - 1 freq sudan (2) - 1 freq guga (2) - 1 freq swaar (2) - 1 freq |
sugar (0) - 88 freq suger (1) - 1 freq sugary (1) - 11 freq sugars (2) - 2 freq sgair (2) - 1 freq sugery (2) - 1 freq lugar (2) - 4 freq sugart (2) - 1 freq 'sugar (2) - 1 freq shugar (2) - 1 freq saga (3) - 12 freq hagar (3) - 1 freq soar (3) - 10 freq sugh (3) - 3 freq sumer (3) - 1 freq snaar (3) - 1 freq shoar (3) - 4 freq soutar (3) - 39 freq scar (3) - 16 freq squar (3) - 7 freq yugir (3) - 2 freq cigar (3) - 19 freq augur (3) - 1 freq scaar (3) - 20 freq cougar (3) - 1 freq |
SoundEx code - S260 sugar - 88 freq sugary - 11 freq sikkar - 7 freq saucer - 13 freq sea-shore- - 4 freq succour - 6 freq secure - 22 freq siccar - 289 freq swagger - 14 freq sasser - 11 freq sucker - 3 freq sojer - 23 freq seashore - 3 freq sikker - 1 freq succar - 3 freq sicker - 8 freq soajer - 1 freq sooker - 2 freq six-year - 1 freq shocker - 4 freq sea-shore - 1 freq sexier - 1 freq seeker - 2 freq seizure - 2 freq 'sugar - 1 freq shugar - 1 freq skoosher - 1 freq sicear - 6 freq siecar - 1 freq shuggar - 6 freq swacker - 1 freq shugger - 4 freq seik-sair - 1 freq secrie - 2 freq siccer - 3 freq soccer - 4 freq shuggary - 1 freq seeger - 1 freq seicrie - 2 freq swickery - 1 freq scouser - 2 freq 'sugar' - 1 freq swicker - 1 freq €œsugar - 1 freq squaiker - 5 freq suger - 1 freq shaker - 1 freq sojier - 1 freq sugery - 1 freq shagger - 1 freq scoisr - 1 freq sicher - 1 freq syxqar - 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 |
SUGAR |
| Time to execute Levenshtein function - 0.231668 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.356713 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.029972 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.038825 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.000940 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. |