diff --git a/docs/syntax.md b/docs/syntax.md
index a4f1a89..8cb8f36 100644
--- a/docs/syntax.md
+++ b/docs/syntax.md
@@ -140,5 +140,5 @@ functor_record_internal ::=
 
 **Comments**: A symbol `#` occurring outside of a string starts a comment that
 goes to the end of the line. A combination `/*` occurring anywhere outside a string
-starts a comment that goes to the first occurence of `/*`.
+starts a comment that goes to the first occurrence of `/*`.
 
diff --git a/examples/Logica_example_Postgres_Quick_Start.ipynb b/examples/Logica_example_Postgres_Quick_Start.ipynb
index 08e9b9a..8a5df1f 100644
--- a/examples/Logica_example_Postgres_Quick_Start.ipynb
+++ b/examples/Logica_example_Postgres_Quick_Start.ipynb
@@ -44,7 +44,7 @@
         "\n",
         "**Postgres engine is not fully supported** and some functionality can be missing.\n",
         "\n",
-        "Most importantly record composite type and concequently usage of `ArgMax` is limited. However `ArgMax` aggregation should work for predicates defined with\n",
+        "Most importantly record composite type and consequently usage of `ArgMax` is limited. However `ArgMax` aggregation should work for predicates defined with\n",
         "a single rule because Logica in this case gets rid of the record at compile time.\n",
         "\n",
         "You can also implement `ArgMax` with two steps: picking `Max` value and then joining the argument which produced this value, see example below.\n"
diff --git a/lib/closure.l b/lib/closure.l
index 0d0b005..5219b38 100644
--- a/lib/closure.l
+++ b/lib/closure.l
@@ -12,7 +12,7 @@
 # Without recursion in the language we have to unfold recursion into a
 # series of non-recursive steps.
 # TC<N> is running O(2^N) SQL querries and is capturing chains of the
-# lenght up to 2^(2^(N - 1)).
+# length up to 2^(2^(N - 1)).
 
 
 TC0(a, b) distinct :- R(a, b);
diff --git a/parser_py/parse.py b/parser_py/parse.py
index 08aa9cf..c27e2c7 100755
--- a/parser_py/parse.py
+++ b/parser_py/parse.py
@@ -1083,7 +1083,7 @@ def ParseRule(s: HeritageAwareString) -> Dict:
 
 def SplitImport(import_str):
   """Splitting import statement into (path, predicate, synonym)."""
-  # TODO: It's not ideal to rely on percise spaces.
+  # TODO: It's not ideal to rely on precise spaces.
   import_path_synonym = Split(import_str, ' as ')
   if len(import_path_synonym) > 2:
     raise ParsingException('Too many "as":' % import_str,
diff --git a/tutorial/Logica_tutorial.ipynb b/tutorial/Logica_tutorial.ipynb
index a49d269..498a081 100644
--- a/tutorial/Logica_tutorial.ipynb
+++ b/tutorial/Logica_tutorial.ipynb
@@ -2073,7 +2073,7 @@
       "source": [
         "### Expressions\n",
         "\n",
-        "You can use basic operators as in most popular laguages. String concatenation is done via `++`."
+        "You can use basic operators as in most popular languages. String concatenation is done via `++`."
       ]
     },
     {
@@ -49123,7 +49123,7 @@
       "source": [
         "### Injectible and Concrete predicates\n",
         "\n",
-        "A predicate denoted with `distinct` keyword is called _aggregating_. Note that `distinct` can be implict if aggregated value.\n",
+        "A predicate denoted with `distinct` keyword is called _aggregating_. Note that `distinct` can be implicit if aggregated value.\n",
         "\n",
         "```\n",
         "# Example 1 of aggregating predicate.\n",