cvs: phpdoc-da /reference/strings/functions similar-text.xml

holst		Fri Jul 23 10:27:38 2004 EDT

  Modified files:              
    /phpdoc-da/reference/strings/functions	similar-text.xml 
  Log:
  
  Deleted English text
  
  
http://cvs.php.net/diff.php/phpdoc-da/reference/strings/functions/similar-text.xml?r1=1.1&r2=1.2&ty=u
Index: phpdoc-da/reference/strings/functions/similar-text.xml
diff -u phpdoc-da/reference/strings/functions/similar-text.xml:1.1 phpdoc-da/reference/strings/functions/similar-text.xml:1.2
--- phpdoc-da/reference/strings/functions/similar-text.xml:1.1	Fri Jul 23 09:39:03 2004
+++ phpdoc-da/reference/strings/functions/similar-text.xml	Fri Jul 23 10:27:38 2004
@@ -1,5 +1,5 @@
 <?xml version="1.0" encoding="iso-8859-1"?>
-<!-- $Revision: 1.1 $ -->
+<!-- $Revision: 1.2 $ -->
 <!-- EN-Revision: 1.2 Maintainer: holst Status: ready -->
   <refentry id="function.similar-text">
    <refnamediv>
@@ -22,12 +22,6 @@
      Olivers pseudokode, men rekursive kald måske eller måske ikke sætter
      farten op på processen. Bemærk også at kompleksiteten af denne algoritme
      er 0(N**3) hvor N er længden på den længste streng.
-     This calculates the similarity between two strings as described
-     in Oliver [1993]. Note that this implementation does not use a
-     stack as in Oliver's pseudo code, but recursive calls which may
-     or may not speed up the whole process. Note also that the
-     complexity of this algorithm is O(N**3) where N is the length of
-     the longest string.
     </para>
     <para>
      Ved at give en reference som tredje parameter, vil