| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gaining (0) - 2 freq caining (1) - 1 freq raining (1) - 5 freq haining (1) - 6 freq gainin (1) - 11 freq dawning (2) - 1 freq 'wining (2) - 1 freq gazing (2) - 6 freq gasping (2) - 2 freq lairning (2) - 4 freq sainin (2) - 4 freq coining (2) - 4 freq nailing (2) - 3 freq mining (2) - 5 freq gurning (2) - 2 freq airing (2) - 1 freq banning (2) - 2 freq hainins (2) - 1 freq ruining (2) - 3 freq training (2) - 17 freq girning (2) - 1 freq giving (2) - 26 freq joining (2) - 10 freq gainan (2) - 1 freq ainin (2) - 1 freq |
gaining (0) - 2 freq gainin (2) - 11 freq haining (2) - 6 freq caining (2) - 1 freq raining (2) - 5 freq ganging (3) - 3 freq ginin (3) - 1 freq gaming (3) - 3 freq giving (3) - 26 freq guiding (3) - 1 freq joining (3) - 10 freq gainan (3) - 1 freq gaanin (3) - 3 freq yawning (3) - 1 freq dining (3) - 6 freq lining (3) - 1 freq girning (3) - 1 freq waning (3) - 1 freq pining (3) - 1 freq yarning (3) - 1 freq vining (3) - 17 freq mining (3) - 5 freq gurning (3) - 2 freq gazing (3) - 6 freq ruining (3) - 3 freq |
SoundEx code - G552 ginungagap - 4 freq gnomes - 2 freq gaming - 3 freq genomes - 1 freq g-nomes - 2 freq gnawing - 1 freq gaining - 2 freq genuinescotland - 2 freq gaminginmyjammies - 1 freq |
MetaPhone code - KNNK kenning - 10 freq coining - 4 freq cunning - 1 freq gaining - 2 freq kounoungou - 1 freq caining - 1 freq |
GAINING |
| Time to execute Levenshtein function - 0.236445 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.401469 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.030290 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.040659 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.004443 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. |