diff --git a/doc/ksp/pgr_KSP.rst b/doc/ksp/pgr_KSP.rst
index 493bdf40f4f..f2a152206b0 100644
--- a/doc/ksp/pgr_KSP.rst
+++ b/doc/ksp/pgr_KSP.rst
@@ -81,10 +81,10 @@ Parameters
      - Identifier of the departure vertex.
    * - **end vid**
      - **ANY-INTEGER**
-     - Identifier of the departure vertex.
+     - Identifier of the arrival vertex.
    * - **K**
      - **ANY-INTEGER**
-     - Number of required paths
+     - Number of required paths.
 
 Where:
 
@@ -116,7 +116,7 @@ KSP Optional parameters
    * - ``heap_paths``
      - ``BOOLEAN``
      - ``false``
-     - * When ``false`` Returns at most K paths
+     - * When ``false`` Returns at most K paths.
        * When ``true`` all the calculated paths while processing are returned.
        * Roughly, when the shortest path has ``N`` edges, the heap will contain
          about than ``N * K`` paths for small value of ``K`` and ``K > 5``.
diff --git a/locale/en/LC_MESSAGES/pgrouting_doc_strings.po b/locale/en/LC_MESSAGES/pgrouting_doc_strings.po
index e3fa9e5df26..550fe959173 100644
--- a/locale/en/LC_MESSAGES/pgrouting_doc_strings.po
+++ b/locale/en/LC_MESSAGES/pgrouting_doc_strings.po
@@ -8,7 +8,7 @@ msgid ""
 msgstr ""
 "Project-Id-Version: pgRouting v3.4.0-dev\n"
 "Report-Msgid-Bugs-To: \n"
-"POT-Creation-Date: 2023-03-16 12:56-0600\n"
+"POT-Creation-Date: 2023-03-29 04:51+0000\n"
 "PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n"
 "Last-Translator: FULL NAME <EMAIL@ADDRESS>\n"
 "Language-Team: LANGUAGE <LL@li.org>\n"
@@ -6963,7 +6963,7 @@ msgstr ""
 msgid "**K**"
 msgstr ""
 
-msgid "Number of required paths"
+msgid "Number of required paths."
 msgstr ""
 
 msgid "KSP Optional parameters"
@@ -6972,7 +6972,7 @@ msgstr ""
 msgid "``heap_paths``"
 msgstr ""
 
-msgid "When ``false`` Returns at most K paths"
+msgid "When ``false`` Returns at most K paths."
 msgstr ""
 
 msgid "When ``true`` all the calculated paths while processing are returned."
@@ -14525,6 +14525,9 @@ msgstr ""
 msgid "Identifier of the destination vertex."
 msgstr ""
 
+msgid "Number of required paths"
+msgstr ""
+
 msgid ""
 "Get :math:`2` paths using left side driving topology, from vertex "
 ":math:`1` to the closest location on the graph of point `(2.9, 1.8)`."
diff --git a/locale/pot/pgrouting_doc_strings.pot b/locale/pot/pgrouting_doc_strings.pot
index 27b1fa85427..e2a2d80af08 100644
--- a/locale/pot/pgrouting_doc_strings.pot
+++ b/locale/pot/pgrouting_doc_strings.pot
@@ -8,7 +8,7 @@ msgid ""
 msgstr ""
 "Project-Id-Version: pgRouting v3.5.1\n"
 "Report-Msgid-Bugs-To: \n"
-"POT-Creation-Date: 2023-03-16 12:56-0600\n"
+"POT-Creation-Date: 2023-03-29 04:51+0000\n"
 "PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n"
 "Last-Translator: FULL NAME <EMAIL@ADDRESS>\n"
 "Language-Team: LANGUAGE <LL@li.org>\n"
@@ -6118,7 +6118,7 @@ msgstr ""
 msgid "**K**"
 msgstr ""
 
-msgid "Number of required paths"
+msgid "Number of required paths."
 msgstr ""
 
 msgid "KSP Optional parameters"
@@ -6127,7 +6127,7 @@ msgstr ""
 msgid "``heap_paths``"
 msgstr ""
 
-msgid "When ``false`` Returns at most K paths"
+msgid "When ``false`` Returns at most K paths."
 msgstr ""
 
 msgid "When ``true`` all the calculated paths while processing are returned."
@@ -12394,6 +12394,9 @@ msgstr ""
 msgid "Identifier of the destination vertex."
 msgstr ""
 
+msgid "Number of required paths"
+msgstr ""
+
 msgid "Get :math:`2` paths using left side driving topology, from vertex :math:`1` to the closest location on the graph of point `(2.9, 1.8)`."
 msgstr ""