From aaf6005fa91537b3c4e1684bca3f3dfdc3fd9a01 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Fernando=20Tricas=20Garc=C3=ADa?= Date: Sat, 16 Sep 2017 19:56:49 +0200 Subject: [PATCH] Small typo --- docs/comparison.rst | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/comparison.rst b/docs/comparison.rst index 111082c..abfa3de 100644 --- a/docs/comparison.rst +++ b/docs/comparison.rst @@ -10,7 +10,7 @@ Levenshtein Distance Compute the Levenshtein distance between s1 and s2. -Levenshtein distance represents the number of insertions, deletions, and subsititutions required to change one word to another. +Levenshtein distance represents the number of insertions, deletions, and substitutions required to change one word to another. For example: ``levenshtein_distance('berne', 'born') == 2`` representing the transformation of the first e to o and the deletion of the second e.