| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gantries (0) - 1 freq gantrees (1) - 1 freq gantrie (1) - 1 freq gansies (2) - 3 freq entries (2) - 35 freq sentries (2) - 3 freq panties (2) - 2 freq kintries (2) - 4 freq banties (2) - 1 freq gentrie (2) - 5 freq gantry's (2) - 1 freq intries (2) - 1 freq wastries (2) - 1 freq pastries (2) - 1 freq ganzies (2) - 4 freq wattries (2) - 2 freq cantrips (2) - 23 freq agentries (2) - 3 freq buttries (3) - 3 freq gantle (3) - 1 freq varies (3) - 2 freq dafties (3) - 17 freq taaties (3) - 1 freq pansies (3) - 4 freq aantie (3) - 2 freq |
gantries (0) - 1 freq gantrees (1) - 1 freq agentries (2) - 3 freq gantrie (2) - 1 freq gentrie (3) - 5 freq kintries (3) - 4 freq intries (3) - 1 freq gantry's (3) - 1 freq entries (3) - 35 freq sentries (3) - 3 freq gentles (4) - 1 freq centeries (4) - 1 freq agentrie (4) - 3 freq gants (4) - 1 freq gantry (4) - 6 freq centuries (4) - 83 freq gentis (4) - 1 freq genres (4) - 13 freq antares (4) - 1 freq kintraes (4) - 8 freq centres (4) - 38 freq gastrous (4) - 3 freq countries (4) - 36 freq pastries (4) - 1 freq wastries (4) - 1 freq |
SoundEx code - G536 gantries - 1 freq gentry - 15 freq gantry - 6 freq gander - 14 freq gentrie - 5 freq gantrie - 1 freq geometry - 5 freq gender-tension - 1 freq gunderman - 1 freq gintry - 1 freq gentrie-lik - 1 freq gender - 19 freq gantrees - 1 freq gentrice - 1 freq gantry's - 1 freq gentrifeed - 1 freq €˜gender - 1 freq genderstereotyped - 1 freq gumtree - 1 freq gender-pish - 1 freq |
MetaPhone code - KNTRS gantries - 1 freq countries - 36 freq kintrae's - 2 freq canters - 1 freq kintras - 57 freq country's - 12 freq kintra's - 11 freq kintraes - 8 freq contours - 4 freq cuntras - 4 freq kintries - 4 freq kintrie's - 1 freq conters - 1 freq gantrees - 1 freq gantry's - 1 freq coonters - 1 freq countryÂ’s - 1 freq |
GANTRIES |
| Time to execute Levenshtein function - 0.207589 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.433730 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.040492 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.044177 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.000952 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. |