| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aeisfpcnst (0) - 1 freq leisn't (5) - 1 freq deifficult (5) - 5 freq aginst (5) - 19 freq aristocrat (5) - 1 freq aestlins (5) - 2 freq respons (5) - 1 freq aisment (5) - 1 freq response (5) - 47 freq aveisement (5) - 4 freq aipen't (5) - 1 freq aristocaat (5) - 1 freq alidupont (5) - 1 freq heidfirst (5) - 2 freq aesop's (5) - 4 freq aistlins (5) - 1 freq aisyiest (5) - 1 freq deiffrint (5) - 1 freq aisement (5) - 2 freq misspent (5) - 2 freq meisst (5) - 1 freq aipent (5) - 1 freq aesiest (5) - 1 freq aeasiest (5) - 1 freq leistent (5) - 3 freq |
aeisfpcnst (0) - 1 freq sypins (9) - 2 freq s'past (9) - 1 freq spins (9) - 10 freq ascent (9) - 2 freq fvqnst (9) - 1 freq serpent (9) - 56 freq fiercest (9) - 2 freq s'post (9) - 8 freq spens (9) - 7 freq suppost (9) - 4 freq spint (9) - 24 freq selfconsait (9) - 1 freq feinist (9) - 8 freq auspices (9) - 1 freq pacifist (9) - 1 freq uisfuness (9) - 1 freq seafront (9) - 1 freq efpnta (9) - 1 freq spen't (9) - 1 freq aspecks (9) - 26 freq ferninst (9) - 1 freq sairpent (9) - 3 freq simplest (9) - 6 freq astonist (9) - 5 freq |
SoundEx code - A212 aspeck - 13 freq aspects - 24 freq aspect - 21 freq aesop's - 4 freq aspecks - 26 freq agivey's - 1 freq aesophagus - 1 freq auspices - 1 freq asbestos - 9 freq aissy-faced - 1 freq aesopic - 1 freq achieves - 1 freq acceps - 1 freq accepps - 1 freq aspekts - 1 freq aeyxfjl - 1 freq azbfszi - 1 freq aaxvihswu - 1 freq aeisfpcnst - 1 freq akvx - 1 freq azbffk - 1 freq ajvcnhvhjb - 1 freq aogkibkef - 1 freq akbvsdogc - 1 freq |
MetaPhone code - ESFPKNST aeisfpcnst - 1 freq |
AEISFPCNST |
| Time to execute Levenshtein function - 0.193974 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.382154 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.027940 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.037564 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.000903 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. |