diff --git a/reference/strings/functions/similar-text.xml b/reference/strings/functions/similar-text.xml
index 7d62405d33..ca8bb12f87 100644
--- a/reference/strings/functions/similar-text.xml
+++ b/reference/strings/functions/similar-text.xml
@@ -15,11 +15,11 @@
    <methodparam choice="opt"><type>float</type><parameter role="reference">percent</parameter></methodparam>
   </methodsynopsis>
   <para>
-   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.
+   This calculates the similarity between two strings as described in
+   &book.programming.classics;. 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>
  </refsect1>