| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gazpacho (0) - 1 freq apache (3) - 2 freq gazzah (3) - 3 freq golach (4) - 3 freq garadh (4) - 1 freq aach (4) - 1 freq gazmar (4) - 1 freq farrach (4) - 1 freq bizcocho (4) - 1 freq gazza (4) - 3 freq panache (4) - 2 freq jammach (4) - 3 freq cabrach (4) - 24 freq attach (4) - 7 freq gollachs (4) - 3 freq paco (4) - 19 freq gomach (4) - 2 freq sappho (4) - 8 freq laach (4) - 36 freq aaach (4) - 1 freq larach (4) - 1 freq glammach (4) - 3 freq ablach (4) - 3 freq macho (4) - 9 freq goach (4) - 1 freq |
gazpacho (0) - 1 freq gazzah (5) - 3 freq apache (5) - 2 freq corpach (6) - 1 freq goach (6) - 1 freq gronach (6) - 1 freq gaunch (6) - 2 freq mizpah (6) - 2 freq gollach (6) - 4 freq gealtach (6) - 3 freq gomach (6) - 2 freq slipach (6) - 1 freq garioch (6) - 19 freq bizcocho (6) - 1 freq golach (6) - 3 freq gulloch (7) - 4 freq garvyauch (7) - 1 freq gotcha (7) - 2 freq gumpick (7) - 1 freq glunch (7) - 4 freq graph (7) - 4 freq gappan (7) - 1 freq pochi (7) - 1 freq gulsoch (7) - 2 freq apathy (7) - 8 freq |
SoundEx code - G212 gasps - 7 freq guiss-gabs - 1 freq gossip's - 1 freq gossips - 1 freq gazpacho - 1 freq gasbag - 1 freq gijgpxxnhj - 1 freq ghgvaexl - 1 freq gukbzihywd - 1 freq ggijbc - 1 freq |
MetaPhone code - KSPX gazpacho - 1 freq |
GAZPACHO |
| Time to execute Levenshtein function - 0.219346 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.433477 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.033681 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.040820 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.000904 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. |