Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
aimbulance (0) - 3 freq ambulance (1) - 37 freq ambulances (2) - 1 freq sibilance (3) - 1 freq semblance (3) - 3 freq tribulance (3) - 2 freq €™ambulance (3) - 1 freq admittance (4) - 1 freq impudence (4) - 2 freq abeyance (4) - 1 freq airplane (4) - 4 freq allouance (4) - 3 freq assurance (4) - 6 freq himlane (4) - 1 freq tribulence (4) - 1 freq turbulence (4) - 1 freq airaplane (4) - 2 freq ambience (4) - 4 freq aiulice (4) - 1 freq aiblach (4) - 1 freq balance (4) - 53 freq trublance (4) - 2 freq insurance (4) - 18 freq blance (4) - 2 freq remberance (4) - 1 freq |
aimbulance (0) - 3 freq ambulance (1) - 37 freq ambulances (3) - 1 freq semblance (4) - 3 freq sibilance (4) - 1 freq balance (5) - 53 freq ambience (5) - 4 freq tribulance (5) - 2 freq €™ambulance (5) - 1 freq blance (5) - 2 freq trublance (6) - 2 freq blanc (6) - 1 freq imbolc (6) - 1 freq blanca (6) - 2 freq remberance (6) - 1 freq amblin (6) - 3 freq abeyance (6) - 1 freq impudence (6) - 2 freq tribulence (6) - 1 freq allouance (6) - 3 freq turbulence (6) - 1 freq implant (7) - 2 freq belange (7) - 1 freq sclance (7) - 1 freq balances (7) - 3 freq |
SoundEx code - A514 anvilflush - 1 freq anvil - 5 freq amplify - 2 freq ambulance - 37 freq ambulances - 1 freq aimbulance - 3 freq ample - 9 freq anvils - 1 freq ainvils - 1 freq amble - 3 freq amblin - 3 freq ambles - 2 freq amplifies - 1 freq amplifiers - 1 freq annville - 1 freq amplified - 1 freq anbile - 1 freq €™ambulance - 1 freq amplifyin - 2 freq annabel - 1 freq amplifier - 1 freq ambled - 1 freq annbloom - 1 freq amiable - 1 freq |
MetaPhone code - AMLNS ambulance - 37 freq aimbulance - 3 freq €™ambulance - 1 freq |
AIMBULANCE |
Time to execute Levenshtein function - 0.201255 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.355037 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.028268 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.037099 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.000907 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. |