Skip to content

Commit f606810

Browse files
zazclaude
andcommitted
chore: fix grammar errors across codebase
Fix grammar using Claude Haiku 4.5, then manually correct. Co-Authored-By: Claude Haiku 4.5 <noreply@anthropic.com>
1 parent 6b7e38a commit f606810

10 files changed

Lines changed: 14 additions & 14 deletions

File tree

README.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -36,13 +36,13 @@ Assess how your model compares against state-of-the-art topological neural netwo
3636

3737
---
3838

39-
> 🏆 The **TAG-DS Topological Deep Learning Challenge 2025** has concluded! A huge shotout to all participants. Check out the winners and honorable mentions on [`the challenge website`](https://geometric-intelligence.github.io/topobench/tdl-challenge/index.html).
39+
> 🏆 The **TAG-DS Topological Deep Learning Challenge 2025** has concluded! A huge shout-out to all participants. Check out the winners and honorable mentions on [`the challenge website`](https://geometric-intelligence.github.io/topobench/tdl-challenge/index.html).
4040
4141
---
4242

4343
## :pushpin: Overview
4444

45-
`TopoBench` (TB) is a modular Python library designed to standardize benchmarking and accelerate research in Topological Deep Learning (TDL). In particular, TB allows to train and compare the performances of all sorts of Topological Neural Networks (TNNs) across the different topological domains, where by _topological domain_ we refer to a graph, a simplicial complex, a cellular complex, or a hypergraph. For detailed information, please refer to the [`TopoBench: A Framework for Benchmarking Topological Deep Learning`](https://arxiv.org/pdf/2406.06642) paper.
45+
`TopoBench` (TB) is a modular Python library designed to standardize benchmarking and accelerate research in Topological Deep Learning (TDL). In particular, TB allows training and comparing the performances of all sorts of Topological Neural Networks (TNNs) across the different topological domains, where by _topological domain_ we refer to a graph, a simplicial complex, a cellular complex, or a hypergraph. For detailed information, please refer to the [`TopoBench: A Framework for Benchmarking Topological Deep Learning`](https://arxiv.org/pdf/2406.06642) paper.
4646

4747
<p align="center">
4848
<img src="resources/workflow.jpg" width="700">

docs/index.rst

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -7,7 +7,7 @@
77
:width: 1000px
88

99
`TopoBench` (TB) is a modular Python library designed to standardize benchmarking and accelerate research in Topological Deep Learning (TDL).
10-
In particular, TB allows to train and compare the performances of all sorts of Topological Neural Networks (TNNs) across the different topological domains,
10+
In particular, TB allows training and comparing the performances of all sorts of Topological Neural Networks (TNNs) across the different topological domains,
1111
where by *topological domain* we refer to a graph, a simplicial complex, a cellular complex, or a hypergraph.
1212

1313
.. figure:: https://github.com/geometric-intelligence/TopoBench/raw/main/resources/workflow.jpg
@@ -20,7 +20,7 @@ where by *topological domain* we refer to a graph, a simplicial complex, a cellu
2020

2121
``TopoBench`` (TB) is a modular Python library designed to standardize
2222
benchmarking and accelerate research in Topological Deep Learning (TDL).
23-
In particular, TB allows to train and compare the performances of all
23+
In particular, TB allows training and comparing the performances of all
2424
sorts of Topological Neural Networks (TNNs) across the different
2525
topological domains, where by *topological domain* we refer to a graph,
2626
a simplicial complex, a cellular complex, or a hypergraph. For detailed

test/_utils/flow_mocker.py

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -6,7 +6,7 @@
66
class FlowMocker:
77
"""Flow mocker.
88
9-
Mocker for the flow of the test. It allows to create mock objects and assert them.
9+
Mocker for the flow of the test. It allows creating mock objects and asserting them.
1010
1111
Parameters
1212
----------
@@ -67,7 +67,7 @@ def setup(self):
6767
if mock_alias is not None:
6868
if mock_alias in self.mocks:
6969
raise KeyError(
70-
f"`{mock_alias}` is already exist in mock dictionary"
70+
f"`{mock_alias}` already exists in mock dictionary"
7171
)
7272
self.mocks[mock_alias] = self.mocks[patch_obj]
7373

test/data/dataload/test_Dataloaders.py

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -48,7 +48,7 @@ def test_lift_features(self):
4848
"""Test the collate function.
4949
5050
To test the collate function we use the TBDataloader class to create a dataloader that uses the collate function.
51-
We then first check that the batched data has the expected shape. We then convert the batched data back to a list and check that the data in the list is the same as the original data.
51+
We first check that the batched data has the expected shape. We then convert the batched data back to a list and check that the data in the list is the same as the original data.
5252
"""
5353

5454
def check_shape(batch, elems, key):

test/transforms/liftings/graph2simplicial/test_latentclique_lifting.py

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -68,9 +68,9 @@ def test_lift_topology(self):
6868
edge_prob_single_adj = self.lifting.forward(self.data_test_one.clone()).adjacency_0
6969

7070
### TEST #1 ###
71-
# if edge_prob == 1 and a the input graph has a single clique,
71+
# if edge_prob == 1 and the input graph has a single clique,
7272
# then the 1-skeleton of the inferred latent SC must have a single clique
73-
# (or, equivalently, the SC has a simplex in its facests set if complex_dim = |maximal_clique|-1)
73+
# (or, equivalently, the SC has a simplex in its facets set if complex_dim = |maximal_clique|-1)
7474

7575
# Convert adjacency matrix to NetworkX graph
7676
G_from_latent_complex = nx.from_numpy_matrix(

topobench/data/utils/io_utils.py

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -332,7 +332,7 @@ def read_us_county_demos(path, year=2012, y_col="Election"):
332332

333333
# Get new values for FIPS from current index
334334
# To understand why please print stat.iloc[[516, 517, 518, 519, 520]] for 2012 year
335-
# Basically the FIPS values has been shifted
335+
# Basically the FIPS values have been shifted
336336
stat["FIPS"] = stat.reset_index()["index"]
337337

338338
# Create Election variable

topobench/dataloader/dataloader.py

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -49,7 +49,7 @@ def __init__(
4949
) -> None:
5050
super().__init__()
5151

52-
# this line allows to access init params with 'self.hparams' attribute
52+
# this line allows accessing init params with 'self.hparams' attribute
5353
# also ensures init params will be stored in ckpt
5454
self.save_hyperparameters(
5555
logger=False,

topobench/model/model.py

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -44,7 +44,7 @@ def __init__(
4444
) -> None:
4545
super().__init__()
4646

47-
# This line allows to access init params with 'self.hparams' attribute
47+
# This line allows accessing init params with 'self.hparams' attribute
4848
# also ensures init params will be stored in ckpt
4949
self.save_hyperparameters(
5050
logger=False, ignore=["backbone", "readout", "feature_encoder"]

topobench/transforms/liftings/graph2cell/discrete_configuration_complex_lifting.py

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -20,7 +20,7 @@ class DiscreteConfigurationComplexLifting(Graph2CellLifting):
2020
2121
Lift graphs to cell complexes by generating the k-th discrete configuration complex D_k(G) of the graph. This is a cube complex, which is similar to a simplicial complex except each n-dimensional cell is homeomorphic to a n-dimensional cube rather than an n-dimensional simplex.
2222
23-
The discrete configuration complex of order k consists of all sets of k unique edges or vertices of G, with the additional constraint that if an edge e is in a cell, then neither of the endpoints of e are in the cell. For examples of different graphs and their configuration complexes, see the tutorial.
23+
The discrete configuration complex of order k consists of all sets of k unique edges or vertices of G, with the additional constraint that if an edge e is in a cell, then neither of the endpoints of e is in the cell. For examples of different graphs and their configuration complexes, see the tutorial.
2424
2525
Note that since TopoNetx only supports cell complexes of dimension 2, if you generate a configuration complex of order k > 2 this will only produce the 2-skeleton.
2626

topobench/transforms/liftings/graph2hypergraph/forman_ricci_curvature_lifting.py

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -15,7 +15,7 @@
1515
class HypergraphFormanRicciCurvatureLifting(Graph2HypergraphLifting):
1616
"""Lift graphs to hypergraph domain using Forman-Ricci curvature based backbone estimation.
1717
18-
This lifting identifies a network's structure-preserving, coarse geometry, i.e. its backbones, which lend themselves specifically to model information flows across wide areas of the network via hyperedges. To identify this coarse geometry we apply Forman-Ricci curvature to the original graph. Forman-Ricci curvature defines an edge-based network characteristic that reveals properties of a graph's community structure. In particular high absolute Forman-Ricci curvature exhibits a network's backbone, a coarse, structure preserving graph geometry that forms connections between major communities, most suitable to form hyperedges. In addition, Forman-Ricci curvature was found to be especially useful for network analysis since its intuitive notion allows for efficient computation that scales to large networks sizes.
18+
This lifting identifies a network's structure-preserving, coarse geometry, i.e. its backbones, which lend themselves specifically to model information flows across wide areas of the network via hyperedges. To identify this coarse geometry we apply Forman-Ricci curvature to the original graph. Forman-Ricci curvature defines an edge-based network characteristic that reveals properties of a graph's community structure. In particular high absolute Forman-Ricci curvature exhibits a network's backbone, a coarse, structure preserving graph geometry that forms connections between major communities, most suitable to form hyperedges. In addition, Forman-Ricci curvature was found to be especially useful for network analysis since its intuitive notion allows for efficient computation that scales to large network sizes.
1919
2020
Parameters
2121
----------

0 commit comments

Comments
 (0)