Fix comment.

diff --git a/lib/fstrcmp.c b/lib/fstrcmp.c
index 7d881da45b6b6fa96af799f19b4fd46497ec074c..90141d9d721b4cb5dd61ab280dde2fba91237f66 100644 (file)
--- 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