| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| absence (0) - 20 freq absense (1) - 1 freq €œabsence (2) - 1 freq abene (2) - 1 freq essence (2) - 12 freq absenses (2) - 1 freq absent (2) - 12 freq absentee (2) - 1 freq aence (2) - 8 freq ambience (2) - 4 freq sence (2) - 1 freq fawrence (3) - 1 freq presence (3) - 69 freq pence (3) - 64 freq aadience (3) - 5 freq bonce (3) - 1 freq abiech (3) - 3 freq benche (3) - 1 freq anoonce (3) - 1 freq hence (3) - 33 freq cence (3) - 3 freq athene (3) - 1 freq audience (3) - 94 freq 'seence (3) - 1 freq terence (3) - 1 freq |
absence (0) - 20 freq absense (2) - 1 freq absent (3) - 12 freq sence (3) - 1 freq absentee (3) - 1 freq essence (3) - 12 freq daesency (4) - 1 freq boonce (4) - 61 freq 'seence (4) - 1 freq bounce (4) - 23 freq since (4) - 575 freq blance (4) - 2 freq ibsen (4) - 2 freq 'since (4) - 1 freq seance (4) - 2 freq abeyance (4) - 1 freq arsenic (4) - 1 freq absenses (4) - 1 freq bonce (4) - 1 freq €œabsence (4) - 1 freq ambience (4) - 4 freq abene (4) - 1 freq aence (4) - 8 freq beenge (5) - 1 freq observe (5) - 14 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 - ABSNS absence - 20 freq €œabsence - 1 freq absense - 1 freq |
ABSENCE |
| Time to execute Levenshtein function - 0.182173 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.369449 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.027860 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.039127 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.000891 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. |