A Simple but Useful Approach to Conjunct Identification

35610

Authors

nan

Abstract

This paper presents an approach to identifying conjuncts of coordinate conjunctions appearing in text which has been labelled with syntactic and semantic tags. The overall project of which this research is a part is also briefly discussed. The program was tested on a 10,000 word chapter of the Merck Veterinary Manual. The algorithm is deterministic and domain independent and it performs relatively well on a large real-life domain. Constructs not handled by the simple algorithm are also described in some detail.

Keywords

nan

Full Content

A SIMPLE BUT USEFUL APPROACH TO CONJUNCT IDENTIFICATION 1 Rajeev Agarwal Lois Boggess Department of Computer Science Mississippi State University Mississippi State, MS 39762 e-mail: kudzu@cs.msstate.edu ABSTRACT This paper presents an approach to identifying conjuncts of coordinate conjunctions appearing in text which has been labelled with syntactic and semantic tags. The overall project of which this research is a part is also briefly discussed. The program was tested on a 10,000 word chapter of the Merck Veterinary Manual. The algorithm is deterministic and domain independent and it performs relatively well on a large real-life domain. Constructs not handled by the simple algorithm are also described in some detail. INTRODUCTION Identification of the appropriate conjuncts of the coordinate conjunctions in a sentence is fundamental to the understanding of the sentence. We use the phrase 'conjunct identification' to refer to the process of identifying the components (words, phrases, clauses) in a sentence that are conjoined by the coordinate conjunctions in it. Consider the following sentence: "The president sent a memo to the managers to inform them of the tragic inciden[ and to request their co- operation." In this sentence, the coordinate conjunction 'and' conjoins the infinitive phrases "to inform them of the tragic incident" and "to request their co- operation". If a natural language understanding system fails to recognize the correct conjuncts, it is likely to misinterpret the sentence or to lose its meaning entirely. The above is an example of a simple sentence where such conjunct identification is easy. In a realistic domain, one encounters sentences which are longer and far more complex. 1 This work is supported in part by the National Science Foundation under grant number IRI-9002135. This paper presents an approach to conjunct identification which, while not perfect, gives reasonably good results with a relatively simple algorithm. It is deterministic and domain independent in nature, and is being tested on a large domain - the Merck Veterinary Manual, consisting of over 700,000 words of uncontrolled technical text. Consider this sentence from the manual: "The mites live on the surface of the skin of the ear and canal, and feed by piercing the skin and sucking lymph, with resultant irritation, inflammation, exudation, and crust formation". This sentence has four coordinate conjunctions; identification of their conjuncts is moderately difficult. It is not uncommon to encounter sentences in the manual which are more than twice as long and even more complex. The following section briefly describes the larger project of which this research is a part. Then the algorithm used by the authors and its drawbacks are discussed. The last section gives the results obtained when an implementation was run on a 10,000-word excerpt from the manual and discusses some areas for future research. THE RESEARCH PROJECT This research on conjunct identification is a part of a larger research project which is exploring the automation of extraction of information from structured reference manuals. The largest manual available to the project in machine-readable form is the Merck Veterinary Manual, which serves as …

Content truncated to 500 words

Labeled Text

This paper presents an approach to identifying conjuncts of coordinate conjunctions appearing in text which has been labelled with syntactic and semantic tags. The overall project of which this research is a part is also briefly discussed. The program was tested on a 10,000 word chapter of the Merck Veterinary Manual. The algorithm is deterministic and domain independent and it performs relatively well on a large real-life domain. Constructs not handled by the simple algorithm are also described in some detail.

Publication Details

Paper ID:
35610
Year:
1992
Publication:
TIPSTER
Publication Type:
conf
DOI:
nan