[mlpack-git] (blog) master: Spelling detail. (e7947e6)

[gitdub at mlpack.org]

Repository : https://github.com/mlpack/blog
On branch  : master
Link       : https://github.com/mlpack/blog/compare/4d6e0514e644f32c23e11371e696c0e4c46570d5...e7947e665f45ac7e2a4bae24cbee7110a98fe7dc

>---------------------------------------------------------------

commit e7947e665f45ac7e2a4bae24cbee7110a98fe7dc
Author: MarcosPividori <marcos.pividori at gmail.com>
Date:   Wed Aug 3 10:37:50 2016 -0300

    Spelling detail.


>---------------------------------------------------------------

e7947e665f45ac7e2a4bae24cbee7110a98fe7dc
 content/blog/MarcosWeekTen.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/content/blog/MarcosWeekTen.md b/content/blog/MarcosWeekTen.md
index ed2f027..298c74a 100644
--- a/content/blog/MarcosWeekTen.md
+++ b/content/blog/MarcosWeekTen.md
@@ -21,7 +21,7 @@ When calculating the score of a query point and a reference node I consider 2 ca
 
 +) If the reference node is non-overlapping, I calculate the score the same than before.
 
-+) If the reference node is overlapping, I analyze the reference node's half space. If it contains the given query point, I return `0` (best score). Else, I return `DBL_MAX` (prune). As we consider axis-orthogonal splitting hyperplanes, we can decide which child node to traverse in O(1), analising the appropiate dimension.
++) If the reference node is overlapping, I analyze the reference node's half space. If it contains the given query point, I return `0` (best score). Else, I return `DBL_MAX` (prune). As we consider axis-orthogonal splitting hyperplanes, we can decide which child node to traverse in O(1), analising the appropriate dimension.
 
 ## Dual Tree Search: