aboutsummaryrefslogtreecommitdiff
path: root/swr2_asr/loss_scores.py
diff options
context:
space:
mode:
authorJoJoBarthold22023-09-06 15:39:48 +0200
committerJoJoBarthold22023-09-06 15:39:48 +0200
commitc60bade26935439889e45acf4a83f7e8cc75f705 (patch)
tree7d7cf675e1621aa40dbb987a52171f4b82a9ecf8 /swr2_asr/loss_scores.py
parent68d348aa3ff95f2ece09bbb649aa001d45b2324d (diff)
fixed a spelling mistake
Diffstat (limited to 'swr2_asr/loss_scores.py')
-rw-r--r--swr2_asr/loss_scores.py2
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)