Fixed feedback by xdxxxdx

Author: pietercolpaert

01-tree-specification.bs

@@ -137,16 +137,16 @@ Note: Having an identifier for the collection has become mandatory: without it y
 # The member extraction algorithm # {#member-extraction-algorithm}
 
 The member extraction algorithm allows a data publisher to define their members in different ways:
-    1. As in the examples above: all quads with the object of the `tree:member` quads as a subject (and recursively the quads of their blank nodes) are by default included (see also [[!CBD]]), except when they would explicitely not be included in case 3, when the shape would be closed.
+    1. As in the examples above: all quads with the object of the `tree:member` quads as a subject (and recursively the quads of their blank nodes) are by default included (see also [[!CBD]]), except when they would explicitly not be included in case 3, when the shape would be closed.
     2. Out of band / in band:
         - when no quads of a member have been found, the member will be dereferenced. This allows to publish the member on a separate page.
         - part of the member can be maintained elsewhere when a shape is defined (see 3)
     3. By defining a more complex shape with `tree:shape`, also nested entities can be included in the member
     4. By putting the triples in a named graph of the object of `tree:member`, all these triples will be matched. 
 
 Depending on the goals of the client, it MAY implement the member extraction algorithm to fetch all triples about the entity as intended by the server.
-The method used withun TREE is combination of Concise Bounded Descriptions [[!CBD]], named graphs and the topology of a shape (deducted from the `tree:shape`).
-The full algorithm is specificied in the [shape topologies](https://w3id.org/tree/specification/shape-topologies) report.
+The method used within TREE is combination of Concise Bounded Descriptions [[!CBD]], named graphs and the topology of a shape (deducted from the `tree:shape`).
+The full algorithm is specified in the [shape topologies](https://w3id.org/tree/specification/shape-topologies) report.
 
 # Traversing the search tree # {#traversing}
 
@@ -265,7 +265,7 @@ The behaviour of the search form fully depends on the specific property, for whi
 
 Three properties allow to specify a geospatial XYZ tiles template (also known as slippy maps).
  1. `tree:longitudeTile` describes the X value
- 2. `tree:latitudeTile` descrbes the Y value
+ 2. `tree:latitudeTile` describes the Y value
  3. `tree:zoom` describes the zoom level
 
 All properties expect positive integers.

03-discovery-specification.bs

@@ -53,7 +53,7 @@ Issue: Will we document the precise algorithm to use? Should we extend shapes wi
 ## Selecting a collection via a catalog ## {#dcat-catalog}
 
 A DCAT Catalog is an overview of datasets, data services and distributions.
-As TREE clients first need to select a dataset, and then a search tree to use, it aligns wll with how DCAT-AP works.
+As TREE clients first need to select a dataset, and then a search tree to use, it aligns with how DCAT-AP works.
 DCAT discovery extends upon the previous section in which a collection or dataset can be selected based on the `tree:shape` property.
 
 For now, we will assume the DCAT information is available in subject pages.