| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ambassador (0) - 9 freq ambassadors (1) - 9 freq amassed (4) - 2 freq amalkadog (4) - 20 freq matador (4) - 1 freq fifeambassador (4) - 1 freq ambassadoriall (4) - 1 freq embassies (5) - 3 freq alastair (5) - 10 freq barbados (5) - 6 freq massacre (5) - 7 freq ashaor (5) - 1 freq masseur (5) - 2 freq massage (5) - 17 freq alasdair (5) - 19 freq massed (5) - 2 freq ambushed (5) - 1 freq embassie (5) - 1 freq mastodon (5) - 1 freq massages (5) - 1 freq massagin (5) - 2 freq abandon (5) - 12 freq messager (5) - 1 freq embassy (5) - 1 freq anassarwar (5) - 9 freq |
ambassador (0) - 9 freq ambassadors (2) - 9 freq ambassadoriall (6) - 1 freq fifeambassador (6) - 1 freq embossed (6) - 3 freq amassed (6) - 2 freq ambushed (7) - 1 freq embassie (7) - 1 freq messager (7) - 1 freq masseur (7) - 2 freq embassy (7) - 1 freq massed (7) - 2 freq embassies (7) - 3 freq matador (7) - 1 freq massacre (7) - 7 freq mbskare (8) - 1 freq embroider (8) - 1 freq messmer (8) - 1 freq boysadear (8) - 1 freq emissary (8) - 2 freq massiemore (8) - 2 freq maisser (8) - 1 freq missed (8) - 198 freq baessed (8) - 5 freq messidge (8) - 1 freq |
SoundEx code - A512 ambassador - 9 freq ambushin - 1 freq ambushit - 1 freq ambush - 5 freq ambiguities - 1 freq ambcetion - 1 freq ambassadors - 9 freq ambiguity - 2 freq amboise - 3 freq ambassadoriall - 1 freq ambiguous - 2 freq ambushed - 1 freq anivjcczx - 1 freq anapests - 1 freq anabwkjpkw - 1 freq |
MetaPhone code - AMSTR ambassador - 9 freq |
AMBASSADOR |
| Time to execute Levenshtein function - 0.216701 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.387674 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.031270 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.038315 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.000965 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. |