--18- 
added, and a random number in the range from I to the 
total sum is generated to determine which candidate should 
be selected. 
4.1.5. Word Generator ~WOR-GEN). This procedure finds 
all possible candidates which satisfy the restrictions 
specified in s restriction pattern, and assigns different 
weights to them on the basis of the contents of a proba- 
bility reweighting table. It selects a word st random 
from the candidates according to their weights. 
4.1.6. .Random Number Generator ~RA .NDOM). Input to 
this procedure is an integer No This procedure generates 
a random integer in the range from i to N. 
4°2. The Generation Al~orithm 
The general strategy for generating a paragraph is, 
first, to generate the initial sentence based on a selected 
restriction pattern, and then to generate each noninitial 
sentence base not only on a selected restriction pattern 
but also on the semantic properties of the words in all 
the previously generated sentences of the paragraph. The 
algorithm and the sentence generation procedure can best be 
illustrated by an example. Let us suppose that the restric- 
tion pattern shown in Fig. 4(a) is chosen for a sentence. 
For ease of reference we will letter, the steps involved in 
this procedure. 
a. If the restriction pattern specifies a restriction 
on the selection of the sentence governor (usually a tzars-