Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
anvil (0) - 5 freq anvils (1) - 1 freq angel (2) - 113 freq antit (2) - 1 freq devil (2) - 35 freq avi (2) - 1 freq avila (2) - 1 freq an-in (2) - 1 freq anawl (2) - 1 freq axil (2) - 1 freq angim (2) - 1 freq avail (2) - 12 freq vil (2) - 2 freq anlie (2) - 15 freq april (2) - 117 freq ah'il (2) - 24 freq €œvil (2) - 1 freq until (2) - 495 freq invpl (2) - 1 freq nail (2) - 46 freq ail (2) - 7 freq a'il (2) - 3 freq onkil (2) - 9 freq ahil (2) - 1 freq asail (2) - 1 freq |
anvil (0) - 5 freq novil (2) - 3 freq unveil (2) - 1 freq anvils (2) - 1 freq intil (3) - 554 freq ontil (3) - 53 freq invis (3) - 1 freq laevil (3) - 1 freq neil (3) - 87 freq oantil (3) - 1 freq ingil (3) - 5 freq civil (3) - 38 freq divil (3) - 17 freq ainvils (3) - 1 freq unkil (3) - 4 freq navel (3) - 1 freq anal (3) - 1 freq anbile (3) - 1 freq evil (3) - 90 freq invie (3) - 1 freq nil (3) - 7 freq envie (3) - 2 freq kevil (3) - 1 freq vil (3) - 2 freq anlie (3) - 15 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 - ANFL anvil - 5 freq annville - 1 freq |
ANVIL |
Time to execute Levenshtein function - 0.223860 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.430830 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.027444 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.037299 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.000961 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. |