Documentation spell checking and markup improvements

doc/src/sgml/func.sgml

@@ -9737,10 +9737,10 @@ CREATE TYPE rainbow AS ENUM ('red', 'orange', 'yellow', 'green', 'blue', 'purple
         <entry>
           reduce each value in the document, specified by <replaceable class="parameter">filter</replaceable> to a <type>tsvector</type>,
           and then concatenate those in document order to produce a single <type>tsvector</type>.
-          <replaceable class="parameter">filter</replaceable> is a jsonb array, that enumerates what kind of elements need to be included
+          <replaceable class="parameter">filter</replaceable> is a <type>jsonb</type> array, that enumerates what kind of elements need to be included
           into the resulting <type>tsvector</type>. Possible values for <replaceable class="parameter">filter</replaceable> are
           <literal>"string"</literal> (to include all string values), <literal>"numeric"</literal> (to include all numeric values in the string format),
-          <literal>"boolean"</literal> (to include all boolean values in the string format "true"/"false"),
+          <literal>"boolean"</literal> (to include all Boolean values in the string format <literal>"true"</literal>/<literal>"false"</literal>),
           <literal>"key"</literal> (to include all keys) or <literal>"all"</literal> (to include all above). These values
           can be combined together to include, e.g. all string and numeric values.
         </entry>

doc/src/sgml/jit.sgml

@@ -110,18 +110,18 @@
   </para>
 
   <para>
-   The cost of the query will be compared with <xref
-   linkend="guc-jit-above-cost"/> GUC. If the cost is higher,
+   The cost of the query will be compared with the setting of <xref
+   linkend="guc-jit-above-cost"/>. If the cost is higher,
    <acronym>JIT</acronym> compilation will be performed.
   </para>
 
   <para>
    If the planner, based on the above criterion, decided that
    <acronym>JIT</acronym> compilation is beneficial, two further decisions are
-   made. Firstly, if the query is more costly than the <xref
-   linkend="guc-jit-optimize-above-cost"/> GUC, expensive optimizations are
+   made. Firstly, if the query is more costly than the setting of <xref
+   linkend="guc-jit-optimize-above-cost"/>, expensive optimizations are
    used to improve the generated code. Secondly, if the query is more costly
-   than the <xref linkend="guc-jit-inline-above-cost"/> GUC, short functions
+   than the setting of <xref linkend="guc-jit-inline-above-cost"/>, short functions
    and operators used in the query will be inlined.  Both of these operations
    increase the <acronym>JIT</acronym> overhead, but can reduce query
    execution time considerably.
@@ -131,7 +131,7 @@
    This cost based decision will be made at plan time, not execution
    time. This means that when prepared statements are in use, and the generic
    plan is used (see <xref linkend="sql-prepare-notes"/>), the values of the
-   GUCs set at prepare time take effect, not the settings at execution time.
+   configuration parameters set at prepare time take effect, not the settings at execution time.
   </para>
 
   <note>
@@ -208,7 +208,7 @@ SET
   </para>
 
   <para>
-   For development and debugging purposes a few additional GUCs exist. <xref
+   For development and debugging purposes a few additional configuration parameters exist. <xref
    linkend="guc-jit-dump-bitcode"/> allows the generated bitcode to be
    inspected. <xref linkend="guc-jit-debugging-support"/> allows GDB to see
    generated functions. <xref linkend="guc-jit-profiling-support"/> emits
@@ -264,8 +264,8 @@ SET
     <productname>PostgreSQL</productname> provides a <acronym>JIT</acronym>
     implementation based on <productname>LLVM</productname>.  The interface to
     the <acronym>JIT</acronym> provider is pluggable and the provider can be
-    changed without recompiling. The provider is chosen via the <xref
-    linkend="guc-jit-provider"/> <acronym>GUC</acronym>.
+    changed without recompiling. The provider is chosen via the setting <xref
+    linkend="guc-jit-provider"/>.
    </para>
 
    <sect3>

doc/src/sgml/ref/pgbench.sgml

@@ -511,7 +511,7 @@ pgbench <optional> <replaceable>options</replaceable> </optional> <replaceable>d
       <listitem>
        <para>
         Show progress report every <replaceable>sec</replaceable> seconds.  The report
-        includes the time since the beginning of the run, the tps since the
+        includes the time since the beginning of the run, the TPS since the
         last report, and the transaction latency average and standard
         deviation since the last report.  Under throttling (<option>-R</option>),
         the latency is computed with respect to the transaction scheduled
@@ -727,9 +727,9 @@ pgbench <optional> <replaceable>options</replaceable> </optional> <replaceable>d
        </para>
        <para>
         Remember to take the sampling rate into account when processing the
-        log file. For example, when computing tps values, you need to multiply
+        log file. For example, when computing TPS values, you need to multiply
         the numbers accordingly (e.g. with 0.01 sample rate, you'll only get
-        1/100 of the actual tps).
+        1/100 of the actual TPS).
        </para>
       </listitem>
      </varlistentry>
@@ -967,7 +967,7 @@ pgbench <optional> <replaceable>options</replaceable> </optional> <replaceable>d
       Sets variable <replaceable>varname</replaceable> to a value calculated
       from <replaceable>expression</replaceable>.
       The expression may contain the <literal>NULL</literal> constant,
-      boolean constants <literal>TRUE</literal> and <literal>FALSE</literal>,
+      Boolean constants <literal>TRUE</literal> and <literal>FALSE</literal>,
       integer constants such as <literal>5432</literal>,
       double constants such as <literal>3.14159</literal>,
       references to variables <literal>:</literal><replaceable>variablename</replaceable>,
@@ -1485,7 +1485,7 @@ f(x) = PHI(2.0 * parameter * (x - mu) / (max - min + 1)) /
     </listitem>
     <listitem>
      <para>
-      <literal>random_zipfian</literal> generates an approximated bounded zipfian
+      <literal>random_zipfian</literal> generates an approximated bounded Zipfian
       distribution. For <replaceable>parameter</replaceable> in (0, 1), an
       approximated algorithm is taken from
       "Quickly Generating Billion-Record Synthetic Databases",

doc/src/sgml/ref/psql-ref.sgml

@@ -558,7 +558,7 @@ EOF
       <listitem>
       <para>
       Set the field separator for unaligned output to a zero byte.  This is
-      equvalent to <command>\pset fieldsep_zero</command>.
+      equivalent to <command>\pset fieldsep_zero</command>.
       </para>
       </listitem>
     </varlistentry>

doc/src/sgml/release-11.sgml

@@ -1233,7 +1233,7 @@ same commits as above
        </para>
 
        <para>
-        Specifically, "ldapsearchfilter" allows pattern matching using
+        Specifically, <literal>ldapsearchfilter</literal> allows pattern matching using
         combinations of <acronym>LDAP</acronym> attributes.
        </para>
       </listitem>
@@ -2673,7 +2673,7 @@ same commits as above
 -->
 
        <para>
-        Speed up lookups of builtin function names matching oids (Andres
+        Speed up lookups of built-in function names matching OIDs (Andres
         Freund)
        </para>