Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
yearbeuk (0) - 1 freq yearbuik (2) - 1 freq year-en (3) - 1 freq yarbent (3) - 2 freq ceukbeuk (3) - 1 freq herbeur (3) - 1 freq yearless (3) - 1 freq yerseu' (3) - 1 freq textbeuk (3) - 2 freq chapbeuk (3) - 1 freq derek (4) - 40 freq lea-perk (4) - 2 freq year'd (4) - 1 freq arbehd (4) - 1 freq elbuk (4) - 1 freq yarned (4) - 2 freq learned (4) - 79 freq seaseek (4) - 1 freq seabed (4) - 2 freq fearce (4) - 1 freq tarbet (4) - 1 freq tarbuck (4) - 1 freq cerberus (4) - 15 freq seatbele (4) - 1 freq yerkers (4) - 2 freq |
yearbeuk (0) - 1 freq yearbuik (2) - 1 freq elbuk (5) - 1 freq beuk (5) - 108 freq yerk (5) - 3 freq yerbs (5) - 2 freq rebuke (5) - 3 freq yark (5) - 8 freq yerb (5) - 1 freq rerek (5) - 1 freq herbeur (5) - 1 freq arbeit (5) - 1 freq yerseu' (5) - 1 freq ceukbeuk (5) - 1 freq yarbent (5) - 2 freq year-en (5) - 1 freq erek (5) - 1 freq yerked (6) - 2 freq yeuk (6) - 6 freq uarke (6) - 1 freq verbena (6) - 1 freq earse (6) - 4 freq yarken (6) - 2 freq yerer- (6) - 1 freq reared (6) - 24 freq |
SoundEx code - Y612 yearbeuk - 1 freq yerbs - 2 freq yearbuik - 1 freq yerbaws - 1 freq yrwuvgvi - 1 freq yrfyyujirw - 1 freq yyyurhuifc - 1 freq yrviq - 1 freq |
MetaPhone code - YRBK yearbeuk - 1 freq yearbuik - 1 freq |
YEARBEUK |
Time to execute Levenshtein function - 0.225828 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.414384 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.027390 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.037476 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.000858 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. |