{ "paper_id": "M92-1037", "header": { "generated_with": "S2ORC 1.0.0", "date_generated": "2023-01-19T03:13:18.017756Z" }, "title": "UNIVERSITY OF MARYLAND/CONQUEST : DESCRIPTION OF THE ICTOAN SYSTEM A S USED FOR MUC-4", "authors": [ { "first": "James", "middle": [], "last": "Mayfield", "suffix": "", "affiliation": { "laboratory": "", "institution": "University of Maryland Baltimore Count", "location": {} }, "email": "mayfield@cs.umbc.edu" } ], "year": "", "venue": null, "identifiers": {}, "abstract": "", "pdf_parse": { "paper_id": "M92-1037", "_pdf_hash": "", "abstract": [], "body_text": [ { "text": "The ICTOAN system is a natural language processing system developed jointly by ConQuest, Inc . and the University of Maryland Baltimore County. The system was written from scratch during the first five months of 1992 using an estimated eight person-months of labor . The template generation routines were reused fro m our MUC-3 system [1] , providing leverage of perhaps one person-month . Adaptation of software designed for the ConQuest text retrieval system provided leverage of another six person-months .", "cite_spans": [ { "start": 335, "end": 338, "text": "[1]", "ref_id": "BIBREF0" } ], "ref_spans": [], "eq_spans": [], "section": "INTRODUCTION", "sec_num": null }, { "text": "The system code was written by the author and by Paul Nelson of ConQuest, Inc . The semantic net representations of world knowledge were developed by Alexander Ho . Roy Cutts, Terri Hobbs, Mark Wilson, and the author wrote the various grammars . Terri Hobbs also cleaned up significant portions of th e dictionaries . Paul Riddle modified our MUG3 template generation software to work with the new templat e specifications .", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "INTRODUCTION", "sec_num": null }, { "text": "We had two main goals in designing the system : 1. to develop a flexible architecture that would support the interleaving of top-down and bottom-up processing .", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "INTRODUCTION", "sec_num": null }, { "text": "2. to produce a fast system .", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "INTRODUCTION", "sec_num": null }, { "text": "We were largely successful at achieving both of these goals . The ICTOAN system architecture allows lowlevel and high-level processes to be interleaved and duplicated in arbitrary configurations, which are specifie d at run-time . And the system is quite fast, processing 100 texts in under twenty minutes .", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "INTRODUCTION", "sec_num": null }, { "text": "The ICTOAN system architecture is based on the idea of multiple parallel streams of data . Each stream carries a particular class of information about the text being processed . For example, a constituent strea m carries all linguistic constituents found in the text, while an object stream carries semantic net nodes representing the meaning of those constituents .", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "ARCHITECTURE", "sec_num": null }, { "text": "The data in the streams travel in parallel through a pipeline of processes . Each process can read items from one or more streams, make any inferences it chooses about those items, and place those same items o r new items it creates onto one or more streams .", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "ARCHITECTURE", "sec_num": null }, { "text": "The processes used for the MUC-4 evaluation first build a semantic net representation of the input story , then fill out templates based on this representation . Three main types of processes were used by ICTOA N to generate a semantic net representation of a MUC-4 input text :", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "ARCHITECTURE", "sec_num": null }, { "text": "1. Parsing processes : these processes attempt to uncover the linguistic structure of the input text .", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "ARCHITECTURE", "sec_num": null }, { "text": "2. Disambiguation processes : these processes reject unlikely interpretations of the input text .", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "ARCHITECTURE", "sec_num": null }, { "text": "3. Interpretation processes: these processes build semantic net structures that represent the meanin g of portions of the input text .", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "ARCHITECTURE", "sec_num": null }, { "text": "The system is designed so that these three types of processes can be intermingled in any desired order . This provides the researcher with an environment in which it is easy to test the effectiveness of a particula r process, and affords the system designer great flexibility in tailoring the system to a particular application .", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "ARCHITECTURE", "sec_num": null }, { "text": "ICTOAN uses a semantic net representation language (a variant of the KODIAK knowledge representatio n language [2] ) for meaning representation . Each process has access to the entire semantic net for the stor y being processed, as well as to the semantic net representing the systems world knowledge . For MUC-4, the world knowledge semantic net contained 3652 concepts .", "cite_spans": [ { "start": 111, "end": 114, "text": "[2]", "ref_id": "BIBREF1" } ], "ref_spans": [], "eq_spans": [], "section": "Semantic Nets", "sec_num": null }, { "text": "ICTOAN used the ConQuest dictionaries for its lexical knowledge . These dictionaries, which were derive d from the Proximity Linguistic System, contain 70,000 word senses for 40,000 words with part-of-speec h information as well as limited syntactic features .", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Dictionarie s", "sec_num": null }, { "text": "Two types of grammar were used for our evaluation system . Simple context-free grammars with mino r augmentations were used for the initial parses . The sentence interpretation component used a grammar tha t closely resembles a unification grammar (although strict unification is not used) . This grammar enforces semantic constraints by verifying that any interpretation to be built meets all constraints expressed in the semantic net . For example, the following rule was used to interpret sentences based on the verb `assaulted ' or the verb `attacked' : In the section labeled `syntax,' the names `subject,' `verb,' and `object' are labels given to the semantic representations of the corresponding sub-constituents . The asterisk means that the vp is the head of the a being built . The section labeled `semantics' indicates that the semantic net representation of the sentence i s an ASSAULLACTIOY, for which the ACTOR slot is filled by the semantics of the subject, and the PLACE slot is filled by the semantics of the object . 2. An object stream, which carried semantic net nodes representing the meaning of constituents on th e constituent stream .", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Grammars", "sec_num": null }, { "text": "3. An attack stream, which carried semantic net nodes that represent attacks described in the story .", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Grammars", "sec_num": null }, { "text": "The template generator simply observed the attack stream and generated one template for each attack that went by.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Grammars", "sec_num": null }, { "text": "The following five main processes were included in the MUC-4 evaluation system :", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "PROCESSES", "sec_num": null }, { "text": "\u2022 Statistical word sense disambiguation . ICTOAN can store multiple word senses for each word in its dictionary . To eliminate some of the ambiguity that arises when processing a word with multipl e senses, a statistical process is used to reject some of the less likely senses . This process does a preliminary syntactic parse of each sentence, relative to a fairly complete context-free grammar for sentences . Each word sense is then rated according to the size of the largest constituent that contains it . This information is used during the initial parse to eliminate unlikely parses .", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "PROCESSES", "sec_num": null }, { "text": "\u2022 Initial parse . Once word sense has been assigned a likelihood, an initial syntactic parse is don e relative to a context-free grammar . This parse is primarily aimed at detecting noun phrases, althoug h in the evaluation system it produced other constituents as well (such as prepositional phrases and verb groups) . No semantic information is used at this time ; simple features are used to eliminate parses , but they are purely syntactic in nature . The statistics generated by the previous process are used here to eliminate unlikely parses .", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "PROCESSES", "sec_num": null }, { "text": "\u2022 Phrase interpretation. The phrase interpreter attempts to build a semantic net representation o f each constituent . In the evaluation system, the semantic net was searched for a node with the sam e name as the head word of the constituent being interpreted . This allowed a wide variety of phrases t o be assigned a basic interpretation without a complicated mechanism .", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "PROCESSES", "sec_num": null }, { "text": "\u2022 Sentence interpretation . Sentence interpretation is done by using a unification-like grammar t o combine the meanings of subconstituents into a single semantic net node representing the meaning o f the sentence . This grammar was described in the subsection entitled `Grammars' above .", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "PROCESSES", "sec_num": null }, { "text": "\u2022 Template generation. A template is generated for each attack that passes along the attack stream . The semantic net node representing a particular slot filler is located by traversing a fixed path shap e from the node representing the attack . Set fills are then generated by table lookup, while string fills are generated by tracing back from the semantic net node to the longest substring of the input tex t that has that node as its interpretation . ", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "PROCESSES", "sec_num": null } ], "back_matter": [ { "text": "This section describes ICTOAN's processing of the sentence `GUERRILLAS ATTACKED MERINO' S HOME IN SAN SALVADOR 5 DAYS AGO WITH EXPLOSIVES' from text TST2-MUC4-0048 . The initial parsing process first produces a set of possible constituents . Note that some ambiguity remains at this point : Next, semantic interpretation is performed on each phrase, and the resulting semantic net nodes are combined by the phrase interpreter . Since the basic rule for the verb `attack ' (shown above in the `Grammars '", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "EXAMPL E", "sec_num": null } ], "bib_entries": { "BIBREF0": { "ref_id": "b0", "title": "Synchronetics : Description of the Synchronetics system used fo r MUC-3", "authors": [ { "first": "James", "middle": [], "last": "Mayfield", "suffix": "" }, { "first": "Edwin", "middle": [], "last": "Addison", "suffix": "" } ], "year": 1991, "venue": "Proceedings of the Third Message Understanding Conference (MUC-3)", "volume": "", "issue": "", "pages": "207--211", "other_ids": {}, "num": null, "urls": [], "raw_text": "James Mayfield and Edwin Addison . Synchronetics : Description of the Synchronetics system used fo r MUC-3 . In Beth Sundheim, editor, Proceedings of the Third Message Understanding Conference (MUC- 3), pages 207-211 . Morgan Kaufmann, 1991 .", "links": null }, "BIBREF1": { "ref_id": "b1", "title": "Some problems and proposals for knowledge representation", "authors": [ { "first": "Robert", "middle": [], "last": "Wilensky", "suffix": "" } ], "year": 1987, "venue": "", "volume": "", "issue": "", "pages": "", "other_ids": {}, "num": null, "urls": [], "raw_text": "Robert Wilensky. Some problems and proposals for knowledge representation . Memorandum UCB/CSD 87/351, University of California, Berkeley Electronic Research Laboratory, 1987 .", "links": null } }, "ref_entries": { "FIGREF1": { "type_str": "figure", "uris": null, "num": null, "text": "The ICTOAN system used three streams during the MUC-4 evaluation : 1. A constituent stream, which carried syntactic constituents (e .g. noun phrases, prepositional phrases , etc ." }, "FIGREF2": { "type_str": "figure", "uris": null, "num": null, "text": "provision for the attachment of prepositional phrases, only the subject and direct object are interpreted as part of the resultant ASSAULT.CTION . Here is the structure that is produced : for GUERRILLAS .198 String fill selected for GUERRILLAS .198 is \"GUERRILLAS \" Generating string fill for GUERRILLAS .198 String fill selected for GUERRILLAS .198 is \"GUERRILLAS \" Generating string fill for HOME .20 1 String fill selected for HOME .201 is \"MERINO'S HOME \"Here is the resultant template :" } } } }