| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aff-warld (0) - 13 freq aaldwarld (3) - 1 freq auld-warld (3) - 2 freq affoard (3) - 3 freq aalwarld (3) - 3 freq aff-haund (3) - 2 freq affuird (4) - 5 freq forward (4) - 162 freq ainward (4) - 4 freq afterward (4) - 4 freq age-auld (4) - 2 freq f-word (4) - 2 freq award (4) - 59 freq liftward (4) - 1 freq aukward (4) - 1 freq akward (4) - 3 freq hauf-bauld (4) - 1 freq awkward (4) - 36 freq aff-han (4) - 1 freq affload (4) - 1 freq afford (4) - 85 freq fsworld (4) - 1 freq auld-warldy (4) - 1 freq affoord (4) - 1 freq aipward (4) - 1 freq |
aff-warld (0) - 13 freq auld-warld (5) - 2 freq auld-warldy (6) - 1 freq aaldwarld (6) - 1 freq f-word (6) - 2 freq f-wurd (6) - 2 freq fsworld (6) - 1 freq affoard (6) - 3 freq aalwarld (6) - 3 freq aff-haund (6) - 2 freq affraid (7) - 1 freq affoord (7) - 1 freq affroad (7) - 1 freq ae-word (7) - 1 freq affered (7) - 1 freq afford (7) - 85 freq aff-white (7) - 1 freq warld (7) - 820 freq affload (7) - 1 freq liftward (7) - 1 freq hauf-bauld (7) - 1 freq afterward (7) - 4 freq forward (7) - 162 freq affuird (7) - 5 freq world (8) - 449 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 - AFWRLT aff-warld - 13 freq |
AFF-WARLD |
| Time to execute Levenshtein function - 0.235566 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.427108 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.032355 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.044544 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.001038 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. |