diff --git a/lucene/analysis/stempel/src/java/overview.html b/lucene/analysis/stempel/src/java/overview.html
index 6f3def6303e..942a86ceed5 100644
--- a/lucene/analysis/stempel/src/java/overview.html
+++ b/lucene/analysis/stempel/src/java/overview.html
@@ -149,7 +149,7 @@ stored as a key and the record of key's transformation to its
 respective stem. The transformation record is termed a patch command
 (P-command). It must be ensured that P-commands are universal, and that
 P-commands can transform any word to its stem. Our solution[6,8] is
-based on the Levenstein metric [10], which produces P-command as the
+based on the Levenshtein metric [10], which produces P-command as the
 minimum cost path in a directed graph.<br>
 <br>
 One can imagine the P-command as an algorithm for an operator (editor)
diff --git a/lucene/suggest/src/test/org/apache/lucene/search/suggest/analyzing/TestFuzzySuggester.java b/lucene/suggest/src/test/org/apache/lucene/search/suggest/analyzing/TestFuzzySuggester.java
index d1a16fce8cc..14e6ba392d3 100644
--- a/lucene/suggest/src/test/org/apache/lucene/search/suggest/analyzing/TestFuzzySuggester.java
+++ b/lucene/suggest/src/test/org/apache/lucene/search/suggest/analyzing/TestFuzzySuggester.java
@@ -1200,7 +1200,7 @@ public class TestFuzzySuggester extends LuceneTestCase {
   // and tweaked to return the edit distance not the float
   // lucene measure
 
-  /* Finds unicode (code point) Levenstein (edit) distance
+  /* Finds unicode (code point) Levenshtein (edit) distance
    * between two strings, including transpositions. */
   public int getDistance(String target, String other, boolean allowTransposition) {
     IntsRef targetPoints;