Javadoc since tags
diff --git a/src/main/java/org/apache/commons/text/lookup/StringLookupFactory.java b/src/main/java/org/apache/commons/text/lookup/StringLookupFactory.java
index bc98f75..a2a0abd 100644
--- a/src/main/java/org/apache/commons/text/lookup/StringLookupFactory.java
+++ b/src/main/java/org/apache/commons/text/lookup/StringLookupFactory.java
@@ -512,10 +512,9 @@
      * in cases where the set of default lookups must be modified. (See the class documentation
      * for details.)
      *
-     * @since 1.10
+     * @since 1.10.0
      */
-    public static final String DEFAULT_STRING_LOOKUPS_PROPERTY =
-            "org.apache.commons.text.lookup.StringLookupFactory.defaultStringLookups";
+    public static final String DEFAULT_STRING_LOOKUPS_PROPERTY = "org.apache.commons.text.lookup.StringLookupFactory.defaultStringLookups";
 
     /**
      * Clears any static resources.
diff --git a/src/main/java/org/apache/commons/text/numbers/package-info.java b/src/main/java/org/apache/commons/text/numbers/package-info.java
index 0e9e671..8cde09f 100644
--- a/src/main/java/org/apache/commons/text/numbers/package-info.java
+++ b/src/main/java/org/apache/commons/text/numbers/package-info.java
@@ -19,6 +19,6 @@
  * Provides algorithms for converting numbers to strings.
  * </p>
  *
- * @since 1.10
+ * @since 1.10.0
  */
 package org.apache.commons.text.numbers;
diff --git a/src/main/java/org/apache/commons/text/similarity/LongestCommonSubsequence.java b/src/main/java/org/apache/commons/text/similarity/LongestCommonSubsequence.java
index 7af2061..4adee47 100644
--- a/src/main/java/org/apache/commons/text/similarity/LongestCommonSubsequence.java
+++ b/src/main/java/org/apache/commons/text/similarity/LongestCommonSubsequence.java
@@ -60,7 +60,7 @@
      * @param left first input sequence.
      * @param right second input sequence.
      * @return last row of the dynamic-programming (DP) table for calculating the LCS of <code>left</code> and <code>right</code>
-     * @since 1.10
+     * @since 1.10.0
      */
     private static int[] algorithmB(final CharSequence left, final CharSequence right) {
         final int m = left.length();
@@ -102,7 +102,7 @@
      * @param left first input sequence.
      * @param right second input sequence.
      * @return the LCS of <code>left</code> and <code>right</code>
-     * @since 1.10
+     * @since 1.10.0
      */
     private static String algorithmC(final CharSequence left, final CharSequence right) {
         final int m = left.length();