| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aiverie-like (0) - 4 freq arverie-like (1) - 1 freq fierce-like (3) - 1 freq eerie-like (3) - 2 freq diarie-like (3) - 1 freq awfie-like (4) - 1 freq angert-like (4) - 1 freq taivert-lke (4) - 1 freq dillie-like (4) - 2 freq skeelie-like (4) - 2 freq mirrie-lik (4) - 1 freq ferlie-like (4) - 1 freq lairdie-like (4) - 1 freq biker-like (4) - 1 freq aiverel (5) - 1 freq couthie-like (5) - 2 freq sweir-like (5) - 1 freq gentie-like (5) - 10 freq general-like (5) - 1 freq ninetie-nine (5) - 1 freq bessie-like (5) - 1 freq sherp-like (5) - 2 freq tailor-like (5) - 1 freq ainerlie (5) - 2 freq dentie-like (5) - 1 freq |
aiverie-like (0) - 4 freq arverie-like (2) - 1 freq eerie-like (4) - 2 freq diarie-like (4) - 1 freq fierce-like (5) - 1 freq lairdie-like (6) - 1 freq ivy-like (6) - 1 freq queer-like (6) - 5 freq ferlie-like (6) - 1 freq owre-like (6) - 1 freq biker-like (6) - 1 freq taivert-lke (6) - 1 freq awfie-like (6) - 1 freq mirrie-lik (6) - 1 freq firm-like (7) - 1 freq wice-like (7) - 3 freq everilk (7) - 1 freq bird-like (7) - 1 freq sojer-like (7) - 1 freq ideal-like (7) - 1 freq abrup-like (7) - 1 freq wise-like (7) - 3 freq orra-like (7) - 1 freq bairn-like (7) - 1 freq forcie-like (7) - 1 freq |
SoundEx code - A164 aprile - 36 freq april - 117 freq aiverel - 1 freq april's - 2 freq aberlour - 5 freq abril - 1 freq aprily - 2 freq appairel - 1 freq aiverie-like - 4 freq aff-warld - 13 freq a-birlin - 1 freq aberlemno - 1 freq aprill - 1 freq apryle - 2 freq averill - 1 freq averillb - 1 freq |
MetaPhone code - AFRLK aiverie-like - 4 freq |
AIVERIE-LIKE |
| Time to execute Levenshtein function - 0.318650 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.688642 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.054722 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.083205 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.001180 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. |