| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| afghan (0) - 1 freq affhan (1) - 1 freq meghan (2) - 2 freq aegean (2) - 4 freq laaghan (2) - 1 freq aigan (2) - 1 freq sighan (2) - 5 freq affhaun (2) - 1 freq laughan (2) - 4 freq gaughan (2) - 8 freq achan (2) - 2 freq aff-han (2) - 1 freq agglan (2) - 1 freq eoghan (2) - 1 freq flan (3) - 3 freq aught (3) - 4 freq sagan (3) - 1 freq afloat (3) - 12 freq aisan (3) - 1 freq pechan (3) - 2 freq lightan (3) - 3 freq lochan (3) - 26 freq annan (3) - 4 freq augher (3) - 1 freq €œthan (3) - 3 freq |
afghan (0) - 1 freq affhan (2) - 1 freq gaughan (3) - 8 freq laughan (3) - 4 freq eoghan (3) - 1 freq sighan (3) - 5 freq affhaun (3) - 1 freq meghan (3) - 2 freq laaghan (3) - 1 freq peghin (4) - 1 freq soghin (4) - 1 freq foghar (4) - 1 freq aforehan (4) - 3 freq fishan (4) - 1 freq weyghan (4) - 1 freq fashan (4) - 2 freq heughan (4) - 1 freq meighan (4) - 11 freq faggan (4) - 1 freq laughin (4) - 149 freq feehan (4) - 1 freq ghana (4) - 1 freq fechan (4) - 1 freq fightan (4) - 3 freq achan (4) - 2 freq |
SoundEx code - A125 absence - 20 freq affcome - 44 freq absent-mindit - 1 freq aff-chance - 1 freq abusin - 4 freq absenters - 1 freq absent - 12 freq absentin - 1 freq ayafuckinbasturt - 1 freq a-pechin - 1 freq afghanistan - 4 freq absconded - 1 freq aficionado - 1 freq a-fuckin-head - 1 freq affcums - 2 freq affcum - 3 freq aveisement - 4 freq avysins - 1 freq affgang - 1 freq avizandum - 1 freq aipsan - 1 freq affgaun - 1 freq affcomes - 3 freq aff-centre - 1 freq afghan - 1 freq absentee - 1 freq affgaeng - 1 freq a-beggin - 2 freq abusing - 1 freq absently-mindedly - 1 freq abscondit - 1 freq €œabsence - 1 freq aficionados - 1 freq afchymnsheet - 1 freq ahfqim - 1 freq afcmaybury - 2 freq afcminers - 3 freq afcsandys - 2 freq absense - 1 freq absenses - 1 freq |
MetaPhone code - AFFN afghan - 1 freq affafine - 1 freq |
AFGHAN |
| Time to execute Levenshtein function - 0.406801 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.697249 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.076924 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.089831 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.000929 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. |