| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ayqv (0) - 1 freq ayq (1) - 1 freq ayz (2) - 1 freq awfv (2) - 1 freq qv (2) - 3 freq ayxz (2) - 1 freq anq (2) - 2 freq hqv (2) - 1 freq xyqb (2) - 1 freq ygv (2) - 1 freq lyq (2) - 1 freq ayee (2) - 8 freq iybv (2) - 2 freq ayel (2) - 2 freq ayar (2) - 1 freq av (2) - 1 freq ayl (2) - 1 freq yq (2) - 1 freq tyqq (2) - 1 freq ay' (2) - 4 freq yqq (2) - 1 freq ixqv (2) - 1 freq aye (2) - 6435 freq yev (2) - 7 freq aye' (2) - 1 freq |
ayqv (0) - 1 freq qv (2) - 3 freq ayq (2) - 1 freq agv (3) - 1 freq auqi (3) - 1 freq a'v (3) - 48 freq aov (3) - 1 freq yqg (3) - 1 freq yev (3) - 7 freq hyv (3) - 1 freq yav (3) - 1 freq ywv (3) - 1 freq yv (3) - 1 freq qvi (3) - 1 freq aqp (3) - 1 freq yuv (3) - 15 freq azv (3) - 1 freq acuv (3) - 1 freq atv (3) - 1 freq auv (3) - 2 freq aqs (3) - 1 freq ixqv (3) - 1 freq ahv (3) - 7 freq ygv (3) - 1 freq eqvy (3) - 1 freq |
SoundEx code - A210 agape - 2 freq aesop - 8 freq achieve - 35 freq aseef - 1 freq accep - 12 freq asbo - 1 freq agivey - 2 freq asap - 10 freq accepp - 3 freq ashby - 1 freq ausbau - 1 freq acuv - 1 freq aygxb - 1 freq agv - 1 freq agjjp - 1 freq aqp - 1 freq askjeff - 1 freq agp - 1 freq azv - 1 freq ayqv - 1 freq auxzv - 1 freq |
MetaPhone code - AKF acuv - 1 freq agv - 1 freq ayqv - 1 freq |
AYQV |
| Time to execute Levenshtein function - 0.194514 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.331957 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.027908 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.038130 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.000912 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. |