| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gagarin (0) - 2 freq gaarin (1) - 1 freq gearin (2) - 2 freq gawain (2) - 1 freq gaggin (2) - 7 freq daarin (2) - 1 freq glarin (2) - 7 freq gadarine (2) - 1 freq gaanin (2) - 3 freq again (2) - 2708 freq gaain (2) - 2 freq garrin (2) - 35 freq gaapin (2) - 1 freq saggin (3) - 3 freq baain (3) - 2 freq garrins (3) - 1 freq glaurin (3) - 1 freq taperin (3) - 1 freq bygaein (3) - 1 freq €™again (3) - 2 freq caain (3) - 50 freq gramarie (3) - 1 freq gleerin (3) - 1 freq layerin (3) - 1 freq bargain (3) - 33 freq |
gagarin (0) - 2 freq gaarin (2) - 1 freq gadarine (3) - 1 freq garrin (3) - 35 freq glarin (3) - 7 freq gearin (3) - 2 freq gaggin (3) - 7 freq glaigerin (4) - 1 freq gleerin (4) - 1 freq agrun (4) - 1 freq ragoran (4) - 6 freq gurrin (4) - 1 freq glaran (4) - 2 freq grin (4) - 137 freq giggin (4) - 2 freq gaaderin (4) - 1 freq glourin (4) - 1 freq gowerin (4) - 1 freq grain (4) - 78 freq again (4) - 2708 freq gaanin (4) - 3 freq daarin (4) - 1 freq gawain (4) - 1 freq gaain (4) - 2 freq gaapin (4) - 1 freq |
SoundEx code - G265 gizzernt - 1 freq gagarin - 2 freq gas-iron - 1 freq gesserant - 1 freq €˜gesserant - 1 freq gizzerns - 1 freq gizzern - 1 freq |
MetaPhone code - KKRN gagarin - 2 freq kiggerin - 1 freq |
GAGARIN |
| Time to execute Levenshtein function - 0.285664 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.554611 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.028400 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.037570 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.000851 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. |