From 7f75271cff7f4f64d78feac798b2a0c350b7d13b Mon Sep 17 00:00:00 2001 From: "Barak A. Pearlmutter" Date: Tue, 19 Jul 2016 12:02:32 +0200 Subject: [PATCH 1/3] spelling Gbp-Pq: Name 0003-spelling.patch --- doc/policies/trees.hpp | 2 +- doc/tutorials/range_search/range_search.txt | 2 +- src/mlpack/core/tree/cosine_tree/cosine_tree.hpp | 2 +- src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value.hpp | 2 +- .../core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp | 2 +- src/mlpack/core/tree/rectangle_tree/hilbert_r_tree_split.hpp | 2 +- .../core/tree/rectangle_tree/r_plus_plus_tree_split_policy.hpp | 2 +- .../core/tree/rectangle_tree/r_plus_tree_split_policy.hpp | 2 +- src/mlpack/core/tree/rectangle_tree/r_star_tree_split.hpp | 2 +- src/mlpack/core/tree/rectangle_tree/r_tree_split.hpp | 2 +- src/mlpack/core/tree/rectangle_tree/x_tree_split.hpp | 2 +- src/mlpack/core/util/backtrace.cpp | 2 +- src/mlpack/core/util/backtrace.hpp | 2 +- src/mlpack/methods/naive_bayes/naive_bayes_classifier.hpp | 2 +- 14 files changed, 14 insertions(+), 14 deletions(-) diff --git a/doc/policies/trees.hpp b/doc/policies/trees.hpp index 89bed8c8b4f..c15ef3955a4 100644 --- a/doc/policies/trees.hpp +++ b/doc/policies/trees.hpp @@ -748,7 +748,7 @@ The \c RangeDistance() function allows a way for both bounds to be calculated at once. It is possible to implement this as a call to \c MinDistance() followed by a call to \c MaxDistance(), but this may incur more metric \c Evaluate() calls than necessary. Often calculating both bounds at once can be more -efficent and can be done with fewer \c Evaluate() calls than calling both +efficient and can be done with fewer \c Evaluate() calls than calling both \c MinDistance() and \c MaxDistance(). @subsection treetype_rigorous_serialization Serialization diff --git a/doc/tutorials/range_search/range_search.txt b/doc/tutorials/range_search/range_search.txt index 277a8444682..645f6233caa 100644 --- a/doc/tutorials/range_search/range_search.txt +++ b/doc/tutorials/range_search/range_search.txt @@ -47,7 +47,7 @@ A list of all the sections this tutorial contains. @section cli_rstut The 'mlpack_range_search' command-line executable -\b mlpack provides an exectuable, \c mlpack_range_search, which can be used to +\b mlpack provides an executable, \c mlpack_range_search, which can be used to perform range searches quickly and simply from the command-line. This program will perform the range search and place the resulting neighbor index list into one file and their corresponding distances into another file. These files are diff --git a/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp b/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp index a734a3d5785..16bcb6ca264 100644 --- a/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp +++ b/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp @@ -137,7 +137,7 @@ class CosineTree * a significant speedup when there are large number of columns to choose from * and when a number of samples are to be drawn from the distribution. * - * @param cDistribution Cumulative LS distibution of columns in the node. + * @param cDistribution Cumulative LS distribution of columns in the node. * @param value Randomly generated value in the range [0, 1]. * @param start Starting index of the distribution interval to search in. * @param end Ending index of the distribution interval to search in. diff --git a/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value.hpp b/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value.hpp index a2a12b0eff3..4c96f53b409 100644 --- a/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value.hpp +++ b/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value.hpp @@ -2,7 +2,7 @@ * @file discrete_hilbert_value.hpp * @author Mikhail Lozhnikov * - * Defintion of the DiscreteHilbertValue class, a class that calculates + * Definition of the DiscreteHilbertValue class, a class that calculates * the ordering of points using the Hilbert curve. */ #ifndef MLPACK_CORE_TREE_RECTANGLE_TREE_DISCRETE_HILBERT_VALUE_HPP diff --git a/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp b/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp index 4b74617f24d..d22d26aed4d 100644 --- a/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp +++ b/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp @@ -2,7 +2,7 @@ * @file discrete_hilbert_value.hpp * @author Mikhail Lozhnikov * - * Defintion of the DiscreteHilbertValue class, a class that calculates + * Definition of the DiscreteHilbertValue class, a class that calculates * the ordering of points using the Hilbert curve. */ #ifndef MLPACK_CORE_TREE_RECTANGLE_TREE_DISCRETE_HILBERT_VALUE_IMPL_HPP diff --git a/src/mlpack/core/tree/rectangle_tree/hilbert_r_tree_split.hpp b/src/mlpack/core/tree/rectangle_tree/hilbert_r_tree_split.hpp index 90fd77e9e32..bda835d1620 100644 --- a/src/mlpack/core/tree/rectangle_tree/hilbert_r_tree_split.hpp +++ b/src/mlpack/core/tree/rectangle_tree/hilbert_r_tree_split.hpp @@ -2,7 +2,7 @@ * @file hilbert_r_tree_split.hpp * @author Mikhail Lozhnikov * - * Defintion of the HilbertRTreeSplit class, a class that splits the nodes of an R + * Definition of the HilbertRTreeSplit class, a class that splits the nodes of an R * tree, starting at a leaf node and moving upwards if necessary. */ #ifndef MLPACK_CORE_TREE_RECTANGLE_TREE_HILBERT_R_TREE_SPLIT_HPP diff --git a/src/mlpack/core/tree/rectangle_tree/r_plus_plus_tree_split_policy.hpp b/src/mlpack/core/tree/rectangle_tree/r_plus_plus_tree_split_policy.hpp index 3941d130cb0..0b7ae4e4524 100644 --- a/src/mlpack/core/tree/rectangle_tree/r_plus_plus_tree_split_policy.hpp +++ b/src/mlpack/core/tree/rectangle_tree/r_plus_plus_tree_split_policy.hpp @@ -2,7 +2,7 @@ * @file r_plus_plus_tree_split_policy.hpp * @author Mikhail Lozhnikov * - * Defintion and implementation of the RPlusPlusTreeSplitPolicy class, a class + * Definition and implementation of the RPlusPlusTreeSplitPolicy class, a class * that helps to determine the subtree into which we should insert an * intermediate node. */ diff --git a/src/mlpack/core/tree/rectangle_tree/r_plus_tree_split_policy.hpp b/src/mlpack/core/tree/rectangle_tree/r_plus_tree_split_policy.hpp index 31787b978f3..1f082e06b01 100644 --- a/src/mlpack/core/tree/rectangle_tree/r_plus_tree_split_policy.hpp +++ b/src/mlpack/core/tree/rectangle_tree/r_plus_tree_split_policy.hpp @@ -2,7 +2,7 @@ * @file r_plus_tree_split_policy.hpp * @author Mikhail Lozhnikov * - * Defintion and implementation of the RPlusTreeSplitPolicy class, a class that + * Definition and implementation of the RPlusTreeSplitPolicy class, a class that * helps to determine the subtree into which we should insert an intermediate * node. */ diff --git a/src/mlpack/core/tree/rectangle_tree/r_star_tree_split.hpp b/src/mlpack/core/tree/rectangle_tree/r_star_tree_split.hpp index c3d48c42abc..d6726325825 100644 --- a/src/mlpack/core/tree/rectangle_tree/r_star_tree_split.hpp +++ b/src/mlpack/core/tree/rectangle_tree/r_star_tree_split.hpp @@ -2,7 +2,7 @@ * @file r_tree_star_split.hpp * @author Andrew Wells * - * Defintion of the RStarTreeSplit class, a class that splits the nodes of an R tree, starting + * Definition of the RStarTreeSplit class, a class that splits the nodes of an R tree, starting * at a leaf node and moving upwards if necessary. */ #ifndef MLPACK_CORE_TREE_RECTANGLE_TREE_R_STAR_TREE_SPLIT_HPP diff --git a/src/mlpack/core/tree/rectangle_tree/r_tree_split.hpp b/src/mlpack/core/tree/rectangle_tree/r_tree_split.hpp index 5dd3faf3949..53392e2a6a1 100644 --- a/src/mlpack/core/tree/rectangle_tree/r_tree_split.hpp +++ b/src/mlpack/core/tree/rectangle_tree/r_tree_split.hpp @@ -2,7 +2,7 @@ * @file r_tree_split.hpp * @author Andrew Wells * - * Defintion of the RTreeSplit class, a class that splits the nodes of an R + * Definition of the RTreeSplit class, a class that splits the nodes of an R * tree, starting at a leaf node and moving upwards if necessary. */ #ifndef MLPACK_CORE_TREE_RECTANGLE_TREE_R_TREE_SPLIT_HPP diff --git a/src/mlpack/core/tree/rectangle_tree/x_tree_split.hpp b/src/mlpack/core/tree/rectangle_tree/x_tree_split.hpp index ecdc060c99a..16828a0da7b 100644 --- a/src/mlpack/core/tree/rectangle_tree/x_tree_split.hpp +++ b/src/mlpack/core/tree/rectangle_tree/x_tree_split.hpp @@ -2,7 +2,7 @@ * @file x_tre_split.hpp * @author Andrew Wells * - * Defintion of the XTreeSplit class, a class that splits the nodes of an X + * Definition of the XTreeSplit class, a class that splits the nodes of an X * tree, starting at a leaf node and moving upwards if necessary. * * This is known to have a bug: see #368. diff --git a/src/mlpack/core/util/backtrace.cpp b/src/mlpack/core/util/backtrace.cpp index 582177b8ad3..e1cbc85944a 100644 --- a/src/mlpack/core/util/backtrace.cpp +++ b/src/mlpack/core/util/backtrace.cpp @@ -141,7 +141,7 @@ void Backtrace::DecodeAddress(long addr) if (FIND_LINE) { DemangleFunction(); - // Save retrieved informations. + // Save retrieved information. stack.push_back(frame); } } diff --git a/src/mlpack/core/util/backtrace.hpp b/src/mlpack/core/util/backtrace.hpp index 78d6ca4db9b..bf45324446c 100644 --- a/src/mlpack/core/util/backtrace.hpp +++ b/src/mlpack/core/util/backtrace.hpp @@ -16,7 +16,7 @@ namespace mlpack { * Provides a backtrace. * * The Backtrace class retrieve addresses of each called function from the - * stack and decode file name, function & line number. Retrieved informations + * stack and decode file name, function & line number. Retrieved information * can be printed in form: * * @code diff --git a/src/mlpack/methods/naive_bayes/naive_bayes_classifier.hpp b/src/mlpack/methods/naive_bayes/naive_bayes_classifier.hpp index 90daccc88cf..a6cc3082e4e 100644 --- a/src/mlpack/methods/naive_bayes/naive_bayes_classifier.hpp +++ b/src/mlpack/methods/naive_bayes/naive_bayes_classifier.hpp @@ -22,7 +22,7 @@ namespace naive_bayes /** The Naive Bayes Classifier. */ { * last row of the data input to the constructor. * * Mathematically, it computes P(X_i = x_i | Y = y_j) for each feature X_i for - * each of the labels y_j. Alongwith this, it also computes the classs + * each of the labels y_j. Alongwith this, it also computes the class * probabilities P(Y = y_j). * * For classifying a data point (x_1, x_2, ..., x_n), it computes the following: From 37b5fb0b415c8d107e01cc863e5062845ca80aa4 Mon Sep 17 00:00:00 2001 From: "Barak A. Pearlmutter" Date: Tue, 19 Jul 2016 12:02:32 +0200 Subject: [PATCH 2/3] spelling Gbp-Pq: Name 0003-spelling.patch --- src/mlpack/methods/ann/layer/dropconnect_layer.hpp | 2 +- .../methods/ann/layer/negative_log_likelihood_layer.hpp | 6 +++--- 2 files changed, 4 insertions(+), 4 deletions(-) diff --git a/src/mlpack/methods/ann/layer/dropconnect_layer.hpp b/src/mlpack/methods/ann/layer/dropconnect_layer.hpp index 54867cc362d..0e05816a620 100644 --- a/src/mlpack/methods/ann/layer/dropconnect_layer.hpp +++ b/src/mlpack/methods/ann/layer/dropconnect_layer.hpp @@ -42,7 +42,7 @@ namespace ann /** Artificial Neural Network. */ { * } * @endcode * - * @tparam InputLayer Layer used instead of the internel linear layer. + * @tparam InputLayer Layer used instead of the internal linear layer. * @tparam InputDataType Type of the input data (arma::colvec, arma::mat, * arma::sp_mat or arma::cube). * @tparam OutputDataType Type of the output data (arma::colvec, arma::mat, diff --git a/src/mlpack/methods/ann/layer/negative_log_likelihood_layer.hpp b/src/mlpack/methods/ann/layer/negative_log_likelihood_layer.hpp index d2f1f51108f..050e0152082 100644 --- a/src/mlpack/methods/ann/layer/negative_log_likelihood_layer.hpp +++ b/src/mlpack/methods/ann/layer/negative_log_likelihood_layer.hpp @@ -14,7 +14,7 @@ namespace ann /** Artificial Neural Network. */ { /** * Implementation of the negative log likelihood layer. The negative log - * likelihood layer expectes that the input contains log-probabilities for each + * likelihood layer expects that the input contains log-probabilities for each * class. The layer also expects a class index, in the range between 1 and the * number of classes, as target when calling the Forward function. * @@ -38,7 +38,7 @@ class NegativeLogLikelihoodLayer /** * Ordinary feed forward pass of a neural network. The negative log - * likelihood layer expectes that the input contains log-probabilities for + * likelihood layer expects that the input contains log-probabilities for * each class. The layer also expects a class index, in the range between 1 * and the number of classes, as target when calling the Forward function. * @@ -65,7 +65,7 @@ class NegativeLogLikelihoodLayer /** * Ordinary feed backward pass of a neural network. The negative log - * likelihood layer expectes that the input contains log-probabilities for + * likelihood layer expects that the input contains log-probabilities for * each class. The layer also expects a class index, in the range between 1 * and the number of classes, as target when calling the Forward function. * From b9b4095c307701363165b569d0ee2e0d2c013f62 Mon Sep 17 00:00:00 2001 From: "Barak A. Pearlmutter" Date: Tue, 19 Jul 2016 12:02:32 +0200 Subject: [PATCH 3/3] spelling Gbp-Pq: Name 0003-spelling.patch --- .../hilbert_r_tree_auxiliary_information.hpp | 2 +- .../core/tree/rectangle_tree/no_auxiliary_information.hpp | 2 +- .../r_plus_plus_tree_auxiliary_information.hpp | 2 +- .../tree/rectangle_tree/x_tree_auxiliary_information.hpp | 8 ++++---- src/mlpack/core/tree/space_split/hyperplane.hpp | 2 +- src/mlpack/methods/ann/init_rules/random_init.hpp | 2 +- src/mlpack/methods/neighbor_search/ns_model.hpp | 4 ++-- 7 files changed, 11 insertions(+), 11 deletions(-) diff --git a/src/mlpack/core/tree/rectangle_tree/hilbert_r_tree_auxiliary_information.hpp b/src/mlpack/core/tree/rectangle_tree/hilbert_r_tree_auxiliary_information.hpp index 4db0fa6df02..ad15882bd06 100644 --- a/src/mlpack/core/tree/rectangle_tree/hilbert_r_tree_auxiliary_information.hpp +++ b/src/mlpack/core/tree/rectangle_tree/hilbert_r_tree_auxiliary_information.hpp @@ -106,7 +106,7 @@ class HilbertRTreeAuxiliaryInformation /** * Update the auxiliary information in the node. The method returns true if - * the update should be propogated downward. + * the update should be propagated downward. * * @param node The node in which the auxiliary information being update. */ diff --git a/src/mlpack/core/tree/rectangle_tree/no_auxiliary_information.hpp b/src/mlpack/core/tree/rectangle_tree/no_auxiliary_information.hpp index c0772f81ceb..af424be84f7 100644 --- a/src/mlpack/core/tree/rectangle_tree/no_auxiliary_information.hpp +++ b/src/mlpack/core/tree/rectangle_tree/no_auxiliary_information.hpp @@ -99,7 +99,7 @@ class NoAuxiliaryInformation /** * Some tree types require to propagate the information upward. * This method should return false if this is not the case. If true is - * returned, the update will be propogated upward. + * returned, the update will be propagated upward. * * @param node The node in which the auxiliary information being update. */ diff --git a/src/mlpack/core/tree/rectangle_tree/r_plus_plus_tree_auxiliary_information.hpp b/src/mlpack/core/tree/rectangle_tree/r_plus_plus_tree_auxiliary_information.hpp index 768c8704dfb..c31d5a0a643 100644 --- a/src/mlpack/core/tree/rectangle_tree/r_plus_plus_tree_auxiliary_information.hpp +++ b/src/mlpack/core/tree/rectangle_tree/r_plus_plus_tree_auxiliary_information.hpp @@ -112,7 +112,7 @@ class RPlusPlusTreeAuxiliaryInformation /** * Some tree types require to propagate the information upward. * This method should return false if this is not the case. If true is - * returned, the update will be propogated upward. + * returned, the update will be propagated upward. * * @param node The node in which the auxiliary information being update. */ diff --git a/src/mlpack/core/tree/rectangle_tree/x_tree_auxiliary_information.hpp b/src/mlpack/core/tree/rectangle_tree/x_tree_auxiliary_information.hpp index ed4a3177224..7a1f2f2efc3 100644 --- a/src/mlpack/core/tree/rectangle_tree/x_tree_auxiliary_information.hpp +++ b/src/mlpack/core/tree/rectangle_tree/x_tree_auxiliary_information.hpp @@ -26,7 +26,7 @@ class XTreeAuxiliaryInformation { }; /** - * Construct this whith the specified node. + * Construct this with the specified node. * * @param node The node that stores this auxiliary information. */ @@ -143,7 +143,7 @@ class XTreeAuxiliaryInformation /** * Some tree types require to propagate the information upward. * This method should return false if this is not the case. If true is - * returned, the update will be propogated upward. + * returned, the update will be propagated upward. * @param node The node in which the auxiliary information being update. */ bool UpdateAuxiliaryInfo(TreeType* ) @@ -210,9 +210,9 @@ class XTreeAuxiliaryInformation size_t NormalNodeMaxNumChildren() const { return normalNodeMaxNumChildren; } //! Modify the maximum number of a normal node's children. size_t& NormalNodeMaxNumChildren() { return normalNodeMaxNumChildren; } - //! Return the split history of the node assosiated with this object. + //! Return the split history of the node associated with this object. const SplitHistoryStruct& SplitHistory() const { return splitHistory; } - //! Modify the split history of the node assosiated with this object. + //! Modify the split history of the node associated with this object. SplitHistoryStruct& SplitHistory() { return splitHistory; } /** diff --git a/src/mlpack/core/tree/space_split/hyperplane.hpp b/src/mlpack/core/tree/space_split/hyperplane.hpp index b64e54abec1..850e5e01eff 100644 --- a/src/mlpack/core/tree/space_split/hyperplane.hpp +++ b/src/mlpack/core/tree/space_split/hyperplane.hpp @@ -57,7 +57,7 @@ class HyperplaneBase {}; /** - * Project the given point on the projection vector and substract th + * Project the given point on the projection vector and subtract the * split value. * * @param point Point to be projected. diff --git a/src/mlpack/methods/ann/init_rules/random_init.hpp b/src/mlpack/methods/ann/init_rules/random_init.hpp index d3c70648684..c9f31ba57f7 100644 --- a/src/mlpack/methods/ann/init_rules/random_init.hpp +++ b/src/mlpack/methods/ann/init_rules/random_init.hpp @@ -32,7 +32,7 @@ class RandomInitialization /** * Initialize the random initialization rule with the given bound. - * Using the negative of the bound as lower bound and the postive bound as + * Using the negative of the bound as lower bound and the positive bound as * upper bound. * * @param bound The number used as lower bound diff --git a/src/mlpack/methods/neighbor_search/ns_model.hpp b/src/mlpack/methods/neighbor_search/ns_model.hpp index 4f4c47d6e1f..ac400846e82 100644 --- a/src/mlpack/methods/neighbor_search/ns_model.hpp +++ b/src/mlpack/methods/neighbor_search/ns_model.hpp @@ -84,7 +84,7 @@ class MonoSearchVisitor : public boost::static_visitor /** * BiSearchVisitor executes a bichromatic neighbor search on the given NSType. - * We use template specialization to differenciate those tree types that + * We use template specialization to differentiate those tree types that * accept leafSize as a parameter. In these cases, before doing neighbor search, * a query tree with proper leafSize is built from the querySet. */ @@ -145,7 +145,7 @@ class BiSearchVisitor : public boost::static_visitor /** * TrainVisitor sets the reference set to a new reference set on the given - * NSType. We use template specialization to differenciate those tree types that + * NSType. We use template specialization to differentiate those tree types that * accept leafSize as a parameter. In these cases, a reference tree with proper * leafSize is built from the referenceSet. */