| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| knee-breeks (0) - 1 freq knee-breiks (1) - 1 freq knee-deep (4) - 1 freq bluebreeks (4) - 1 freq knee-heh (5) - 2 freq 'ned-free' (5) - 1 freq tea-brek (5) - 6 freq breeks (5) - 147 freq kee-vee (5) - 2 freq tarrybreeks (5) - 1 freq knee-lenth (5) - 1 freq kneedeep (5) - 1 freq tarry-breeks (5) - 2 freq e-braes (5) - 1 freq yee-ees (5) - 1 freq ee-broos (5) - 4 freq snaabree (6) - 1 freq ruif-trees (6) - 1 freq steereen (6) - 2 freq blae-green (6) - 1 freq hat-preens (6) - 1 freq outbreaks (6) - 2 freq peeries (6) - 2 freq anti-freeze (6) - 4 freq ken-merk (6) - 1 freq |
knee-breeks (0) - 1 freq knee-breiks (1) - 1 freq bluebreeks (7) - 1 freq e-braes (8) - 1 freq ee-broos (8) - 4 freq ken-merk (8) - 1 freq keel-marks (8) - 1 freq tarrybreeks (8) - 1 freq tarry-breeks (8) - 2 freq tea-brek (8) - 6 freq kenmarks (8) - 1 freq breeks (8) - 147 freq knee-deep (8) - 1 freq kie-buirds (8) - 1 freq nine-bars (9) - 1 freq paet-banks (9) - 1 freq kin-carers (9) - 1 freq neebours (9) - 33 freq keencks (9) - 1 freq knobbies (9) - 2 freq neebor's (9) - 5 freq hame-bakes (9) - 1 freq wine-baurs (9) - 1 freq neebirs (9) - 9 freq breks (9) - 23 freq |
SoundEx code - K516 knee-breeks - 1 freq kempers - 2 freq kinpurney - 6 freq knee-breiks - 1 freq €˜kimberley - 1 freq knapper - 2 freq komfirtablee - 1 freq kennyfarq - 14 freq kennyaberdeen - 1 freq |
MetaPhone code - NBRKS knee-breeks - 1 freq knee-breiks - 1 freq |
KNEE-BREEKS |
| Time to execute Levenshtein function - 0.356408 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.495341 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.028651 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.040296 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.000851 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. |