(commons-text) 05/16: Javadoc

[ggregory]

This is an automated email from the ASF dual-hosted git repository.

ggregory pushed a commit to branch master
in repository https://gitbox.apache.org/repos/asf/commons-text.git

commit 38a7ae8d751c20e1f4055ebe15a649f003050bcb
Author: Gary D. Gregory <garydgreg...@gmail.com>
AuthorDate: Sun Jul 20 10:00:57 2025 -0400

    Javadoc
---
 .../apache/commons/text/similarity/LevenshteinResults.java | 14 +++++++-------
 1 file changed, 7 insertions(+), 7 deletions(-)

diff --git 
a/src/main/java/org/apache/commons/text/similarity/LevenshteinResults.java 
b/src/main/java/org/apache/commons/text/similarity/LevenshteinResults.java
index 79601907..37b54779 100644
--- a/src/main/java/org/apache/commons/text/similarity/LevenshteinResults.java
+++ b/src/main/java/org/apache/commons/text/similarity/LevenshteinResults.java
@@ -54,9 +54,9 @@ public class LevenshteinResults {
      * Constructs the results for a detailed Levenshtein distance.
      *
      * @param distance distance between two character sequences.
-     * @param insertCount insert character count
-     * @param deleteCount delete character count
-     * @param substituteCount substitute character count
+     * @param insertCount insert character count.
+     * @param deleteCount delete character count.
+     * @param substituteCount substitute character count.
      */
     public LevenshteinResults(final Integer distance, final Integer 
insertCount, final Integer deleteCount,
             final Integer substituteCount) {
@@ -83,7 +83,7 @@ public class LevenshteinResults {
     /**
      * Gets the number of character deletion needed to change one character 
sequence to other.
      *
-     * @return delete character count
+     * @return delete character count.
      */
     public Integer getDeleteCount() {
         return deleteCount;
@@ -92,7 +92,7 @@ public class LevenshteinResults {
     /**
      * Gets the distance between two character sequences.
      *
-     * @return distance between two character sequence
+     * @return distance between two character sequence.
      */
     public Integer getDistance() {
         return distance;
@@ -101,7 +101,7 @@ public class LevenshteinResults {
     /**
      * Gets the number of insertion needed to change one character sequence 
into another.
      *
-     * @return insert character count
+     * @return insert character count.
      */
     public Integer getInsertCount() {
         return insertCount;
@@ -110,7 +110,7 @@ public class LevenshteinResults {
     /**
      * Gets the number of character substitution needed to change one 
character sequence into another.
      *
-     * @return substitute character count
+     * @return substitute character count.
      */
     public Integer getSubstituteCount() {
         return substituteCount;