doc: fixes from code review

Author: james-d-mitchell

src/cong-common.cpp

@@ -227,7 +227,7 @@ of kind *knd* over the semigroup or monoid defined by the presentation *p*.
 
 {detail}
 
-:param knd: the kind (onesided or twosided) of the congruence.
+:param knd: the kind (`onesided` or `twosided`) of the congruence.
 :type knd: congruence_kind
 
 :param p: the presentation.
@@ -307,7 +307,7 @@ had been newly constructed from *knd* and *p*.
 
 {detail}
 
-:param knd: the kind (onesided or twosided) of the congruence.
+:param knd: the kind (`onesided` or `twosided`) of the congruence.
 :type knd: :any:`congruence_kind`
 
 :param p: the presentation.

src/sims.cpp

@@ -1851,7 +1851,6 @@ congruence lattice of the semigroup or monoid.
 :param sims: a :any:`Sims1` object.
 :type sims: Sims1
 
-:param n: maximum number of congruence classes.
 :param n: the maximum number of congruence classes.
 :type n: int
 

src/todd-coxeter-impl.cpp

@@ -289,7 +289,7 @@ congruence of kind *knd* over the :any:`ToddCoxeter` instance *tc*. The
 :any:`ToddCoxeter` instance constructed in this way represents a quotient of
 the word graph represented by *tc*.
 
-:param knd: the kind (one-sided or two-sided) of the congruence.
+:param knd: the kind (`onesided` or `twosided`) of the congruence.
 :type knd: congruence_kind
 
 :param tc: the :any:`ToddCoxeter` instance.
@@ -298,8 +298,8 @@ the word graph represented by *tc*.
 :raises LibsemigroupsError:
   if the arguments *knd* and *tc* are not compatible. If the first item is
   ``tc.kind()`` and the second is the parameter *knd*, then compatible
-  arguments are (one-sided, one-sided), (two-sided, one-sided), and (two-sided,
-  two-sided).
+  arguments are (`onesided`, `onesided`), (`twosided`, `onesided`), and (`twosided`,
+  `twosided`).
 )pbdoc");
 
     thing.def(py::init<congruence_kind, WordGraph<uint32_t> const&>(),
@@ -319,7 +319,7 @@ or right Cayley graph of a semigroup or monoid, then the
 :any:`ToddCoxeter` instance will represent a quotient of that
 semigroup.
 
-:param knd: the kind (one-sided or two-sided) of the congruence.
+:param knd: the kind (`onesided` or `twosided`) of the congruence.
 :type knd: congruence_kind
 
 :param wg: the word graph.
@@ -345,7 +345,7 @@ This function puts a :any:`ToddCoxeter` instance back into the state
 that it would have been in if it had just been newly constructed from
 *knd* and *tc*.
 
-:param knd: the kind (one-sided or two-sided) of the congruence.
+:param knd: the kind (`onesided` or `twosided`) of the congruence.
 :type knd: congruence_kind
 
 :param tc: the :any:`ToddCoxeter` instance.
@@ -357,8 +357,8 @@ that it would have been in if it had just been newly constructed from
 :raises LibsemigroupsError:
   if the arguments *knd* and *tc* are not compatible. If the first item is
   ``tc.kind()`` and the second is the parameter *knd*, then compatible
-  arguments are (one-sided, one-sided), (two-sided, one-sided), and (two-sided,
-  two-sided).
+  arguments are (`onesided`, `onesided`), (`twosided`, `onesided`), and (`twosided`,
+  `twosided`).
 )pbdoc");
 
     thing.def(
@@ -380,7 +380,7 @@ This function puts a :any:`ToddCoxeter` instance back into the state
 that it would have been in if it had just been newly constructed from
 *knd* and *wg*.
 
-:param knd: the kind (one-sided or two-sided) of the congruence.
+:param knd: the kind (`onesided` or `twosided`) of the congruence.
 :type knd: congruence_kind
 
 :param wg: the word graph.
@@ -915,7 +915,7 @@ During any lookaheads that are performed, it is periodically checked what
 proportion of the active nodes have been killed since the previous such check.
 This function can be used to set the interval between these checks. The purpose
 of this setting is to allow lookaheads to be stopped early if the number of
-nodes being killed is too small (for example, if less than ``1%`` of nodes were
+nodes being killed is too small (for example, if less than 1% of nodes were
 killed in the previous second, then we might want to stop the lookahead early,
 since lookaheads take some time but may not result in many nodes being
 killed).

src/todd-coxeter.cpp

@@ -163,7 +163,7 @@ congruence of kind *knd* over the :any:`ToddCoxeter` instance *tc*. The
 :any:`ToddCoxeter` instance constructed in this way represents a quotient of
 the word graph represented by *tc*.
 
-:param knd: the kind (one-sided or two-sided) of the congruence.
+:param knd: the kind (`onesided` or `twosided`) of the congruence.
 :type knd: congruence_kind
 
 :param tc: the :any:`ToddCoxeter` instance.
@@ -191,7 +191,7 @@ This function puts a :any:`ToddCoxeter` instance back into the state
 that it would have been in if it had just been newly constructed from
 *knd* and *tc*.
 
-:param knd: the kind (one-sided or two-sided) of the congruence.
+:param knd: the kind (`onesided` or `twosided`) of the congruence.
 :type knd: congruence_kind
 
 :param tc: the :any:`ToddCoxeter` instance.
@@ -223,7 +223,7 @@ or right Cayley graph of a semigroup or monoid, then the
 :any:`ToddCoxeter` instance will represent a quotient of that
 semigroup.
 
-:param knd: the kind (one-sided or two-sided) of the congruence.
+:param knd: the kind (`onesided` or `twosided`) of the congruence.
 :type knd: congruence_kind
 
 :param wg: the word graph.
@@ -247,7 +247,7 @@ Re-initialize from :any:`congruence_kind` and :any:`WordGraph`.
 This function puts a :any:`ToddCoxeter` instance back into the state that it
 would have been in if it had just been newly constructed from *knd* and *wg*.
 
-:param knd: the kind (one-sided or two-sided) of the congruence.
+:param knd: the kind (`onesided` or `twosided`) of the congruence.
 :type knd: congruence_kind
 
 :param wg: the word graph.

src/ukkonen.cpp

@@ -571,9 +571,10 @@ tree consisting of ``list[int]``. The implementation in this class is based on:
 `https://cp-algorithms.com/string/suffix-tree-ukkonen.html <https://cp-algorithms.com/string/suffix-tree-ukkonen.html>`_
 
 The suffix tree is updated when the member function :any:`ukkonen.add_word` is
-invoked. Every non-duplicate word added to the tree has a unique letter appended
-to the end. If a duplicate word is added, then the tree is not modified, but the
-value returned by :any:`Ukkonen.multiplicity` for the word is increased.
+invoked. Every non-duplicate word added to the tree has a unique letter
+appended to the end. If a duplicate word `w` is added, then the tree is not
+modified, but the value returned by :any:`Ukkonen.multiplicity` applied to `w`
+is increased.
 )pbdoc");
 
     ////////////////////////////////////////////////////////////////////////