Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
yikes (0) - 4 freq hikes (1) - 1 freq yokes (1) - 3 freq pikes (1) - 8 freq tikes (1) - 1 freq bikes (1) - 31 freq likes (1) - 524 freq dikes (1) - 3 freq yies (1) - 21 freq bines (2) - 1 freq rakes (2) - 6 freq yis (2) - 275 freq himes (2) - 4 freq liket (2) - 4 freq yes (2) - 252 freq mimes (2) - 3 freq kites (2) - 6 freq wiken (2) - 1 freq yiss (2) - 22 freq piles (2) - 26 freq aiges (2) - 3 freq laikes (2) - 1 freq yken (2) - 1 freq ikea (2) - 8 freq bakes (2) - 17 freq |
yikes (0) - 4 freq yokes (1) - 3 freq eiks (2) - 10 freq kes (2) - 1 freq yakies (2) - 1 freq yaks (2) - 4 freq yies (2) - 21 freq kies (2) - 1 freq aiks (2) - 3 freq likes (2) - 524 freq pikes (2) - 8 freq tikes (2) - 1 freq bikes (2) - 31 freq dikes (2) - 3 freq hikes (2) - 1 freq kakes (3) - 1 freq uises (3) - 36 freq liks (3) - 7 freq lykes (3) - 4 freq aixes (3) - 4 freq dokes (3) - 3 freq aises (3) - 1 freq uizes (3) - 7 freq iles (3) - 3 freq yeken (3) - 1 freq |
SoundEx code - Y220 yaises - 18 freq yogic - 4 freq yokes - 3 freq €œyikes - 1 freq yisses - 2 freq yakies - 1 freq yogis - 1 freq yaisage - 4 freq yzhgx - 1 freq yicaq - 1 freq yikes - 4 freq yjeizaoa - 1 freq yhxizx - 1 freq yzek - 2 freq |
MetaPhone code - YKS yokks - 2 freq yokes - 3 freq yucks - 1 freq €œyikes - 1 freq yaks - 4 freq yakies - 1 freq yexy - 1 freq yikes - 4 freq yoxy - 1 freq |
YIKES |
Time to execute Levenshtein function - 0.200433 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.332535 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.029985 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.041666 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.001011 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. |