diff --git a/R/compute_mallows.R b/R/compute_mallows.R
index 2a5992a7..11c58c18 100644
--- a/R/compute_mallows.R
+++ b/R/compute_mallows.R
@@ -152,7 +152,7 @@
 #'   function should be estimated over the whole range of \eqn{\alpha} values
 #'   covered by the prior distribution for \eqn{\alpha} with high probability.
 #'   In the case that a cluster \eqn{\alpha_c} becomes empty during the
-#'   Metropolis-Hastings algorihm, the posterior of \eqn{\alpha_c} equals its
+#'   Metropolis-Hastings algorithm, the posterior of \eqn{\alpha_c} equals its
 #'   prior. For example, if the rate parameter of the exponential prior equals,
 #'   say \eqn{\lambda = 0.001}, there is about 37 \% (or exactly: \code{1 -
 #'   pexp(1000, 0.001)}) prior probability that \eqn{\alpha_c > 1000}. Hence
diff --git a/man/compute_mallows.Rd b/man/compute_mallows.Rd
index 10bd2395..67ace03b 100644
--- a/man/compute_mallows.Rd
+++ b/man/compute_mallows.Rd
@@ -163,7 +163,7 @@ estimated partition function when \code{n_clusters > 1}, the partition
 function should be estimated over the whole range of \eqn{\alpha} values
 covered by the prior distribution for \eqn{\alpha} with high probability.
 In the case that a cluster \eqn{\alpha_c} becomes empty during the
-Metropolis-Hastings algorihm, the posterior of \eqn{\alpha_c} equals its
+Metropolis-Hastings algorithm, the posterior of \eqn{\alpha_c} equals its
 prior. For example, if the rate parameter of the exponential prior equals,
 say \eqn{\lambda = 0.001}, there is about 37 \% (or exactly: \code{1 -
 pexp(1000, 0.001)}) prior probability that \eqn{\alpha_c > 1000}. Hence