diff --git a/reference/strings/functions/levenshtein.xml b/reference/strings/functions/levenshtein.xml
index f53bf87ee8..57601f9b3c 100644
--- a/reference/strings/functions/levenshtein.xml
+++ b/reference/strings/functions/levenshtein.xml
@@ -1,5 +1,5 @@
 <?xml version="1.0" encoding="iso-8859-1"?>
-<!-- $Revision: 1.4 $ -->
+<!-- $Revision: 1.5 $ -->
 <!-- splitted from ./en/functions/strings.xml, last change in rev 1.12 -->
   <refentry id="function.levenshtein">
    <refnamediv>
@@ -23,15 +23,13 @@
       <type>int</type><methodname>levenshtein</methodname>
       <methodparam><type>string</type><parameter>str1</parameter></methodparam>
       <methodparam><type>string</type><parameter>str2</parameter></methodparam>
-      <methodparam><type>function</type><parameter>cost</parameter></methodparam>
+      <methodparam><type>callback</type><parameter>cost</parameter></methodparam>
      </methodsynopsis>
      -->
     <para>
      This function returns the Levenshtein-Distance between the
      two argument strings or -1, if one of the argument strings
-     is longer than the limit of 255 characters (255 should be
-     more than enough for name or dictionary comparison, and 
-     nobody serious would be doing genetic analysis with PHP).
+     is longer than the limit of 255 characters.
     </para>
     <para>
      The Levenshtein distance is defined as the minimal number of