| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| giants (0) - 19 freq giant (1) - 85 freq giant's (1) - 5 freq gants (1) - 1 freq grants (1) - 30 freq plants (2) - 73 freq jints (2) - 3 freq tints (2) - 3 freq gvangs (2) - 1 freq grant (2) - 101 freq giantess (2) - 2 freq grands (2) - 1 freq grafts (2) - 3 freq gran's (2) - 13 freq gyangs (2) - 8 freq wints (2) - 49 freq rants (2) - 6 freq glands (2) - 2 freq hants (2) - 1 freq ian's (2) - 3 freq gyands (2) - 1 freq scants (2) - 1 freq dints (2) - 2 freq gien's (2) - 1 freq bants (2) - 5 freq |
giants (0) - 19 freq gants (1) - 1 freq gents (2) - 8 freq gaunts (2) - 1 freq grants (2) - 30 freq giant (2) - 85 freq giant's (2) - 5 freq pints (3) - 80 freq gifts (3) - 33 freq grats (3) - 1 freq ginos (3) - 1 freq guans (3) - 1 freq agitants (3) - 1 freq gits (3) - 102 freq glents (3) - 6 freq mints (3) - 41 freq gasts (3) - 1 freq geats (3) - 1 freq gaets (3) - 4 freq cants (3) - 1 freq gangs (3) - 150 freq sants (3) - 1 freq goats (3) - 17 freq grunts (3) - 5 freq gentis (3) - 1 freq |
SoundEx code - G532 gun-dogs - 1 freq gents - 8 freq giants - 19 freq gants - 1 freq 'gin't's - 1 freq gents' - 1 freq gundies - 1 freq gem-ticht - 3 freq gannets - 2 freq giant's - 5 freq giantess - 2 freq genetics - 4 freq genetic - 12 freq gyands - 1 freq gaunts - 1 freq genetic-modifaction - 1 freq gentis - 1 freq gnat's - 1 freq giant-killer - 1 freq gundge - 1 freq gundcdsr - 1 freq goantheginger - 1 freq gmdx - 1 freq gmtz - 1 freq gummidge - 2 freq genetically - 1 freq |
MetaPhone code - JNTS gents - 8 freq giants - 19 freq joints - 22 freq jynts - 13 freq 'gin't's - 1 freq gents' - 1 freq jennet's - 8 freq janet's - 3 freq giant's - 5 freq giantess - 2 freq jaunts - 2 freq jaundice - 3 freq jyntes - 1 freq gentis - 1 freq jandies - 1 freq jints - 3 freq |
GIANTS |
| Time to execute Levenshtein function - 0.269649 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.420827 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.041752 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.040894 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.000907 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. |