<?xml version="1.0" standalone="yes"?>
<Paper uid="J79-1004">
  <Title>American Journal of Computational Linguistics</Title>
  <Section position="12" start_page="10" end_page="10" type="concl">
    <SectionTitle>
LI
</SectionTitle>
    <Paragraph position="0"> At the end of every run, after the temporarilv -- saved dictionary sections nave bee restored, the Removal List is stored as the last in File 9. Then the values of the key variables are printeH out. The data cards are changed accordingly for the next run. After the sequence of runs with KNTSCT = 5 has been coqpleted, the operation is finished.</Paragraph>
    <Paragraph position="1"> The reduction was aarried out with values of N equal to 16, L 8, and 4. The valbp 10 W~S. tried after 16, but the resulting r~duction was too slight so that the series was discarded and the value R was us&amp; insteati. At N = 4. the size ratio was already so close to unity that a further reduction to 2 would no longer have been very informative.</Paragraph>
    <Paragraph position="2"> All sections of all the successivelv redu-ged dictionaries have been preserved on File 9. Presently File. 9 has 1 5 lists, each ending with an EOF. The 16-th contaxns the Covered List, the Covering List, and the Waiting List from the last run. These three are not separated by EOF1s as there was no necessity for separati~g them. This list collection has no gat ticular importance.</Paragraph>
    <Paragraph position="3"> The remaining subroutines in the program are short auxiliary routines for aiding the principal routines where needed. The function INPUTL reads in a list structure from the card images on file, without printing out the lisk as does the original SLIP routine. It constructs erasable local sublists. It is virtually the same routine as READLS used by ANA-LEX.</Paragraph>
    <Paragraph position="4"> RESTOR is equivalent to the SLIP subroutine of the same name except that it does not leave a SLIP cell with a list name as datum floating in the mailable space. (The latter tends to cause program termination with an error message to the effect that a list was required but not found.) The subrolltine SKIP is needed for convenient accessing of the various lists in File 9. Finally, th$ function DLTLST is the most effective means so far tried for deleting list structures built by the SLIP routine BUIBPL. (It does not comp1etel.r destroy them, however, and if BiJINPL is used reneatedlv, -. the store is still gradually filled vith residues that rake available space unavailable. )</Paragraph>
  </Section>
class="xml-element"></Paper>