diff --git a/agents.ipynb b/agents.ipynb index 636df75e3..e86f9f6df 100644 --- a/agents.ipynb +++ b/agents.ipynb @@ -96,7 +96,7 @@ "\n", "* `is_done(self)`: Returns true if the objective of the agent and the environment has been completed\n", "\n", - "The next two functions must be implemented by each subclasses of `Environment` for the agent to recieve percepts and execute actions \n", + "The next two functions must be implemented by each subclasses of `Environment` for the agent to receive percepts and execute actions \n", "\n", "* `percept(self, agent)`: Given an agent, this method returns a list of percepts that the agent sees at the current time\n", "\n", diff --git a/knowledge_foil.ipynb b/knowledge_foil.ipynb index c34b0948d..1d433d220 100644 --- a/knowledge_foil.ipynb +++ b/knowledge_foil.ipynb @@ -96,7 +96,7 @@ " $$ FoilGain(L,R) = t \\big( \\log_2{\\frac{p_1}{p_1+n_1}} - \\log_2{\\frac{p_0}{p_0+n_0}} \\big) $$\n", " where: \n", " \n", - " $p_0: \\text{is the number of possitive bindings of rule R } \\\\ n_0: \\text{is the number of negative bindings of R} \\\\ p_1: \\text{is the is the number of possitive bindings of rule R'}\\\\ n_0: \\text{is the number of negative bindings of R'}\\\\ t: \\text{is the number of possitive bindings of rule R that are still covered after adding literal L to R}$\n", + " $p_0: \\text{is the number of positive bindings of rule R } \\\\ n_0: \\text{is the number of negative bindings of R} \\\\ p_1: \\text{is the is the number of positive bindings of rule R'}\\\\ n_0: \\text{is the number of negative bindings of R'}\\\\ t: \\text{is the number of positive bindings of rule R that are still covered after adding literal L to R}$\n", " \n", " - Calculate the extended examples for the chosen literal (function __extend_example()__)
\n", " (the set of examples created by extending example with each possible constant value for each new variable in literal)\n", @@ -286,11 +286,11 @@ "\n", " where: \n", " \n", - " pre_pos = number of possitive bindings of rule R (=current set of rules)\n", + " pre_pos = number of positive bindings of rule R (=current set of rules)\n", " pre_neg = number of negative bindings of rule R \n", - " post_pos = number of possitive bindings of rule R' (= R U {l} )\n", + " post_pos = number of positive bindings of rule R' (= R U {l} )\n", " post_neg = number of negative bindings of rule R' \n", - " T = number of possitive bindings of rule R that are still covered \n", + " T = number of positive bindings of rule R that are still covered \n", " after adding literal l \n", "\n", " """\n", diff --git a/notebooks/chapter22/Parsing.ipynb b/notebooks/chapter22/Parsing.ipynb index 50a4264fb..4d4620fe0 100644 --- a/notebooks/chapter22/Parsing.ipynb +++ b/notebooks/chapter22/Parsing.ipynb @@ -356,7 +356,7 @@ "source": [ "### Example\n", "\n", - "Now let's try \"the wumpus is dead\" example. First we need to define the grammer and words in the sentence." + "Now let's try \"the wumpus is dead\" example. First we need to define the grammar and words in the sentence." ] }, { diff --git a/tests/test_nlp4e.py b/tests/test_nlp4e.py index 2d16a3196..83f142584 100644 --- a/tests/test_nlp4e.py +++ b/tests/test_nlp4e.py @@ -127,12 +127,12 @@ def test_subspan(): def test_text_parsing(): words = ["the", "wumpus", "is", "dead"] - grammer = E0 - assert astar_search_parsing(words, grammer) == 'S' - assert beam_search_parsing(words, grammer) == 'S' + grammar = E0 + assert astar_search_parsing(words, grammar) == 'S' + assert beam_search_parsing(words, grammar) == 'S' words = ["the", "is", "wupus", "dead"] - assert astar_search_parsing(words, grammer) is False - assert beam_search_parsing(words, grammer) is False + assert astar_search_parsing(words, grammar) is False + assert beam_search_parsing(words, grammar) is False if __name__ == '__main__':