Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
tailors (0) - 7 freq taylors (1) - 1 freq tailor's (1) - 1 freq sailors (1) - 17 freq tailor (1) - 28 freq tails (2) - 53 freq sailor (2) - 20 freq lalors (2) - 1 freq traitors (2) - 6 freq jailers (2) - 1 freq talons (2) - 5 freq jailous (2) - 1 freq tailored (2) - 3 freq taivers (2) - 3 freq sailor's (2) - 2 freq taillis (2) - 13 freq taylor (2) - 17 freq dailers (2) - 2 freq trailers (2) - 1 freq tail's (2) - 2 freq sailors' (2) - 2 freq taills (2) - 2 freq editors (3) - 23 freq carlo's (3) - 2 freq trailer (3) - 13 freq |
tailors (0) - 7 freq taylors (1) - 1 freq sailors (2) - 17 freq tailor (2) - 28 freq tailor's (2) - 1 freq dailers (3) - 2 freq taylor (3) - 17 freq taillis (3) - 13 freq teylers (3) - 1 freq tylers (3) - 1 freq taivers (3) - 3 freq taills (3) - 2 freq tail's (3) - 2 freq trailers (3) - 1 freq lalors (3) - 1 freq tails (3) - 53 freq talons (3) - 5 freq jailers (3) - 1 freq tailored (3) - 3 freq tudors (4) - 2 freq takers (4) - 2 freq thors (4) - 1 freq traalers (4) - 2 freq tilfers (4) - 1 freq talkers (4) - 1 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 dailers - 2 freq tellures - 1 freq dealers - 10 freq dollars - 6 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.193616 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.501226 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.030039 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.070068 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.000846 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. |