From c60bade26935439889e45acf4a83f7e8cc75f705 Mon Sep 17 00:00:00 2001
From: JoJoBarthold2
Date: Wed, 6 Sep 2023 15:39:48 +0200
Subject: fixed a spelling mistake

---
 swr2_asr/loss_scores.py | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

(limited to 'swr2_asr/loss_scores.py')

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)
-- 
cgit v1.2.3