| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| veterans (0) - 8 freq veteransr (1) - 2 freq veteran (1) - 4 freq veteran's (1) - 1 freq caterans (2) - 5 freq veterans (2) - 1 freq eerans (2) - 1 freq eeran (3) - 2 freq reverant (3) - 3 freq ceitezans (3) - 4 freq ceterae (3) - 1 freq terns (3) - 2 freq getherins (3) - 2 freq eterne (3) - 2 freq beerana (3) - 1 freq lenterns (3) - 1 freq utteran (3) - 1 freq emerant (3) - 9 freq vera's (3) - 3 freq peter's (3) - 4 freq venera (3) - 2 freq strans (3) - 1 freq seterdays (3) - 1 freq returns (3) - 29 freq neteral (3) - 1 freq |
veterans (0) - 8 freq veteran (2) - 4 freq veteran's (2) - 1 freq veteransr (2) - 2 freq caterans (3) - 5 freq trans (4) - 5 freq vrans (4) - 1 freq returns (4) - 29 freq efterins (4) - 1 freq voters (4) - 63 freq strans (4) - 1 freq sterns (4) - 26 freq eerans (4) - 1 freq veterans (4) - 1 freq terns (4) - 2 freq peters (5) - 4 freq vettriano (5) - 1 freq strins (5) - 2 freq sternys (5) - 1 freq eftirins (5) - 3 freq veerin (5) - 1 freq alteran (5) - 1 freq vegans (5) - 1 freq meters (5) - 12 freq paiterns (5) - 2 freq |
SoundEx code - V365 veterans - 8 freq veteran - 4 freq veteran's - 1 freq vettriano - 1 freq veterans - 1 freq vtrmalv - 1 freq veteransr - 2 freq |
MetaPhone code - FTRNS veterans - 8 freq veteran's - 1 freq veterans - 1 freq |
VETERANS |
| Time to execute Levenshtein function - 0.500051 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.529537 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.034038 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.037134 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.000913 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. |