changeset 7450:ef05b5eb2c12

Fix comment.
author Bruno Haible <bruno@clisp.org>
date Mon, 18 Dec 2006 13:23:40 +0000
parents e285b18e8e0c
children 6c5a4b5959bb
files lib/fstrcmp.c
diffstat 1 files changed, 1 insertions(+), 1 deletions(-) [+]
line wrap: on
line diff
--- a/lib/fstrcmp.c
+++ b/lib/fstrcmp.c
@@ -20,7 +20,7 @@
 
    The basic idea is to consider two vectors as similar if, when
    transforming the first vector into the second vector through a
-   sequence of edits (inserts and deletes of one character each),
+   sequence of edits (inserts and deletes of one element each),
    this sequence is short - or equivalently, if the ordered list
    of elements that are untouched by these edits is long.  For a
    good introduction to the subject, read about the "Levenshtein