@@ -302,7 +302,7 @@ EXPLAIN SELECT * FROM pgbench_accounts WHERE filler LIKE '%x%';
302302 scan</emphasis>, the cooperating processes take turns reading data from the
303303 index. Currently, parallel index scans are supported only for
304304 btree indexes. Each process will claim a single index block and will
305- scan and return all tuples referenced by that block; otherprocess can
305+ scan and return all tuples referenced by that block; otherprocesses can
306306 at the same time be returning tuples from a different index block.
307307 The results of a parallel btree scan are returned in sorted order
308308 within each worker process.
@@ -435,7 +435,7 @@ EXPLAIN SELECT * FROM pgbench_accounts WHERE filler LIKE '%x%';
435435 involve appending multiple results sets can therefore achieve
436436 coarse-grained parallelism even when efficient partial plans are not
437437 available. For example, consider a query against a partitioned table
438- which canbe only be implemented efficiently by using an index that does
438+ which can only be implemented efficiently by using an index that does
439439 not support parallel scans. The planner might choose a <literal>Parallel
440440 Append</literal> of regular <literal>Index Scan</literal> plans; each
441441 individual index scan would have to be executed to completion by a single
