| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aff-warld (0) - 13 freq aff-haund (3) - 2 freq aaldwarld (3) - 1 freq auld-warld (3) - 2 freq affoard (3) - 3 freq aalwarld (3) - 3 freq f-word (4) - 2 freq ainward (4) - 4 freq affable (4) - 1 freq half-hard (4) - 2 freq aipward (4) - 1 freq half-cauld (4) - 1 freq atward (4) - 1 freq liftward (4) - 1 freq akward (4) - 3 freq fsworld (4) - 1 freq awald (4) - 3 freq aakward (4) - 6 freq aefauld (4) - 19 freq affload (4) - 1 freq aff-han (4) - 1 freq ae-word (4) - 1 freq hauf-bauld (4) - 1 freq warld (4) - 820 freq award (4) - 59 freq |
aff-warld (0) - 13 freq auld-warld (5) - 2 freq auld-warldy (6) - 1 freq aalwarld (6) - 3 freq fsworld (6) - 1 freq f-word (6) - 2 freq affoard (6) - 3 freq aaldwarld (6) - 1 freq aff-haund (6) - 2 freq aff-white (7) - 1 freq warld (7) - 820 freq hauf-bauld (7) - 1 freq forward (7) - 158 freq afford (7) - 84 freq affraid (7) - 1 freq ae-word (7) - 1 freq affoord (7) - 1 freq afterward (7) - 3 freq affuird (7) - 5 freq affroad (7) - 1 freq liftward (7) - 1 freq affload (7) - 1 freq wirld (8) - 73 freq hauf-aware (8) - 1 freq offaired (8) - 1 freq |
SoundEx code - A164 aprile - 36 freq april - 117 freq aiverel - 1 freq april's - 2 freq aberlour - 5 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.196152 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.342788 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.026982 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.036698 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.000787 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. |