diff --git a/packages/lexical-website/docs/concepts/node-state.md b/packages/lexical-website/docs/concepts/node-state.md
index 6199dca75bc..5e46b638da6 100644
--- a/packages/lexical-website/docs/concepts/node-state.md
+++ b/packages/lexical-website/docs/concepts/node-state.md
@@ -95,7 +95,7 @@ const question = $getValue(pollNode, questionState);
 See also
 [$getStateChange](https://lexical.dev/docs/api/modules/lexical#getstatechange)
 if you need an efficient way to determine if the state has changed on two
-versions of the same node (typcially used in updateDOM, but may be useful in
+versions of the same node (typically used in updateDOM, but may be useful in
 an update listener or mutation listener).
 
 ### $setState
diff --git a/packages/lexical-website/docs/concepts/traversals.md b/packages/lexical-website/docs/concepts/traversals.md
index 3ba6502ffc5..14003919ee4 100644
--- a/packages/lexical-website/docs/concepts/traversals.md
+++ b/packages/lexical-website/docs/concepts/traversals.md
@@ -132,7 +132,7 @@ to use
 where the distance metric is signed.
 
 In SDF terms, the subset of the space is `[offset, ∞)`. Any coordinate less
-than the `offset` boundary is a negative distance; otherise the distance is
+than the `offset` boundary is a negative distance; otherwise the distance is
 non-negative.
 
 :::
@@ -401,7 +401,7 @@ refactored to use NodeCaret internally.
 Once this happens, it's possible that the internal structure of PointType
 and/or RangeSelection may change to accommodate NodeCaret, as it is more
 resilient to document changes (only changes that directly affect the
-orgin node will "break" the point). A simple version of this would be to
+origin node will "break" the point). A simple version of this would be to
 create a caret any time that the point changes, and use that caret
 as a fallback if the selection would otherwise be lost.
 
@@ -498,5 +498,5 @@ it is not uncommon to use
 where the distance metric is signed.
 
 In SDF terms, the subset of the space is `[offset, ∞)`. Any coordinate less
-than the `offset` boundary is a negative distance; otherise the distance is
+than the `offset` boundary is a negative distance; otherwise the distance is
 non-negative.
diff --git a/packages/lexical-website/docs/react/plugins.md b/packages/lexical-website/docs/react/plugins.md
index d49b8af0ae3..6f2c0a76817 100644
--- a/packages/lexical-website/docs/react/plugins.md
+++ b/packages/lexical-website/docs/react/plugins.md
@@ -131,7 +131,7 @@ Plugin that allows tab indentation in combination with `@lexical/rich-text`.
 
 ### `LexicalAutoLinkPlugin`
 
-Plugin will convert text into links based on passed matchers list. In example below whenever user types url-like string it will automaticaly convert it into a link node
+Plugin will convert text into links based on passed matchers list. In example below whenever user types url-like string it will automatically convert it into a link node
 
 ```jsx
 const URL_MATCHER =
diff --git a/packages/lexical/src/LexicalNodeState.ts b/packages/lexical/src/LexicalNodeState.ts
index b6fcc334401..cc250e929b2 100644
--- a/packages/lexical/src/LexicalNodeState.ts
+++ b/packages/lexical/src/LexicalNodeState.ts
@@ -179,7 +179,7 @@ export interface StateValueConfig<V> {
 /**
  * Create a StateConfig for the given string key and StateValueConfig.
  *
- * The key must be locally unique. In dev you wil get a key collision error
+ * The key must be locally unique. In dev you will get a key collision error
  * when you use two separate StateConfig on the same node with the same key.
  *
  * The returned StateConfig value should be used with {@link $getState} and
diff --git a/packages/lexical/src/caret/LexicalCaretUtils.ts b/packages/lexical/src/caret/LexicalCaretUtils.ts
index ac5668356db..87a227362aa 100644
--- a/packages/lexical/src/caret/LexicalCaretUtils.ts
+++ b/packages/lexical/src/caret/LexicalCaretUtils.ts
@@ -369,7 +369,7 @@ export function $removeTextFromCaretRange<D extends CaretDirection>(
 }
 
 /**
- * Determine if the two caret orgins are in distinct blocks that
+ * Determine if the two caret origins are in distinct blocks that
  * should be merged.
  *
  * The returned block pair will be the closest blocks to their