ISR11 Operating Instructions for the SMART Text Processing and Document Retrieval System chapter M. E. Lesk Harvard University Gerard Salton Use, reproduction, or publication, in whole or in part, is permitted for any purpose of the United States Government. 1'-[OCRerr]l /EDIT in columns 1-5, with an optional integer beginning in column 7. The indicated number of trees are copied from A6 to B5 with the trees specified by the deletion requests (which follow this card) removed from the file. These deletion requests are cards with right parentheses in columns 1 and 2, and with a serial number in columns 7-12 and/or a BCD identifier in colunns 13-18 Up to 30 of these delete requests may be given. Any criterion tree on the tape which matches the information on the delete card (either the identifier or the serial number, if only one is specified, or both the identifier and the serial nuniber if both are given on the delete card) is removed from the file. /WEOF in columns 1-5. This terminates the processing of the criterion trees. The file on B5 is terminated and A6 is spaced over any remaining trees. This should be the last control card affecting the criterion trees. /ADDL This specification causes trees to be read from [OCRerr], encoded as required by the search programs, and written on B5. The format required for the specification of criterion trees is given below. 5.1.5.1. Criterion Tree Input Format Each definition begins on a new card. Basically, six pieces of infor- `nation are required to define a criterion tree. These are: a) the tree name and serial number, b) the output concept nunibers to be assigned to the sentence if the tree is found, c) the place in the sentence where these concepts are attached, d) the dependency relations between nodes (the structure of the tree), e) the syntactic values associated with each node that zmist be matched,