Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
absent (0) - 12 freq aksent (1) - 4 freq assent (1) - 2 freq abeen (2) - 154 freq abet (2) - 1 freq accent (2) - 116 freq abeit (2) - 1 freq abject (2) - 1 freq absentin (2) - 1 freq absentee (2) - 1 freq resent (2) - 3 freq absense (2) - 1 freq ardent (2) - 2 freq ambient (2) - 1 freq sent (2) - 546 freq prsent (2) - 1 freq bent (2) - 104 freq agent (2) - 14 freq abeen't (2) - 1 freq abene (2) - 1 freq aquent (2) - 6 freq assint (2) - 1 freq aisment (2) - 1 freq attent (2) - 1 freq aksents (2) - 1 freq |
absent (0) - 12 freq assent (2) - 2 freq absentee (2) - 1 freq aksent (2) - 4 freq sent (3) - 546 freq absence (3) - 20 freq lisent (3) - 1 freq ibsen (3) - 2 freq assint (3) - 1 freq brent (3) - 17 freq bent (3) - 104 freq absense (3) - 1 freq assynt (3) - 4 freq blent (3) - 6 freq absentin (3) - 1 freq resent (3) - 3 freq blint (4) - 3 freq braisent (4) - 2 freq bount (4) - 1 freq bst (4) - 2 freq bsqt (4) - 1 freq burnt (4) - 90 freq disnt (4) - 1 freq hasnt (4) - 1 freq wasnt (4) - 6 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 - ABSNT absent - 12 freq absentee - 1 freq |
ABSENT |
Time to execute Levenshtein function - 0.249344 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.364731 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.028967 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.040547 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.001147 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. |