Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
wreckage (0) - 4 freq breakage (2) - 1 freq peckage (2) - 2 freq wreck (3) - 14 freq treckle (3) - 1 freq wrecked (3) - 12 freq wrecks (3) - 2 freq wreckin (3) - 3 freq package (3) - 28 freq wrecksi (3) - 1 freq preclare (3) - 2 freq wrecking (3) - 1 freq wreckit (3) - 1 freq recharge (3) - 1 freq reggae (4) - 1 freq arcade (4) - 8 freq creenge (4) - 19 freq wringe (4) - 1 freq rummage (4) - 1 freq 'preciate (4) - 1 freq recite (4) - 9 freq veage (4) - 9 freq cracke (4) - 1 freq weygate (4) - 1 freq retrace (4) - 1 freq |
wreckage (0) - 4 freq wreckin (4) - 3 freq wrecksi (4) - 1 freq wrecks (4) - 2 freq wreckit (4) - 1 freq wrecking (4) - 1 freq wreck (4) - 14 freq peckage (4) - 2 freq wrecked (4) - 12 freq breakage (4) - 1 freq wrackin (5) - 6 freq wrackid (5) - 2 freq wrackit (5) - 2 freq wrack (5) - 39 freq wracks (5) - 11 freq wrackt (5) - 1 freq package (5) - 28 freq treckle (5) - 1 freq wracked (5) - 5 freq reckt (6) - 1 freq bruckle (6) - 15 freq trickie (6) - 5 freq rocklie (6) - 1 freq wrekin (6) - 1 freq trecks (6) - 1 freq |
SoundEx code - W622 wirkies - 1 freq wirricowes - 1 freq warkhoose - 2 freq worricows - 1 freq wershest - 1 freq wreckage - 4 freq warsaw's - 1 freq wirkwyse - 1 freq workies - 1 freq 'wirawjocktamsonsbairns' - 1 freq waorgujmd - 1 freq wrxag - 1 freq worsest - 1 freq worsestest - 1 freq wrujcizqw - 1 freq wrjygglxem - 1 freq wrgez - 1 freq |
MetaPhone code - RKJ wreckage - 4 freq |
WRECKAGE |
Time to execute Levenshtein function - 0.300980 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.673389 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.042133 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.081429 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.001136 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. |