| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gantries (0) - 1 freq gantrees (1) - 1 freq gantrie (1) - 1 freq kintries (2) - 4 freq wastries (2) - 1 freq gentrie (2) - 5 freq pastries (2) - 1 freq sentries (2) - 3 freq gansies (2) - 3 freq gantry's (2) - 1 freq ganzies (2) - 4 freq agentries (2) - 3 freq banties (2) - 1 freq panties (2) - 2 freq entries (2) - 34 freq intries (2) - 1 freq cantrips (2) - 23 freq gamies (3) - 11 freq victries (3) - 1 freq gingies (3) - 1 freq fantises (3) - 1 freq entrie (3) - 5 freq mamories (3) - 1 freq rantins (3) - 2 freq galeries' (3) - 1 freq |
gantries (0) - 1 freq gantrees (1) - 1 freq agentries (2) - 3 freq gantrie (2) - 1 freq intries (3) - 1 freq gantry's (3) - 1 freq sentries (3) - 3 freq kintries (3) - 4 freq entries (3) - 34 freq gentrie (3) - 5 freq gastrous (4) - 3 freq gentiles (4) - 6 freq gants (4) - 1 freq agentrie (4) - 3 freq kintraes (4) - 8 freq gantry (4) - 6 freq antares (4) - 1 freq countries (4) - 34 freq genres (4) - 13 freq gentis (4) - 1 freq centeries (4) - 1 freq gentles (4) - 1 freq centuries (4) - 81 freq banties (4) - 1 freq panties (4) - 2 freq |
SoundEx code - G536 gantries - 1 freq gentry - 15 freq gantry - 6 freq gentrie - 5 freq gantrie - 1 freq gander - 12 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 - 34 freq kintrae's - 2 freq canters - 1 freq kintras - 57 freq country's - 11 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.215133 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.359677 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.035025 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.038528 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.000855 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. |