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. 11-52 Any number of sets of documents may be submitted in one run. Each set of documents is preceded by a *N[OCRerr] card, which contains a twelve character identifier in columns 7-18. This identifier represents the collection name which is used in the search initiated by the *FILE card (see part [OCRerr].3). The documents are submitted on cards, in looked-up form. The order is the usual: first any pure requests (identified by *FINL cards), then any combi[OCRerr]ation request/texts (identified by *LIKE cards), and finally texts, identified by *TEXT cards. A *STOP card follows each set of documents. A deck of relevance judgments, as in part [OCRerr].4, may be placed between *RELS cards after the *STOP card. After each set of documents and relevance judgments, another *NAME card and another document collection may be added. The end of the run is marked by a *FINISH card. 5.3. The Program Tape The SMART program tape is a normal EMS chain tape. To write it, the links to be included are submitted on binary cards, with a blank tape on B3. The EMS loader will write a chain tape automatically, which may be saved and reused. Currently, SMART has lh chain links, as shown in Table 8. Tape-writing programs operate separately. All links need not be included on the program tape, but if any links are omitted some options will be unavailable. It is necessary to resubmit the programs on cards and have the loader write a new chain tape to make any changes in any of the programs. 6. Auxiliary Programs for Use with the SM[OCRerr]T System Several programs, although not directly a part of the S[OCRerr]T system, are