Index: website/runtime/use.html =================================================================== --- website/runtime/use.html (revision 430) +++ website/runtime/use.html (working copy) @@ -281,7 +281,7 @@ Suppose  C1  gives t, the delete removes the slice established on the first line, and  C2  gives f, so C3 is done with c set back to the value it had before  C1  was obeyed — but this old value does not take account of the byte shift -caused by the delete. This problem was forseen from the beginning when designing +caused by the delete. This problem was foreseen from the beginning when designing Snowball, and recognised as a minor issue because it is an unnatural thing to want to do. (C3  should not be an alternative to something which has deletion as an occasional side-effect.) It may be addressed in the future. Index: website/buglist.txt =================================================================== --- website/buglist.txt (revision 430) +++ website/buglist.txt (working copy) @@ -10,7 +10,7 @@ Symptom: '$ s ( C )' causing a compiler crash when s undeclared. Modules affected: analyser.c Notes: 's undeclared' was reported before the crash, so it looked - like a valid termination, albeit with trucated error messages. + like a valid termination, albeit with truncated error messages. Index: website/wrappers/guide.html =================================================================== --- website/wrappers/guide.html (revision 430) +++ website/wrappers/guide.html (working copy) @@ -42,7 +42,7 @@ have developed a perl interface to the Snowball stemmers. It is written using C and -provides OO and plain interfaces. Dowload from the above tarball. +provides OO and plain interfaces. Download from the above tarball. Comments and queries should be directed to Teodor and Oleg.

Index: website/texts/introduction.html =================================================================== --- website/texts/introduction.html (revision 430) +++ website/texts/introduction.html (working copy) @@ -61,7 +61,7 @@ bibliography cannot be attempted here). But it is rare to see a stemmer laid out in an unambiguous algorithmic form from which encodings in C, Java, Perl etc might easily be made. When exact descriptions are -attempted, it is often goes with approaches to stemming that are +attempted, it is often with approaches to stemming that are relatively simple, for example the Latin stemmer of Schinke (Shinke 1996), or the Slovene stemmer of Popovic (Popovic 1990). A more complex, and therefore more characteristic stemmer is the Kraaij-Pohlmann stemmer for @@ -528,7 +528,7 @@ algorithmic. They can be extended to include built-in exception lists, they could be used in combination with a full dictionary, but they are still presented here in their simplest possible form. Being purely algorithmic, -they are, or ought to be, inferior to the performance of well-constucted +they are, or ought to be, inferior to the performance of well-constructed dictionary-based stemmers. But they are still very useful, for the following reasons: @@ -592,7 +592,7 @@ Of the three types of error, over-stemming is the most important, and -using a dictionary does not elimiate all over-stemmings, but does reduce their +using a dictionary does not eliminate all over-stemmings, but does reduce their incidence. @@ -635,7 +635,7 @@

In English, a broad definition of letter would be anything that could be -accepted as a pronouncable element of a word. This would include +accepted as a pronounceable element of a word. This would include accented Roman letters (naïve, Fauré), and certain ligature forms (encyclopædia). It would exclude letters of foreign alphabets, such as Greek and Cyrillic. @@ -821,7 +821,7 @@ Stemmers do not need to handle linguistic forms that turn up only very rarely, but in practice it is hard to design a stemmer with all rare forms -eliminated without there apprearing to be some gaps in the thinking. For +eliminated without there appearing to be some gaps in the thinking. For this reason one should not worry too much about their occasional presence. For example, in contemporary Portuguese, use of the second person plural form of verbs has almost completely disappeared. Even so, endings for Index: website/texts/earlyenglish.html =================================================================== --- website/texts/earlyenglish.html (revision 430) +++ website/texts/earlyenglish.html (working copy) @@ -124,7 +124,7 @@ will also be removed. Words like brandreth, deforest will be mis-stemmed. Nevertheless, for the vocabulary of the Bible, the inclusion of these extra endings is not harmful (see -this demontration — +this demonstration — for example, search for the text love in 1000 verses). Index: website/texts/r1r2.html =================================================================== --- website/texts/r1r2.html (revision 430) +++ website/texts/r1r2.html (working copy) @@ -12,7 +12,7 @@
 

Defining R1 and R2

-All the stemmers make use of at least one of the region definitions R1 and +Most of the stemmers make use of at least one of the region definitions R1 and R2. They are defined as follows:

Index: website/algorithms/english/stop.txt =================================================================== --- website/algorithms/english/stop.txt (revision 430) +++ website/algorithms/english/stop.txt (working copy) @@ -23,7 +23,7 @@ | safe to remove it if it is in lower case. our | possessive adjective ours | possessive pronoun -ourselves | relexive +ourselves | reflexive | second person (archaic `thou' forms not included) you | subject and object your | possessive adjective @@ -81,7 +81,7 @@ did | past doing | -ing form - | The forms below are, I believe, best omitted, bacause of the significant + | The forms below are, I believe, best omitted, because of the significant | homonym forms: | He made a WILL Index: website/algorithms/porter/stemmer.html =================================================================== --- website/algorithms/porter/stemmer.html (revision 430) +++ website/algorithms/porter/stemmer.html (working copy) @@ -101,7 +101,7 @@
(*d and not (*L or *S or *Z))
-tests for a stem ending witha double consonant other than L, S or Z. +tests for a stem ending with a double consonant other than L, S or Z. Elaborate conditions like this are required only rarely.

In a set of rules written beneath each other, only one is obeyed, and this Index: website/compiler/snowman.html =================================================================== --- website/compiler/snowman.html (revision 430) +++ website/compiler/snowman.html (working copy) @@ -261,7 +274,7 @@ $X op AE where  X  is an integer name and op is one of the six tests  ==,  !=,  >=,  >, -<=,  <, or five assignments  =,  +=,  -=,  *=,  /=. Again, the meanings are the +<=,  <, or five assignments  =,  +=,  -=,  *=,  /=. Again, the meanings are the same as in C.

As well as integer names and literal numbers, the following may be used in @@ -476,7 +489,7 @@
-> s
moves the slice to variable  s, -
<- S +
<- S
replaces the slice with variable (or literal)  S. For example @@ -513,7 +526,7 @@
insert S
insert variable or literal  S  before c, moving c to the right of the - insert.  <+  is a synonym for  insert. + insert.  <+  is a synonym for  insert.
attach S
the same, but leave c at the left of the insert. @@ -769,8 +782,8 @@ do ( ['y'] <-'Y' set Y_found ) /* if c:l begins 'y' replace it by 'Y' and set Y_found */ - do repeat(goto (v ['y']) <-'Y' set Y_found) - /* repeatedy move down the string looking for v 'y' and + do repeat(goto (v ['y']) <-'Y' set Y_found) + /* repeatedly move down the string looking for v 'y' and replacing 'y' with 'Y'. Whenever the replacement takes place set Y_found. v is a test for a vowel, defined as a grouping (see below). */ @@ -782,7 +795,7 @@ .... - do (Y_found repeat(goto (['Y']) <- 'y') + do (Y_found repeat(goto (['Y']) <- 'y')
 

9 Groupings

@@ -893,7 +906,7 @@ characters into symbols, the units of text being represented, and slots, the units of space into which they map. (So in case (a), all slots are one byte; in case (b) all slots are two bytes.) -c and l have numeric values the can be used in AEs (arithmetic +c and l have numeric values that can be used in AEs (arithmetic expressions). These values count the number of slots. Similarly setmark,  tomark  and  atmark  are remembering and then using slot counts.  size  and  sizeof  measure string size @@ -914,7 +927,7 @@
||  is used for alternatives,  [X]  means that X is -optional, and  [X]*  means that X is repreated zero or more +optional, and  [X]*  means that X is repeated zero or more times. meta-symbols are defined on the left.  <char>  means any character.