diff options
| author | JoJoBarthold2 | 2023-09-06 16:59:42 +0200 |
|---|---|---|
| committer | GitHub | 2023-09-06 16:59:42 +0200 |
| commit | f0910dfad95ff29e1bdf0a657558e17ff2230a14 (patch) | |
| tree | 7d7cf675e1621aa40dbb987a52171f4b82a9ecf8 /swr2_asr | |
| parent | cbbe597ce360e938e152bfbe8ea19e3090a43671 (diff) | |
| parent | c60bade26935439889e45acf4a83f7e8cc75f705 (diff) | |
Merge pull request #34 from Algo-Boys/vaile-reads-code
Vaile reads code
Diffstat (limited to 'swr2_asr')
| -rw-r--r-- | swr2_asr/loss_scores.py | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/swr2_asr/loss_scores.py b/swr2_asr/loss_scores.py index ef37b0a..63c8a8f 100644 --- a/swr2_asr/loss_scores.py +++ b/swr2_asr/loss_scores.py @@ -12,7 +12,7 @@ def _levenshtein_distance(ref, hyp): between two sequences. Informally, the levenshtein disctance is defined as the minimum number of single-character edits (substitutions, insertions or deletions) required to change one word into the other. We can naturally - extend the edits to word level when calculate levenshtein disctance for + extend the edits to word level when calculating levenshtein disctance for two sentences. """ len_ref = len(ref) |