Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
tailors (0) - 7 freq tailor (1) - 28 freq taylors (1) - 1 freq tailor's (1) - 1 freq sailors (1) - 17 freq taylor (2) - 17 freq taills (2) - 2 freq dailers (2) - 2 freq tails (2) - 54 freq traitors (2) - 6 freq tail's (2) - 2 freq trailers (2) - 1 freq taivers (2) - 3 freq sailor (2) - 20 freq mailers (2) - 1 freq taillis (2) - 13 freq talons (2) - 5 freq sailor's (2) - 2 freq jailous (2) - 1 freq jailers (2) - 1 freq tailored (2) - 3 freq lalors (2) - 1 freq sailors' (2) - 2 freq tankers (3) - 2 freq janitors (3) - 2 freq |
tailors (0) - 7 freq taylors (1) - 1 freq sailors (2) - 17 freq tailor's (2) - 1 freq tailor (2) - 28 freq talons (3) - 5 freq taillis (3) - 13 freq jailers (3) - 1 freq teylers (3) - 1 freq mailers (3) - 1 freq lalors (3) - 1 freq tailored (3) - 3 freq tylers (3) - 1 freq taylor (3) - 17 freq tails (3) - 54 freq taills (3) - 2 freq tail's (3) - 2 freq taivers (3) - 3 freq trailers (3) - 1 freq dailers (3) - 2 freq atlows (4) - 1 freq tales (4) - 149 freq tiers (4) - 5 freq talkers (4) - 1 freq tailoreen (4) - 2 freq |
SoundEx code - T462 tellers - 5 freq tellaris - 1 freq tellures - 1 freq tailors - 7 freq teylers - 1 freq taylors - 1 freq tailor's - 1 freq twaloors - 2 freq tylers - 1 freq tailrace - 1 freq tlrgsz - 1 freq tlrcsa - 1 freq |
MetaPhone code - TLRS tellers - 5 freq deleerious - 1 freq tellaris - 1 freq dollars - 7 freq dailers - 2 freq tellures - 1 freq dealers - 10 freq delirious - 3 freq tailors - 7 freq teylers - 1 freq taylors - 1 freq tailor's - 1 freq dollars- - 1 freq tylers - 1 freq tailrace - 1 freq |
TAILORS |
Time to execute Levenshtein function - 0.208329 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.357510 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.027615 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.037347 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.000900 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. |