| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| anvils (0) - 1 freq anvil (1) - 5 freq angils (1) - 1 freq ainvils (1) - 1 freq anbile (2) - 1 freq antics (2) - 12 freq nails (2) - 78 freq avila (2) - 1 freq ails (2) - 9 freq fankils (2) - 1 freq onkils (2) - 1 freq anits (2) - 2 freq evils (2) - 4 freq snails (2) - 13 freq novils (2) - 1 freq angels (2) - 64 freq levils (2) - 1 freq invis (2) - 1 freq canvis (2) - 1 freq aipils (2) - 1 freq annals (2) - 5 freq cangils (2) - 1 freq unveils (2) - 1 freq annies (2) - 1 freq devils (2) - 1 freq |
anvils (0) - 1 freq ainvils (1) - 1 freq novils (2) - 1 freq angils (2) - 1 freq anvil (2) - 5 freq unveils (2) - 1 freq invis (3) - 1 freq navels (3) - 1 freq angels (3) - 64 freq devils (3) - 1 freq novels (3) - 29 freq nuvels (3) - 1 freq annals (3) - 5 freq levils (3) - 1 freq nails (3) - 78 freq onkils (3) - 1 freq evils (3) - 4 freq nirls (4) - 1 freq animuls (4) - 1 freq angles (4) - 25 freq eanvees (4) - 1 freq bevels (4) - 1 freq weevils (4) - 1 freq deivils (4) - 1 freq unveil (4) - 1 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 ambles - 2 freq amplifies - 1 freq amplifiers - 1 freq annville - 1 freq amblin - 2 freq amplified - 1 freq anbile - 1 freq €™ambulance - 1 freq amble - 2 freq amplifyin - 2 freq annabel - 1 freq amplifier - 1 freq ambled - 1 freq annbloom - 1 freq amiable - 1 freq |
MetaPhone code - ANFLS anvils - 1 freq ainvils - 1 freq |
ANVILS |
| Time to execute Levenshtein function - 0.310659 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.547290 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.032484 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.043405 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.000819 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. |