--- a/doc/interpreter/arith.txi	Fri Feb 20 12:30:39 2009 +0100
+++ b/doc/interpreter/arith.txi	Fri Feb 20 11:17:01 2009 -0500
@@ -20,7 +20,7 @@
 @chapter Arithmetic
 
 Unless otherwise noted, all of the functions described in this chapter
-will work for real and complex scalar or matrix arguments.
+will work for real and complex scalar or matrix arguments. Functions described as @dfn{mapping functions} apply the given operation to each element when given a matrix argument.
 
 @menu
 * Utility Functions::           

--- a/doc/interpreter/container.txi	Fri Feb 20 12:30:39 2009 +0100
+++ b/doc/interpreter/container.txi	Fri Feb 20 11:17:01 2009 -0500
@@ -532,7 +532,7 @@
 to create a cell array and then fill it with data.
 
 The @code{cell} function returns a cell array of a given size, containing
-empty matrices. This function works very similar to the @code{zeros}
+empty matrices. This function is similar to the @code{zeros}
 function for creating new numerical arrays. The following example creates
 a 2-by-2 cell array containing empty matrices
 
@@ -660,7 +660,7 @@
          @}
 @end example
 
-One further advantage of using cell arrays to store multiple strings, is
+One further advantage of using cell arrays to store multiple strings is
 that most functions for string manipulations included with Octave
 support this representation. As an example, it is possible to compare
 one string with many others using the @code{strcmp} function. If one of
@@ -691,9 +691,9 @@
 @subsection Processing Data in Cell Arrays
 
 Data that is stored in a cell array can be processed in several ways
-depending on the actual data. The most simple way to process that data
+depending on the actual data. The simplest way to process that data
 is to iterate through it using one or more @code{for} loops. The same
-idea can be implemented easier through the use of the @code{cellfun}
+idea can be implemented more easily through the use of the @code{cellfun}
 function that calls a user-specified function on all elements of a cell
 array.
 
@@ -765,7 +765,7 @@
 Just like it is possible to create a numerical array from selected
 elements of a cell array, it is possible to create a new cell array
 containing the selected elements. By surrounding the list with 
-@samp{@{} and @samp{@}} a new cell array will be created, like the
+@samp{@{} and @samp{@}} a new cell array will be created, as the
 following example illustrates
 
 @example

--- a/doc/interpreter/debug.txi	Fri Feb 20 12:30:39 2009 +0100
+++ b/doc/interpreter/debug.txi	Fri Feb 20 11:17:01 2009 -0500
@@ -41,7 +41,7 @@
 @section Entering Debug Mode
 
 There are two basic means of interrupting the execution of an Octave
-script. These are breakpoints @ref{Breakpoints}, discussed in the next
+script. These are breakpoints @pxref{Breakpoints}, discussed in the next
 section and interruption based on some condition.
 
 Octave supports three means to stop execution based on the values set in
@@ -57,7 +57,7 @@
 @node Leaving Debug Mode
 @section Leavinging Debug Mode
 
-To leave the debug mode, you should simply type either @code{dbcont} 
+To leave the debug mode, use either @code{dbcont} 
 or @code{return}.
 
 @DOCSTRING(dbcont)
@@ -107,8 +107,7 @@
 @DOCSTRING(dbclear)
 
 @noindent
-To clear all of the breakpoints in a function the recommended means,
-following the above example, is then
+These functions can be used to clear all the breakpoints in a function.  For example,
 
 @example
 dbclear ("asind", dbstatus ("asind"));
@@ -140,7 +139,7 @@
 Note that @code{filemarker} returns a character that marks the
 subfunctions from the file containing them.
 
-Another simple means of setting a breakpoint in an Octave script is the
+Another simple way of setting a breakpoint in an Octave script is the
 use of the @code{keyboard} function.
 
 @DOCSTRING(keyboard)
@@ -167,7 +166,7 @@
 
 @DOCSTRING(isdebugmode)
 
-Debug mode equally allows single line stepping through a function using
+Debug mode also allows single line stepping through a function using
 the commands @code{dbstep}.
 
 @DOCSTRING(dbstep)

--- a/doc/interpreter/diffeq.txi	Fri Feb 20 12:30:39 2009 +0100
+++ b/doc/interpreter/diffeq.txi	Fri Feb 20 11:17:01 2009 -0500
@@ -21,7 +21,7 @@
 
 Octave has built-in functions for solving ordinary differential equations,
 and differential-algebraic equations.
-All solvers are based on reliable ODE solvers written in Fortran.
+All solvers are based on reliable ODE routines written in Fortran.
 
 @menu
 * Ordinary Differential Equations::  

--- a/doc/interpreter/dynamic.txi	Fri Feb 20 12:30:39 2009 +0100
+++ b/doc/interpreter/dynamic.txi	Fri Feb 20 11:17:01 2009 -0500
@@ -37,7 +37,7 @@
 
 Octave has the possibility of including compiled code as dynamically
 linked extensions and then using these extensions as if they were part
-of Octave itself.  Octave has the option of directly calling C++ code
+of Octave itself.  Octave can call C++ code
 through its native oct-file interface or C code through its mex
 interface.  It can also indirectly call functions written in any other
 language through a simple wrapper.  The reasons to write code in a
@@ -58,7 +58,7 @@
 doesn't just make it concise, it generally significantly improves its
 performance.  Above all, if loops must be used, make sure that the
 allocation of space for variables takes place outside the loops using an
-assignment to a like matrix or zeros.
+assignment to a matrix of the right size, or zeros.
 @item
 Does it make as much use as possible of existing built-in library
 routines?  These are highly optimized and many do not carry the overhead
@@ -147,7 +147,7 @@
 mkoctfile helloworld.cc
 @end example
 
-This will create a file call helloworld.oct, that is the compiled
+This will create a file called @file{helloworld.oct}, that is the compiled
 version of the function.  It should be noted that it is perfectly
 acceptable to have more than one @code{DEFUN_DLD} function in a source
 file.  However, there must either be a symbolic link to the oct-file for

--- a/doc/interpreter/eval.txi	Fri Feb 20 12:30:39 2009 +0100
+++ b/doc/interpreter/eval.txi	Fri Feb 20 11:17:01 2009 -0500
@@ -123,7 +123,7 @@
 endfunction
 @end example
 
-With @code{evalin}, you could write save as follows:
+With @code{evalin}, you could write @code{save} as follows:
 
 @example
 function save (file, name1, name2)

--- a/doc/interpreter/func.txi	Fri Feb 20 12:30:39 2009 +0100
+++ b/doc/interpreter/func.txi	Fri Feb 20 11:17:01 2009 -0500
@@ -635,7 +635,7 @@
 @node Manipulating the load path
 @subsection Manipulating the load path
 
-When a function is called Octave searches a list of directories for
+When a function is called, Octave searches a list of directories for
 a file that contains the function declaration. This list of directories
 is known as the load path. By default the load path contains
 a list of directories distributed with Octave plus the current
@@ -775,7 +775,7 @@
 
 However, there is at least one well known operating system that doesn't
 support symbolic links. Making copies of the original file for each of
-the functions is also possible, but is undesirable as it multiples the
+the functions is undesirable as it increases the
 amount of disk space used by Octave. Instead Octave supplies the
 @code{autoload} function, that permits the user to define in which
 file a certain function will be found.
@@ -815,7 +815,7 @@
 @end example
 
 A common use of @code{mlock} is to prevent persistent variables from
-being removed from memory, as the following example shows.
+being removed from memory, as the following example shows:
 
 @example
 @group

--- a/doc/interpreter/interp.txi	Fri Feb 20 12:30:39 2009 +0100
+++ b/doc/interpreter/interp.txi	Fri Feb 20 11:17:01 2009 -0500
@@ -113,6 +113,7 @@
 @end group
 @end example
 
+@noindent
 @ifinfo
 which demonstrates the poor behavior of Fourier interpolation for non-periodic functions.
 @end ifinfo

--- a/doc/interpreter/io.txi	Fri Feb 20 12:30:39 2009 +0100
+++ b/doc/interpreter/io.txi	Fri Feb 20 11:17:01 2009 -0500
@@ -20,7 +20,7 @@
 @chapter Input and Output
 
 Octave supports several ways of reading and writing data to or from the
-prompt or a file.  The most simple functions for data Input and Output
+prompt or a file.  The simplest functions for data Input and Output
 (I/O) are easy to use, but only provides limited control of how
 data is processed.  For more control, a set of functions modelled
 after the C standard library are also provided by Octave.
@@ -181,7 +181,7 @@
 
 @DOCSTRING(native_float_format)
 
-It is possible to write data to a file in a way much similar to the
+It is possible to write data to a file in a similar way to the
 @code{disp} function for writing data to the screen.  The @code{fdisp}
 works just like @code{disp} except its first argument is a file pointer
 as created by @code{fopen}.  As an example, the following code writes

--- a/doc/interpreter/nonlin.txi	Fri Feb 20 12:30:39 2009 +0100
+++ b/doc/interpreter/nonlin.txi	Fri Feb 20 11:17:01 2009 -0500
@@ -128,7 +128,7 @@
                -4 x_1 x_2                     \cr }\right]
 $$
 @end tex
-which is computed with the following Octave function
+and compute it with the following Octave function
 @end iftex
 
 @example
@@ -141,7 +141,7 @@
 @end example
 
 @noindent
-Using this Jacobian is done with the following code
+The Jacobian can then be used with the following call to @code{fsolve}:
 
 @example
 [x, fval, info] = fsolve (@{@@f, @@jacobian@}, [1; 2]);

--- a/doc/interpreter/numbers.txi	Fri Feb 20 12:30:39 2009 +0100
+++ b/doc/interpreter/numbers.txi	Fri Feb 20 11:17:01 2009 -0500
@@ -514,7 +514,7 @@
 then re-casting the values back to the original integer type. As the
 double precision type of Octave is only capable of representing integers
 with up to 53 bits of precision, it is not possible to perform
-arithmetic of the 64 bit integer types.
+arithmetic with 64 bit integer types.
 
 When doing integer arithmetic one should consider the possibility of
 underflow and overflow. This happens when the result of the computation
@@ -566,7 +566,7 @@
 @code{10}, it is treated as the bits @code{[1, 0, 1, 0]} rather than the
 bits of the native floating point format representation of @code{10}.
 
-As the maximum number that can be represented by a number is important
+As the maximum value that can be represented by a number is important
 for bit manipulation, particularly when forming masks, Octave supplies
 the function @code{bitmax}.
 
@@ -622,7 +622,7 @@
 
 The basic logical operations are @code{&}, @code{|}, and @code{!},
 which correspond to ``Logical And'', ``Logical Or'', and ``Logical
-Negation''. These operations all follow the rules of logic.
+Negation''. These operations all follow the usual rules of logic.
 
 It is also possible to use logical values as part of standard numerical
 calculations. In this case @code{true} is converted to @code{1}, and
@@ -645,7 +645,7 @@
 Instead of creating the @code{idx} array it is possible to replace
 @code{data(idx)} with @code{data( data <= 2 )} in the above code.
 
-Besides when doing comparisons, logical values can be constructed by
+Logical values can also be constructed by
 casting numeric objects to logical values, or by using the @code{true}
 or @code{false} functions.
 

--- a/doc/interpreter/optim.txi	Fri Feb 20 12:30:39 2009 +0100
+++ b/doc/interpreter/optim.txi	Fri Feb 20 11:17:01 2009 -0500
@@ -127,7 +127,7 @@
 @ifnottex
 @math{y = x*b}
 @end ifnottex
-fits data @math{(x,y)} as good as possible, assuming zero-mean
+fits data @math{(x,y)} as well as possible, assuming zero-mean
 Gaussian noise.  If the noise is assumed to be isotropic the problem
 can be solved using the @samp{\} or @samp{/} operators, or the @code{ols}
 function.  In the general case where the noise is assumed to be anisotropic

--- a/doc/interpreter/package.txi	Fri Feb 20 12:30:39 2009 +0100
+++ b/doc/interpreter/package.txi	Fri Feb 20 11:17:01 2009 -0500
@@ -41,7 +41,7 @@
 @section Installing and Removing Packages
 
 Assuming a package is available in the file @code{image-1.0.0.tar.gz}
-it can be installed from the Octave prompt by writing
+it can be installed from the Octave prompt with the command
 
 @example
 pkg install image-1.0.0.tar.gz

--- a/doc/interpreter/poly.txi	Fri Feb 20 12:30:39 2009 +0100
+++ b/doc/interpreter/poly.txi	Fri Feb 20 11:17:01 2009 -0500
@@ -51,7 +51,7 @@
 @section Evaluating Polynomials
 
 The value of a polynomial represented by the vector @var{c} can be evaluated
-at the point @var{x} very easily, as the following example shows.
+at the point @var{x} very easily, as the following example shows:
 
 @example
 N = length(c)-1;

--- a/doc/interpreter/set.txi	Fri Feb 20 12:30:39 2009 +0100
+++ b/doc/interpreter/set.txi	Fri Feb 20 11:17:01 2009 -0500
@@ -19,7 +19,7 @@
 @node Sets
 @chapter Sets
 
-Octave has a limited set of functions for managing sets of data, where a
+Octave has a limited number of functions for managing sets of data, where a
 set is defined as a collection of unique elements.  In Octave a set is
 represented as a vector of numbers.
 

--- a/doc/interpreter/signal.txi	Fri Feb 20 12:30:39 2009 +0100
+++ b/doc/interpreter/signal.txi	Fri Feb 20 11:17:01 2009 -0500
@@ -19,6 +19,14 @@
 @node Signal Processing
 @chapter Signal Processing
 
+
+This chapter describes the signal processing and fast fourier
+transform functions available in Octave.  Fast fourier transforms are
+computed with the @sc{fftw} or @sc{Fftpack} libraries depending on how
+Octave is built.
+ 
+
+
 @DOCSTRING(detrend)
 
 @DOCSTRING(fft)

--- a/doc/interpreter/sparse.txi	Fri Feb 20 12:30:39 2009 +0100
+++ b/doc/interpreter/sparse.txi	Fri Feb 20 11:17:01 2009 -0500
@@ -299,7 +299,7 @@
 
 The above problem of memory reallocation can be avoided in
 oct-files. However, the construction of a sparse matrix from an oct-file
-is more complex than can be discussed in this brief introduction, and
+is more complex than can be discussed here, and
 you are referred to chapter @ref{Dynamically Linked Functions}, to have
 a full description of the techniques involved.
 
@@ -626,7 +626,7 @@
 the reordering functions @dfn{colperm} and @dfn{randperm} are
 also available.
 
-@xref{fig:simplematrix}, for an example of the structure of a simple 
+@xref{fig:simplematrix} for an example of the structure of a simple 
 positive definite matrix.
 
 @float Figure,fig:simplematrix

--- a/doc/interpreter/stats.txi	Fri Feb 20 12:30:39 2009 +0100
+++ b/doc/interpreter/stats.txi	Fri Feb 20 11:17:01 2009 -0500
@@ -39,7 +39,7 @@
 While this is the default data arrangement, most functions support
 different arrangements.
 
-It should be noted that the statistics functions don't handle data
+It should be noted that the statistics functions don't test for data
 containing NaN, NA, or Inf.  Such values need to be handled explicitly.
 
 @menu
@@ -136,7 +136,7 @@
 (PP-Plots).  These are simple graphical tests for determining if a
 data set comes from a certain distribution.
 
-It is worth noticing that Octave can also show histograms of data
+Note that Octave can also show histograms of data
 using the @code{hist} function as described in
 @ref{Two-Dimensional Plots}.
 

--- a/doc/interpreter/strings.txi	Fri Feb 20 12:30:39 2009 +0100
+++ b/doc/interpreter/strings.txi	Fri Feb 20 11:17:01 2009 -0500
@@ -365,8 +365,8 @@
 @node Comparing Strings
 @section Comparing Strings
 
-Since a string is a character array comparison between strings works
-element by element as the following example shows.
+Since a string is a character array, comparisons between strings work
+element by element as the following example shows:
 
 @example
 GNU = "GNU's Not UNIX";

--- a/doc/interpreter/tips.txi	Fri Feb 20 12:30:39 2009 +0100
+++ b/doc/interpreter/tips.txi	Fri Feb 20 11:17:01 2009 -0500
@@ -484,7 +484,7 @@
 page boundary, while the @code{@@result@{@}} macro produces a right
 arrow signifying the result of a command. 
 
-In many cases a function has multiple means in which it can be called,
+In many cases a function has multiple ways in which it can be called,
 and the @code{@@deftypefnx} macro can be used to give alternatives. For
 example
 

--- a/scripts/general/bicubic.m	Fri Feb 20 12:30:39 2009 +0100
+++ b/scripts/general/bicubic.m	Fri Feb 20 11:17:01 2009 -0500
@@ -22,7 +22,8 @@
 ## Return a matrix @var{zi} corresponding to the bicubic
 ## interpolations at @var{xi} and @var{yi} of the data supplied
 ## as @var{x}, @var{y} and @var{z}. Points outside the grid are set
-## to @var{extrapval}
+## to @var{extrapval}.
+
 ##
 ## See @url{http://wiki.woodpecker.org.cn/moin/Octave/Bicubic}
 ## for further information.

--- a/scripts/general/interp2.m	Fri Feb 20 12:30:39 2009 +0100
+++ b/scripts/general/interp2.m	Fri Feb 20 11:17:01 2009 -0500
@@ -49,7 +49,7 @@
 ## @end table
 ##
 ## The variable @var{method} defines the method to use for the
-## interpolation. It can take one of the values
+## interpolation. It can take one of the following values 
 ##
 ## @table @asis
 ## @item 'nearest'

--- a/scripts/general/structfun.m	Fri Feb 20 12:30:39 2009 +0100
+++ b/scripts/general/structfun.m	Fri Feb 20 11:17:01 2009 -0500
@@ -33,7 +33,7 @@
 ## a string value. If the function returns more than one argument, they are
 ## returned as separate output variables.
 ##
-## If the param "UniformOutput" is set to true (the default), then the function
+## If the parameter "UniformOutput" is set to true (the default), then the function
 ## must return a single element which will be concatenated into the
 ## return value. If "UniformOutput" is false, the outputs placed in a structure
 ## with the same fieldnames as the input structure.

--- a/scripts/polynomial/spline.m	Fri Feb 20 12:30:39 2009 +0100
+++ b/scripts/polynomial/spline.m	Fri Feb 20 11:17:01 2009 -0500
@@ -50,7 +50,7 @@
 ## or
 ## @iftex
 ## @tex
-## $$[s_1, s_2, \cdots, s_k, n + 2]$$.
+## $$[s_1, s_2, \cdots, s_k, n + 2].$$
 ## @end tex
 ## @end iftex
 ## @ifnottex

--- a/src/DLD-FUNCTIONS/cellfun.cc	Fri Feb 20 12:30:39 2009 +0100
+++ b/src/DLD-FUNCTIONS/cellfun.cc	Fri Feb 20 11:17:01 2009 -0500
@@ -91,7 +91,7 @@
 Note that the default output argument is an array of the same size as the\n\
 input arguments.\n\
 \n\
-If the param 'UniformOutput' is set to true (the default), then the function\n\
+If the parameter 'UniformOutput' is set to true (the default), then the function\n\
 must return a single element which will be concatenated into the\n\
 return value. If 'UniformOutput' is false, the outputs are concatenated in\n\
 a cell array. For example\n\

--- a/src/DLD-FUNCTIONS/rand.cc	Fri Feb 20 12:30:39 2009 +0100
+++ b/src/DLD-FUNCTIONS/rand.cc	Fri Feb 20 11:17:01 2009 -0500
@@ -866,7 +866,7 @@
 @deftypefnx {Loadable Function} {} randp (@var{l}, @var{n}, @var{m})\n\
 @deftypefnx {Loadable Function} {} randp (\"state\", @var{x})\n\
 @deftypefnx {Loadable Function} {} randp (\"seed\", @var{x})\n\
-Return a matrix with Poisson distributed random elements. The arguments\n\
+Return a matrix with Poisson distributed random elements with mean value parameter given by the first argument, @var{l}. The arguments\n\
 are handled the same as the arguments for @code{rand}, except for the\n\
 argument @var{l}.\n\
 \n\

--- a/src/DLD-FUNCTIONS/spparms.cc	Fri Feb 20 12:30:39 2009 +0100
+++ b/src/DLD-FUNCTIONS/spparms.cc	Fri Feb 20 11:17:01 2009 -0500
@@ -47,9 +47,9 @@
 functions. The first four calls above get information about the current\n\
 settings, while the others change the current settings. The parameters are\n\
 stored as pairs of keys and values, where the values are all floats and the\n\
-keys are one of the strings\n\
+keys are one of the following strings:\n\
 \n\
-@itemize\n\
+@table @code\n\
 @item spumoni\n\
 Printing level of debugging information of the solvers (default 0)\n\
 @item ths_rel\n\
@@ -80,7 +80,7 @@
 @item umfpack\n\
 Flag whether the UMFPACK or mmd solvers are used for the LU, '\\' and\n\
 '/' operations (default 1)\n\
-@end itemize\n\
+@end table\n\
 \n\
 The value of individual keys can be set with @code{spparms (@var{key},\n\
 @var{val})}. The default values can be restored with the special keyword\n\

--- a/src/bitfcns.cc	Fri Feb 20 12:30:39 2009 +0100
+++ b/src/bitfcns.cc	Fri Feb 20 11:17:01 2009 -0500
@@ -265,7 +265,7 @@
   "-*- texinfo -*-\n\
 @deftypefn {Built-in Function} {} bitand (@var{x}, @var{y})\n\
 Return the bitwise AND of nonnegative integers.\n\
-@var{x}, @var{y} must be in range [0..bitmax]\n\
+@var{x}, @var{y} must be in the range [0,bitmax]\n\
 @seealso{bitor, bitxor, bitset, bitget, bitcmp, bitshift, bitmax}\n\
 @end deftypefn")
 {
@@ -276,7 +276,7 @@
   "-*- texinfo -*-\n\
 @deftypefn {Built-in Function} {} bitor (@var{x}, @var{y})\n\
 Return the bitwise OR of nonnegative integers.\n\
-@var{x}, @var{y} must be in range [0..bitmax]\n\
+@var{x}, @var{y} must be in the range [0,bitmax]\n\
 @seealso{bitor, bitxor, bitset, bitget, bitcmp, bitshift, bitmax}\n\
 @end deftypefn")
 {
@@ -287,7 +287,7 @@
   "-*- texinfo -*-\n\
 @deftypefn {Built-in Function} {} bitxor (@var{x}, @var{y})\n\
 Return the bitwise XOR of nonnegative integers.\n\
-@var{x}, @var{y} must be in range [0..bitmax]\n\
+@var{x}, @var{y} must be in the range [0,bitmax]\n\
 @seealso{bitand, bitor, bitset, bitget, bitcmp, bitshift, bitmax}\n\
 @end deftypefn")
 {

--- a/src/parse.y	Fri Feb 20 12:30:39 2009 +0100
+++ b/src/parse.y	Fri Feb 20 11:17:01 2009 -0500
@@ -3957,7 +3957,7 @@
 @end example\n\
 \n\
 If an error occurs during the evaluation of @var{try} the @var{catch}\n\
-string is evaluated, as the following example shows.\n\
+string is evaluated, as the following example shows:\n\
 \n\
 @example\n\
 eval ('error (\"This is a bad example\");',\n\