Review Comments

The following  minor comments are based on 

http://www.w3.org/2001/sw/DataAccess/rq23/ 1.413

Thanks,
- Souri.

1) In 10.1 [Solution Sequences and Result Forms] mainly:
- In Some potential confusion may arise in readers' minds due to use of 
following terms: Solution Sequence, Set of Solutions, Solution Modifier, 
Solution Sequence Modifier.

Could some minor editing based on the following basics be useful?
- A query pattern generates an unordered collection of solutions.
- DISTINCT makes it a set.
- ORDER BY makes it an ordered collection. In case of duplicate ordering 
key values, the ordering could be partial.
- Projection, LIMIT, and OFFSET would work on any collection (ordered, 
partially ordered, unordered, or set). For LIMIT and OFFSET, working on 
ordered collection makes more sense, so typically would be used with 
ORDER BY.

2) In 10.1 [Solution Sequences and Result Forms]:
- "Projection" section does not explicitly show an example. We could 
refer to one.

3) In 11.2.3.2 [sop:bound]:
- Typo in example1: change OPTIONANL to OPTIONAL

4) In 11.2.3.10 [sop:logical-and]:
- "... Mapping table [17] specifies a which ..." --> Remove the "a"

5) In 5 [Including Optional Values] (before 5.1):
- "... complete structure can not be ..." --> use "cannot"

6) In 2.7 [Blank Nodes]:
- "...although it can not be ..." --> use "cannot"

7) In 8.1 [Accessing Graph Names]:
- The query in the example does not seem complete until we use FROM 
NAMED clauses to specify the set of named graphs that the variable, 
?src, can be bound to. So, proposing inclusion of the following and a 
reference to Section 9 definition of FROM NAMED clause.

  FROM NAMED <http://example.org/foaf/aliceFoaf>
  FROM NAMED <http://example.org/foaf/bobFoaf>