From d926e56a4865e531a4ebb14347141ddc8a04849d Mon Sep 17 00:00:00 2001 From: Justin Viiret Date: Tue, 7 Nov 2017 14:43:58 +1100 Subject: [PATCH] doc: make Wikipedia hyperlinks anonymous --- doc/dev-reference/compilation.rst | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/doc/dev-reference/compilation.rst b/doc/dev-reference/compilation.rst index 65eb1fc4..fd903379 100644 --- a/doc/dev-reference/compilation.rst +++ b/doc/dev-reference/compilation.rst @@ -405,14 +405,14 @@ follows: #. **Edit distance** is defined as Levenshtein distance. That is, there are three possible edit types considered: insertion, removal and substitution. A more formal description can be found on - `Wikipedia `_. + `Wikipedia `__. #. **Hamming distance** is the number of positions by which two strings of equal length differ. That is, it is the number of substitutions required to convert one string to the other. There are no insertions or removals when approximate matching using a Hamming distance. A more formal description can be found on - `Wikipedia `_. + `Wikipedia `__. #. **Approximate matching** will match all *corpora* within a given edit or Hamming distance. That is, given a pattern, approximate matching will match