| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aupk (0) - 1 freq aup (1) - 1 freq auk (1) - 1 freq tuck (2) - 26 freq dup (2) - 5 freq hunk (2) - 5 freq punk (2) - 9 freq huk (2) - 1 freq puvk (2) - 1 freq sunk (2) - 26 freq apg (2) - 1 freq turk (2) - 6 freq tuk (2) - 227 freq musk (2) - 4 freq maup (2) - 1 freq ank (2) - 1 freq auga (2) - 1 freq gaup (2) - 4 freq sups (2) - 4 freq apps (2) - 5 freq rukk (2) - 3 freq murk (2) - 3 freq puck (2) - 20 freq alok (2) - 1 freq aik (2) - 55 freq |
aupk (0) - 1 freq aup (2) - 1 freq pk (2) - 4 freq auk (2) - 1 freq pupa (3) - 1 freq cuik (3) - 4 freq yauk (3) - 3 freq oupa (3) - 1 freq uup (3) - 4 freq cauk (3) - 5 freq unk (3) - 1 freq ape (3) - 5 freq pup (3) - 37 freq aap (3) - 26 freq app (3) - 47 freq apa (3) - 2 freq uok (3) - 1 freq afk (3) - 1 freq upx (3) - 1 freq ouk (3) - 16 freq apm (3) - 1 freq quyk (3) - 1 freq alek (3) - 3 freq buik (3) - 399 freq tuik (3) - 313 freq |
SoundEx code - A120 apiece - 9 freq a-piece - 5 freq aback - 41 freq abeich - 6 freq abyss - 11 freq abuse - 45 freq apps - 5 freq aboose - 1 freq apes - 4 freq appease - 8 freq abc - 2 freq abbeys - 3 freq affs - 4 freq a-big - 1 freq abijah - 5 freq avs - 1 freq abak' - 1 freq affeck - 7 freq abc's - 1 freq abase - 1 freq avyse - 4 freq abies - 3 freq afyoag - 1 freq apaece - 3 freq a-paece - 1 freq absie - 1 freq apache - 1 freq abbacee - 1 freq abaak - 1 freq abiech - 3 freq affecks - 6 freq abiz - 1 freq abuise - 3 freq afk - 1 freq affix - 1 freq avise - 1 freq a-back - 1 freq avec - 1 freq abby's - 1 freq abak - 1 freq ah-bay-say - 1 freq ab's - 1 freq apace - 1 freq apees - 1 freq apex - 1 freq abg - 1 freq apvqo - 1 freq afc - 27 freq abz - 17 freq afgg - 1 freq avk - 10 freq aabaq - 2 freq afxq - 1 freq avows - 1 freq abs - 1 freq apg - 1 freq abfas - 1 freq aibagawa - 3 freq apyc - 1 freq aupk - 1 freq |
MetaPhone code - APK apg - 1 freq apyc - 1 freq aupk - 1 freq |
AUPK |
| Time to execute Levenshtein function - 0.209045 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.568671 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.028243 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.070867 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.000840 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. |