From b8388d374262ccdf8cff67bba1b6ee9d72092bbc Mon Sep 17 00:00:00 2001 From: Pietro Monticone <38562595+pitmonticone@users.noreply.github.com> Date: Wed, 17 Jan 2024 22:06:14 +0100 Subject: [PATCH 1/4] Update alphageometry.py --- alphageometry.py | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/alphageometry.py b/alphageometry.py index 06e4904..03835fa 100644 --- a/alphageometry.py +++ b/alphageometry.py @@ -308,7 +308,7 @@ def translate_constrained_to_constructive( def check_valid_args(name: str, args: list[str]) -> bool: - """Check whether a predicate is grammarically correct. + """Check whether a predicate is grammatically correct. Args: name: str: name of the predicate @@ -441,7 +441,7 @@ def insert_aux_to_premise(pstring: str, auxstring: str) -> str: Args: pstring: str: describing the problem to solve. - auxstring: str: describing the auxiliar construction. + auxstring: str: describing the auxiliary construction. Returns: str: new pstring with auxstring inserted before the conclusion. From f5409da7dae8cf63256ffcc605d84803a46388f2 Mon Sep 17 00:00:00 2001 From: Pietro Monticone <38562595+pitmonticone@users.noreply.github.com> Date: Wed, 17 Jan 2024 22:06:16 +0100 Subject: [PATCH 2/4] Update ar_test.py --- ar_test.py | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/ar_test.py b/ar_test.py index df68e90..4c7f331 100644 --- a/ar_test.py +++ b/ar_test.py @@ -191,7 +191,7 @@ def test_incenter_excenter_touchpoints(self): # Now we check whether tb has figured out that # distance(b, d1) == distance(e1, c) - # linear comb exprssion of each variables: + # linear comb expression of each variables: b = tb.v2e['bc:b'] c = tb.v2e['bc:c'] d1 = tb.v2e['bc:d1'] From 4513d21f162694b4b1ce57b5b26981086ee17180 Mon Sep 17 00:00:00 2001 From: Pietro Monticone <38562595+pitmonticone@users.noreply.github.com> Date: Wed, 17 Jan 2024 22:06:18 +0100 Subject: [PATCH 3/4] Update beam_search.py --- beam_search.py | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/beam_search.py b/beam_search.py index a11c81c..62fd9ec 100644 --- a/beam_search.py +++ b/beam_search.py @@ -16,7 +16,7 @@ """Fast decoding routines for inference from a trained model. Modified https://github.com/google/flax/blob/main/examples/wmt/decode.py -to acommodate +to accommodate (a) continued decoding from a previous beam cache. (b) init with with a single beam and then expand into beam_size beams. @@ -235,7 +235,7 @@ def beam_search_flat( ): """Beam search for LM. - inputs and cache is already flat! i.e. first dimention == batch*beam. + inputs and cache is already flat! i.e. first dimension == batch*beam. Args: seed_token: array: [beam_size, 1] int32 sequence of tokens. From 38d873944d7c4d6f5b419916ed2fec1a5ef89385 Mon Sep 17 00:00:00 2001 From: Pietro Monticone <38562595+pitmonticone@users.noreply.github.com> Date: Wed, 17 Jan 2024 22:06:20 +0100 Subject: [PATCH 4/4] Update graph.py --- graph.py | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/graph.py b/graph.py index ddadb4a..7c565a1 100644 --- a/graph.py +++ b/graph.py @@ -2060,7 +2060,7 @@ def _get_or_create_ratio( def _get_or_create_ratio_l( self, l1: Length, l2: Length, deps: Dependency ) -> tuple[Ratio, Ratio, list[Dependency]]: - """Get or create a new Ratio from two Lenghts l1 and l2.""" + """Get or create a new Ratio from two Lengths l1 and l2.""" for r in self.type2nodes[Ratio]: if r.lengths == (l1.rep(), l2.rep()): l1_, l2_ = r._l @@ -2736,7 +2736,7 @@ def all_eqangle_same_lines(self) -> Generator[tuple[Point, ...], None, None]: def all_eqangles_distinct_linepairss( self, ) -> Generator[tuple[Line, ...], None, None]: - """No eqangles betcause para-para, or para-corresponding, or same.""" + """No eqangles because para-para, or para-corresponding, or same.""" for measure in self.type2nodes[Measure]: angs = measure.neighbors(Angle)