From 5badb35f300cca73539510344b7e476c922d4851 Mon Sep 17 00:00:00 2001 From: Lilian Besson Date: Sat, 2 Dec 2017 08:40:35 +0100 Subject: [PATCH] =?UTF-8?q?Typo:=20Eng;lish=20=E2=86=92=20English?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Typo: `Eng;lish` → `English` --- ipynb/PropositionalLogic.ipynb | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/ipynb/PropositionalLogic.ipynb b/ipynb/PropositionalLogic.ipynb index 7766464..c6540a6 100644 --- a/ipynb/PropositionalLogic.ipynb +++ b/ipynb/PropositionalLogic.ipynb @@ -129,7 +129,7 @@ "cell_type": "markdown", "metadata": {}, "source": [ - "Now the mechanism to process these rules. The key function is `match_rule`, which matches an English sentence against a rule. The function returns two values, a string representing the translation of the Eng;lish sentence into logic, and `defs`, a dictionary of `{Variable: \"value\"}` pairs. If `match_rule` finds that the rule matches, it recursively calls `match_rules` to match each of the subgroups of the regular expression (the `P` and `Q` in `if {P}, then {Q}`).\n", + "Now the mechanism to process these rules. The key function is `match_rule`, which matches an English sentence against a rule. The function returns two values, a string representing the translation of the English sentence into logic, and `defs`, a dictionary of `{Variable: \"value\"}` pairs. If `match_rule` finds that the rule matches, it recursively calls `match_rules` to match each of the subgroups of the regular expression (the `P` and `Q` in `if {P}, then {Q}`).\n", "The function `match_literal` handles negations, and is where the `defs` dictionary actually gets updated." ] },