Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
yin-street (0) - 1 freq i'street (3) - 7 freq yistreen (3) - 4 freq ministrie (4) - 1 freq intrest (4) - 10 freq minstrels (4) - 2 freq sing-greet (4) - 1 freq windscreen (4) - 4 freq discreet (4) - 5 freq the-streen (4) - 1 freq yin-sided (4) - 2 freq instruct (4) - 4 freq linktree (4) - 1 freq yin-soorce (4) - 4 freq minstrel (4) - 1 freq pin-striped (4) - 1 freq winscreen (4) - 1 freq insteed (4) - 60 freq yin-servant (4) - 1 freq win-swept (4) - 1 freq yestreen (4) - 58 freq yin-sidit (4) - 1 freq in-atween (4) - 2 freq backstreet (4) - 1 freq fig-tree (4) - 3 freq |
yin-street (0) - 1 freq i'street (5) - 7 freq yin-sidit (6) - 1 freq street (6) - 687 freq instruct (6) - 4 freq yin-soorce (6) - 4 freq yistreen (6) - 4 freq on-steid (7) - 11 freq nusiret (7) - 37 freq intert (7) - 1 freq i'streen (7) - 14 freq yin-time (7) - 2 freq insistent (7) - 6 freq ainswert (7) - 1 freq ainster (7) - 2 freq unspret (7) - 1 freq straet (7) - 1 freq non-starter (7) - 1 freq insert (7) - 3 freq nostre (7) - 1 freq entreat (7) - 2 freq streyt (7) - 3 freq instict (7) - 1 freq industries (7) - 15 freq insistet (7) - 1 freq |
SoundEx code - Y523 yinst - 77 freq yin-act - 2 freq yanked - 6 freq youngsters - 20 freq yin-street - 1 freq yankit - 1 freq yunkit - 1 freq youngstèrs - 3 freq youngstèrs' - 1 freq yin-sided - 2 freq youngscot - 1 freq yangtze - 1 freq youngster - 2 freq yin-sidit - 1 freq youngwd - 18 freq ynkzdck - 1 freq |
MetaPhone code - YNSTRT yin-street - 1 freq |
YIN-STREET |
Time to execute Levenshtein function - 0.319073 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.475431 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.029750 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.037995 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.003990 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. |