| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aisy-gaun (0) - 1 freq easy-gaun (2) - 2 freq by-gaun (3) - 1 freq ayegaun (3) - 1 freq aye-gaun (3) - 1 freq dailygaun (3) - 20 freq awaw-gaun (3) - 1 freq bygaun (4) - 7 freq affgaun (4) - 1 freq misgaen (4) - 1 freq wa-gaun (4) - 1 freq ingaun (4) - 3 freq hame-gaun (4) - 5 freq aye-gauin (4) - 1 freq ahint-haun (4) - 1 freq aigan (4) - 1 freq six-gun (4) - 1 freq easy-goin (4) - 1 freq g-g-gaun (4) - 1 freq aisy-osie (4) - 1 freq on-gaun (4) - 1 freq bye-gaun (4) - 1 freq aiyun (4) - 1 freq aisan (4) - 1 freq ahin-haun (4) - 1 freq |
aisy-gaun (0) - 1 freq easy-gaun (2) - 2 freq easy-goin (4) - 1 freq aye-gaun (4) - 1 freq by-gaun (4) - 1 freq aye-gauin (5) - 1 freq six-gun (5) - 1 freq wa-gaun (5) - 1 freq on-gaun (5) - 1 freq bye-gaun (5) - 1 freq awaw-gaun (5) - 1 freq dailygaun (5) - 20 freq ayegaun (5) - 1 freq also-ran (6) - 1 freq guid-gaun (6) - 3 freq misgaen (6) - 1 freq weygaun (6) - 1 freq on-gaan (6) - 1 freq by-gane (6) - 3 freq seggan (6) - 2 freq slogan (6) - 10 freq wa-gaan (6) - 1 freq a-goin (6) - 1 freq sagan (6) - 1 freq dailygan (6) - 9 freq |
SoundEx code - A225 accusin - 7 freq aisy-gaun - 1 freq assignations - 1 freq assessin - 4 freq ashkenazi - 1 freq assignment - 3 freq assigned - 6 freq accusing - 3 freq assessment - 23 freq assassination - 6 freq accessin - 5 freq assessments - 4 freq assignit - 1 freq assessin' - 1 freq accessin' - 1 freq assassins - 2 freq a-seekin - 1 freq assassinatit - 1 freq accusingly - 1 freq assassin - 2 freq assassinations - 2 freq accusinly - 1 freq acquiescence - 2 freq assassinate - 1 freq acasayanymare - 1 freq ashashoneill - 1 freq assasinate - 1 freq |
MetaPhone code - ASKN askin - 183 freq aisy-gaun - 1 freq asken - 4 freq askin' - 5 freq askan - 10 freq a-seekin - 1 freq |
AISY-GAUN |
| Time to execute Levenshtein function - 0.193263 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.393246 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.031029 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.038033 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.000848 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. |