--13--
down to any desired leve~. Table (i) is linked to tables
(4), (5), (6), and (7), and tables (4), (5), and (6) are
linked either directly back to table (I) or indirectly
through table (8) and then table (3) back to table (i).
Thus, access to any piece of information in these data
tables is gained by simple table lookup.
In view of the variability in the number of words in
each part-of--speech and semantic class, and in the number
of governing probabilities, hypernyms, ser~ntic classes
and dependents associated with each word, we have packed
these data in large arrays as illustrated in tables (i),
(3), (4), (5), (6), and (7). The advantages are (i)
reduction in storage requirements, and (ii) capacity for
rapid selection of a word from a part of speech or a
sen~ntic class. The disadvantage is that we have placed
a restriction on the amount of additional data that may
be added to the existing lists. To avoid modifying the
program when new data are added, indices (such as x, y,
and z in Fig. i) to the reserved spaces in tables (I), (3),
and (7) are n~de input parametecs to the program. At
present the parameters are set to leave space for expansion
of input data. Further expansion can be handled simply by
readjusting the input parameters.
