{ "paper_id": "P99-1045", "header": { "generated_with": "S2ORC 1.0.0", "date_generated": "2023-01-19T09:32:05.883465Z" }, "title": "Less is more: Eliminating index terms from subordinate clauses", "authors": [ { "first": "Simon", "middle": [ "H" ], "last": "Corston-Oliver", "suffix": "", "affiliation": { "laboratory": "", "institution": "Microsoft Research One Microsoft Way Redmond", "location": { "postCode": "98052", "region": "WA" } }, "email": "" }, { "first": "William", "middle": [ "B" ], "last": "Dolan", "suffix": "", "affiliation": { "laboratory": "", "institution": "Microsoft Research One Microsoft Way Redmond", "location": { "postCode": "98052", "region": "WA" } }, "email": "" } ], "year": "", "venue": null, "identifiers": {}, "abstract": "We perform a linguistic analysis of documents during indexing for information retrieval. By eliminating index terms that occur only in subordinate clauses, index size is reduced by approximately 30% without adversely affecting precision or recall. These results hold for two corpora: a sample of the world wide web and an electronic encyclopedia.", "pdf_parse": { "paper_id": "P99-1045", "_pdf_hash": "", "abstract": [ { "text": "We perform a linguistic analysis of documents during indexing for information retrieval. By eliminating index terms that occur only in subordinate clauses, index size is reduced by approximately 30% without adversely affecting precision or recall. These results hold for two corpora: a sample of the world wide web and an electronic encyclopedia.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Abstract", "sec_num": null } ], "body_text": [ { "text": "Efforts to exploit natural language processing (NLP) to aid information retrieval (IR) have generally involved augmenting a standard index of lexical terms with more complex terms that reflect aspects of the linguistic structure of the indexed text (Fagan 1988 , Katz 1997 , Arampatzis et al. 1998 , Strzalkowski et al. 1998 . This paper shows that NLP can benefit information retrieval in a very different way: rather than increasing the size and complexity of an IR index, linguistic information can make it possible to store less information in the index. In particular, we demonstrate that robust NLP technology makes it possible to omit substantial portions of a text from the index without dramatically affecting precision or recall.", "cite_spans": [ { "start": 249, "end": 260, "text": "(Fagan 1988", "ref_id": "BIBREF2" }, { "start": 261, "end": 272, "text": ", Katz 1997", "ref_id": "BIBREF4" }, { "start": 273, "end": 297, "text": ", Arampatzis et al. 1998", "ref_id": "BIBREF0" }, { "start": 298, "end": 324, "text": ", Strzalkowski et al. 1998", "ref_id": null } ], "ref_spans": [], "eq_spans": [], "section": "Introduction", "sec_num": "1" }, { "text": "This research is motivated by insights from Rhetorical Structure Theory (RST) (Mann & Thompson 1986 , 1988 ). An RST analysis is a dependency analysis of the structure of a text, whose leaf nodes are the propositions encoded in clauses. In this structural analysis, some propositions in the text, called \"nuclei,\" are more centrally important in realizing the writer's communicative goals, while other propositions, called \"satellites,\" are less central in realizing those goals, and instead provide additional information about the nuclei in a manner consistent with the discourse relation between the nucleus and the satellite. This asymmetry has an analogue in sentence structure: main clauses tend to represent nuclei, while subordinate clauses tend to represent satellites (Matthiessen and Thompson 1988, Corston-Oliver 1998) .", "cite_spans": [ { "start": 78, "end": 99, "text": "(Mann & Thompson 1986", "ref_id": "BIBREF5" }, { "start": 100, "end": 106, "text": ", 1988", "ref_id": "BIBREF2" }, { "start": 778, "end": 794, "text": "(Matthiessen and", "ref_id": "BIBREF7" }, { "start": 795, "end": 830, "text": "Thompson 1988, Corston-Oliver 1998)", "ref_id": null } ], "ref_spans": [], "eq_spans": [], "section": "Introduction", "sec_num": "1" }, { "text": "From the perspective of discourse analysis, the task of information retrieval can be viewed as attempting to identify the \"aboutness,\" or global topicality, of a document in order to determine the relevance of the document as a response to a user's query. Given an RST analysis of a document, we would expect that for the purposes of predicting document relevance, information that occurs in nucleic propositions ought to be more useful than information that occurs in satellite propositions. To test this expectation, we experimented with eliminating from an IR index those terms that occurred in certain kinds of subordinate clauses.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Introduction", "sec_num": "1" }, { "text": "At the core of the Microsoft English Grammar (MEG), is a broad-coverage parser that produces conventional phrase structure analyses augmented with grammatical relations; this parser is the basis for the grammar checker in Microsoft Word (Heidorn 1999) . Syntactic analyses undergo further processing in order to derive logical forms (LFs), which are graph structures that describe labeled dependencies among content words in the original input. LFs normalize certain syntactic alternations (e.g. active/passive) and resolve both intrasentential anaphora and long-distance dependencies.", "cite_spans": [ { "start": 237, "end": 251, "text": "(Heidorn 1999)", "ref_id": "BIBREF3" } ], "ref_spans": [], "eq_spans": [], "section": "System description", "sec_num": "2" }, { "text": "Over the past two years we have been exploring the use of MEG LFs as a means of improving IR precision. This work, which is embodied in a natural language query feature in the Microsoft Encarta 99 encyclopedia, augments a traditional keyword document index with a second index that contains linguisticallyinformed terms. Two types of terms are stored in this linguistic index: ", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "System description", "sec_num": "2" }, { "text": "This linguistic index is used to postfilter the output of a conventional statistical search algorithm. An input natural language query is first submitted to the statistical search algorithm as a set of content words, resulting in a ranked set of documents. This ranked set is then reranked by attempting to find overlap between the set of linguistic terms stored for each of these documents and corresponding linguistic terms determined by processing the query in MEG. Documents that contain linguistic matches are heuristically ranked according to the nature of the match. Documents that fail to match do not receive a rank, and are typically not displayed to the user. The process of building a secondary linguistic index and matching terms from the query is referred to as natural language matching (NLM) in the discussion below. NLM has been used to filter documents retrieved by several different search technologies operating on different genres of text.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Subject: Abraham_Lincoln", "sec_num": null }, { "text": "Since NLM was intended for use in consumer products, it was important to minimize index size. We needed an algorithm that would enable us to achieve reductions in index size without adversely affecting precision and recall. At the time when we were conducting these experiments, there did not exist any sufficiently large publicly available corpora of questions and relevant documents for the two genres of interest to us: the word wide web and encyclopedia text. We therefore gathered queries and documents for a web sample (section 3.2) and Encarta 99 (section 3.3), and had nonlinguists perform double-blind evaluations of relevance.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Subject: Abraham_Lincoln", "sec_num": null }, { "text": "Three implementation-specific aspects of the NLM index should be noted. First, in order to limit index size, duplicate instances of a term occurring in the same document are stored only once. Second, because of the particular compression scheme used to build the index, all terms require the same number of bits for storage, regardless of the length or number of words they contain. Third, the top ten percent of the NLM terms were suppressed, by analogy with stop words in conventional indexing schemes. Such high frequency terms tended not to be good predictors of document relevance.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Subject: Abraham_Lincoln", "sec_num": null }, { "text": "We conducted experiments in which we eliminated terms from the NLM index, and then measured precision and recall. The experiments were performed on two test corpora: web pages returned by the Alta Vista search service (section 3.2) and articles from the Encarta electronic encyclopedia (section 3.3).", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Experiments", "sec_num": "3" }, { "text": "In order to test the hypothesis that information contained in subordinate clauses is less useful for IR than matrix clause information, we modified the indexing algorithm so that it eliminated terms that occurred in certain kinds of subordinate clauses. We experimented with the following clause types: I LSubj denotes a logical subject, LObj a logical object and Equiv an equivalence relation.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "The kinds of subordinate clauses", "sec_num": "3.1" }, { "text": "Until further indicated, lunch will be served at 1 p.m.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Abbreviated Clause (ABBCL)", "sec_num": null }, { "text": "[ told the telemarketer that you weren't home.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Complement Clause (COMPCL)", "sec_num": null }, { "text": "After John went home, he ate dinner.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Adverbial Clause (ADVCL)", "sec_num": null }, { "text": "John decided to go home.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Infinitival Clause (INFCL)", "sec_num": null }, { "text": "I saw the man, who was wearing a green ha__!.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Relative Clause (RELCL)", "sec_num": null }, { "text": "(PRPRTCL) Napoleon attacked the fleet, destroying it. completely", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Present Participial Clause", "sec_num": null }, { "text": "In the experiments described below, terms were eliminated from documents during indexing. However, terms were never eliminated from the queries.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Present Participial Clause", "sec_num": null }, { "text": "We gathered 120 natural language queries from colleagues for submission to Alta Vista. 2 The queries averaged 3.7 content words, with a standard deviation of 1.7. 3 Words like \"know\" and \"find\", which are common in natural language queries, are included in these counts.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Alta Vista experiments", "sec_num": "3.2" }, { "text": "We examined the first thirty documents returned by Alta Vista (or fewer documents for queries that did not return at least thirty documents). This document set comprised 3,440 documents. Since we were not able to determine what percentage of the web Alta Vista accounted for, it was not possible to calculate the recall of this document set. In the discussion below, we calculate recall as a percentage of the relevant documents returned by Alta Vista. Precision and recall are averaged across all queries submitted to Alta Vista. The documents returned by Alta Vista were indexed using NLM (section 2) and filtered to retain only documents that contained matches. Table 1 contrasts the baseline NLM figures (indexing based on terms in all clauses) with the results of eliminating from the documents all terms that occurred in subordinate clauses.", "cite_spans": [], "ref_spans": [ { "start": 665, "end": 672, "text": "Table 1", "ref_id": "TABREF2" } ], "eq_spans": [], "section": "Alta Vista experiments", "sec_num": "3.2" }, { "text": "To measure the trade-off between precision and recall, we calculated the F-measure (Van Rij sbergen 1980), defined as F -(f12 + 1.0)PR, where P is precision, R is fl2p + R recall and [3 is the relative weight assigned to precision and recall (for these experiments,", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Alta Vista experiments", "sec_num": "3.2" }, { "text": "As Table 1 shows, by eliminating terms from all subordinate clauses in the documents, the NLM index size was reduced by 31.4% with only a minor impact (-0.82%) on F-measure. Given unique indexing of terms per document, and a constant size per term (section 2), we can deduce that 31.4% of the terms in the NLM index occurred only in subordinate clauses. Had they occurred even once in a main clause, they would not have been removed from the index.", "cite_spans": [], "ref_spans": [ { "start": 3, "end": 10, "text": "Table 1", "ref_id": "TABREF2" } ], "eq_spans": [], "section": "13= 1).", "sec_num": null }, { "text": "We ran two comparison experiments. In the first comparison, we deleted one third of all terms as they were produced. Table 2 gives the average results of three runs of this experiment. In each run, a different set of one third of the terms was deleted. Although fewer terms were omitted (28.8% 4 versus 31.4% when all terms in 4 TelTflS eliminated from a subordinate clause in one sentence might persist in the index if they occurred in the main clause of another sentence in the same document, hence a reduction of slightly less than 33.3%. subordinate clauses were eliminated) the detrimental effect on F-measure was 5.3 times greater than when terms occuring in subordinate clauses were deleted. In the second comparison experiment, we tested the converse of the operation described in the discussion of Table 1 above: we eliminated all search terms from the main clauses of documents, leaving only search terms that occurred in subordinate clauses. Table 3 shows the dramatic effect of this operation: as we expected, the index size was greatly reduced (by 73.8%). However, Fmeasure was seriously affected, by more than two thirds, or -68.99%. The effect on Fmeasure is primarily due to the severe impact on recall, which fell from a tolerable baseline of 43.2% to an unacceptable 7.5%. Comparing the reduction in index size to the reduction when subordinate clause information was eliminated (73.8% versus 31.4%, a factor of approximately 2:1) to the reduction in Fmeasure (-68.99 versus -0.82, a factor of approximately 84:1), it is clear that the impact on F-measure from eliminating terms in main clauses is disproportionate to the reduction in index size. Table 4 isolates the effects of deleting each kind of subordinate clause. Most remarkable is the fact that eliminating terms that only occur in relative clauses (RELCL) yields a 7.3% reduction in index size while actually improving F-measure. Also worthy of special note is the fact that two kinds of subordinate clauses can be eliminated with no perceptible effect on Fmeasure: eliminating complement clauses (COMPCL), yields a reduction in index size of 7.4%, and eliminating present participial clauses (PRPRTCL) yields a reduction in index size of 4.2%.", "cite_spans": [], "ref_spans": [ { "start": 117, "end": 124, "text": "Table 2", "ref_id": null }, { "start": 807, "end": 814, "text": "Table 1", "ref_id": "TABREF2" }, { "start": 953, "end": 960, "text": "Table 3", "ref_id": "TABREF3" }, { "start": 1665, "end": 1672, "text": "Table 4", "ref_id": "TABREF4" } ], "eq_spans": [], "section": "13= 1).", "sec_num": null }, { "text": "5 F is calculated from the underlying figures, to minimise the effects of rounding errors. Table 4 are not additive. For example, an infinitival clause (INFCL) may contain a noun phrase with an embedded relative clause (RELCL). Elimination of all terms in the infinitival clause would therefore also lead to elimination of terms in the relative clause.", "cite_spans": [], "ref_spans": [ { "start": 91, "end": 98, "text": "Table 4", "ref_id": "TABREF4" } ], "eq_spans": [], "section": "13= 1).", "sec_num": null }, { "text": "We gathered 348 queries from middleschool students for submission to Encarta, an electronic encyclopedia. The queries averaged 3.4 content words, with a standard deviation of 1.4. We indexed the text of the Encarta articles, approximately 33,000 files containing approximately 576,000 sentences, using a simple statistical indexing engine. We then submitted each query and gathered the first thirty ranked documents, for a total of 5,218 documents. We constructed an NLM index for the documents returned and, in a second pass, filtered documents using NLM. In the discussion below, recall is calculated as a percentage of the relevant documents that the statistical search returned. Table 5 compares the baseline NLM accuracy (indexing all terms) to the accuracy of eliminating terms that occurred in subordinate clauses. The reduction in index size (29.0%) is comparable to the reduction observed in the Alta Vista experiment (31.4%). However, the effect on F-measure of eliminating terms from subordinate clauses is more marked (-4.91%) than in the Alta Vista experiment (-0.82%). The impact on F-measure is still substantially less than the average of three runs during which arbitrary non-overlapping thirds of the terms were eliminated, as illustrated in Table 6 . This arbitrary deletion of terms results in an 11.57% reduction in F-measure compared to the baseline, approximately 2.4 times greater than the impact of eliminating material subordinate clauses. in As Table 7 shows, eliminating terms from main clauses and retaining information in subordinate clauses has a profound effect on recall for the Encarta corpus. As with the Alta Vista experiment (section 3.2), it is instructive to compare the results in Table 7 to the results obtained when terms in subordinate clauses were deleted (Table 5 ). Approximately 2.7 times as many terms were eliminated from the index, yet the effect on F-measure is almost thirteen times worse. Table 8 isolates the effects for Encarta of eliminating terms from each kind of subordinate clause. It is interesting to compare the reduction in index size and the relative change in Fmeasure for Encarta, a relatively homogeneous corpus of academic articles, to the heterogeneous web sample of section 3.2. For both corpora, eliminating terms that only occur in abbreviated clauses (ABBCL) or present participial clauses (PRPRTCL) results in modest reductions in index size without negatively affecting F-measure. Eliminating terms from adverbial clauses (ADVCL) or infinitival clauses (INFCL) also produces a similar effects on the two corpora: a reduction in index size with a modest (less than 1%) reduction in F-measure. Relative clauses (RELCL) and complement clauses (COMPCL), however, behave differently across the two corpora. In both cases, the effects on F-measure are positive for web documents and negative for Encarta articles. The negative impact of the elimination of material from relative clauses in Encarta can perhaps be attributed to the pervasive use of non-restrictive relative clauses in the definitional encyclopedia text, as illustrated by the underlined sections of the following examples: Sargon H (ruled 722-705 BC), who followed , to the throne, extended Assyrian domination in all directions, from southern Anatolia to the Persian Gulf Amaral, Tarsila do (1886 -1973 , Brazilian painter whose works were instrumental in the development of modernist painting in Brazil.", "cite_spans": [ { "start": 3309, "end": 3333, "text": "Amaral, Tarsila do (1886", "ref_id": null }, { "start": 3334, "end": 3339, "text": "-1973", "ref_id": null } ], "ref_spans": [ { "start": 683, "end": 690, "text": "Table 5", "ref_id": "TABREF6" }, { "start": 1260, "end": 1267, "text": "Table 6", "ref_id": "TABREF7" }, { "start": 1472, "end": 1479, "text": "Table 7", "ref_id": "TABREF8" }, { "start": 1721, "end": 1728, "text": "Table 7", "ref_id": "TABREF8" }, { "start": 1800, "end": 1808, "text": "(Table 5", "ref_id": "TABREF6" }, { "start": 1942, "end": 1949, "text": "Table 8", "ref_id": "TABREF9" } ], "eq_spans": [], "section": "Encarta experiments", "sec_num": "3.3" }, { "text": "After the so-called Boston Tea Party in 1773, when Bostonians destroyed tea belonging to the East India Company, Parliament enacted four measures as an example to the other rebellious colonies.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Encarta experiments", "sec_num": "3.3" }, { "text": "Another peculiar characteristic of the Encarta corpus, namely the pervasive use of complement taking nominal expressions such as the belief that and the fact that, possibly explains the negative impact of the elimination of complement clause material in Table 8 . ", "cite_spans": [], "ref_spans": [ { "start": 254, "end": 261, "text": "Table 8", "ref_id": "TABREF9" } ], "eq_spans": [], "section": "Encarta experiments", "sec_num": "3.3" }, { "text": "Although the results presented in section 3 are compelling, it may be possible to refine the identification of clauses from which index terms can be eliminated. In particular, complement clauses subordinate to speech act verbs would appear from failure analysis to warrant special attention. For example, in the following sentence our linguistic intuitions suggest that the content of the complement clause is more informative than the attribution to a speaker in the main clause: John said that the President would not resign in disgrace. Of course, more fine-grained distinctions of this type can only be made given sufficiently rich linguistic analyses as input. Another compelling topic for future research would be the impact of less sophisticated analyses to identify various kinds of subordinate clauses.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Discussion", "sec_num": "4" }, { "text": "The terms eliminated in the experiments presented in this paper were linguistic in nature. However, we would expect similar results if conventional word-based terms were eliminated in similar fashion. In future research, we intend to experiment with eliminating terms from a conventional statistical engine, combining this technique with the standard method of eliminating high frequency index terms.. Rather than eliminating terms from an index, it may also prove fruitful to investigate weighting terms according to the kind of clause in which they occur.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Discussion", "sec_num": "4" }, { "text": "We have demonstrated that, as implicitly predicted by RST, index terms may be eliminated from certain kinds of subordinate clauses without substantially affecting precision or recall. Rather than using NLP to generate more index terms, we have found tremendous gains from systematically eliminating terms. The exact severity of the impact on precision and recall that results from eliminating terms varies by genre. In all cases, however, the systematic elimination of subordinate clause material is substantially better than arbitrary deletion of index terms or the deletion of index terms that occur only in main clauses.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Conclusions", "sec_num": "5" }, { "text": "Future research shall attempt to refine the analysis of the kinds of subordinate clauses from which index terms can be omitted, and to integrate these findings with conventional statistical IR algorithms.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Conclusions", "sec_num": "5" } ], "back_matter": [ { "text": "Our thanks go to Lisa Braden-Harder, Susan Dumais, Raman Chandrasekar, Eric Ringger, Monica Corston-Oliver, Lucy Vanderwende and the three anonymous reviewers for their help and comments on an earlier draft of this paper and to Jing Lou for assistance in configuring a test environment.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Acknowledgements", "sec_num": null } ], "bib_entries": { "BIBREF0": { "ref_id": "b0", "title": "Phrase-based information retrieval", "authors": [ { "first": "A", "middle": [ "T" ], "last": "Arampatzis", "suffix": "" }, { "first": "T", "middle": [], "last": "Tsoris", "suffix": "" }, { "first": "C", "middle": [ "H A" ], "last": "Koster", "suffix": "" }, { "first": "T", "middle": [ "P" ], "last": "Van Der Weide", "suffix": "" } ], "year": 1998, "venue": "Information Processing and Management", "volume": "34", "issue": "", "pages": "693--707", "other_ids": {}, "num": null, "urls": [], "raw_text": "Arampatzis, A. T., T. Tsoris, C. H. A. Koster, T. P. Van Der Weide. (1998) \"Phrase-based information retrieval\", Information Processing and Management 34:693-707.", "links": null }, "BIBREF1": { "ref_id": "b1", "title": "Computing Representations of the Structure of Written Discourse", "authors": [ { "first": "S", "middle": [ "H" ], "last": "Corston-Oliver", "suffix": "" } ], "year": 1998, "venue": "", "volume": "", "issue": "", "pages": "", "other_ids": {}, "num": null, "urls": [], "raw_text": "Corston-Oliver, S. H. (1998) Computing Representations of the Structure of Written Discourse. Ph.D. dissertation. University of California, Santa Barbara.", "links": null }, "BIBREF2": { "ref_id": "b2", "title": "Experiments in Automatic Phrase Indexing for Document Retrieval: A Comparison of Syntactic and Non-syntactic Methods", "authors": [ { "first": "J", "middle": [ "L" ], "last": "Fagan", "suffix": "" } ], "year": 1988, "venue": "", "volume": "", "issue": "", "pages": "", "other_ids": {}, "num": null, "urls": [], "raw_text": "Fagan, J. L. (1988) Experiments in Automatic Phrase Indexing for Document Retrieval: A Comparison of Syntactic and Non-syntactic Methods. Ph.D. dissertation. Cornell University.", "links": null }, "BIBREF3": { "ref_id": "b3", "title": "Intelligent writing assistance", "authors": [ { "first": "G", "middle": [], "last": "Heidorn", "suffix": "" } ], "year": 1999, "venue": "A Handbook of Natural Language Processing Techniques. Marcel Dekker", "volume": "", "issue": "", "pages": "", "other_ids": {}, "num": null, "urls": [], "raw_text": "Heidorn, G. (1999) \"Intelligent writing assistance.\" To appear in Dale, R., H. Moisl and H. Somers (eds.), A Handbook of Natural Language Processing Techniques. Marcel Dekker.", "links": null }, "BIBREF4": { "ref_id": "b4", "title": "Annotating the World Wide Web Using Natural Language", "authors": [ { "first": "B", "middle": [], "last": "Katz", "suffix": "" } ], "year": 1997, "venue": "Proceedings of RIAO 97, Computer-assisted Information Search on lnternet", "volume": "1", "issue": "", "pages": "136--155", "other_ids": {}, "num": null, "urls": [], "raw_text": "Katz, B. (1997) \"Annotating the World Wide Web Using Natural Language.\" Proceedings of RIAO 97, Computer-assisted Information Search on lnternet, McGill University, Quebec, Canada, 25- 27 June 1997. Vol. 1:136-155.", "links": null }, "BIBREF5": { "ref_id": "b5", "title": "Relational Propositions in Discourse", "authors": [ { "first": "W", "middle": [ "C" ], "last": "Mann", "suffix": "" }, { "first": "S", "middle": [ "A" ], "last": "Thompson", "suffix": "" } ], "year": 1986, "venue": "Discourse Processes", "volume": "9", "issue": "", "pages": "57--90", "other_ids": {}, "num": null, "urls": [], "raw_text": "Mann, W. C. and Thompson, S. A. (1986) \"Relational Propositions in Discourse.\" Discourse Processes 9:57-90.", "links": null }, "BIBREF6": { "ref_id": "b6", "title": "Rhetorical Structure Theory: Toward a functional theory of text organization", "authors": [ { "first": "W", "middle": [ "C" ], "last": "Mann", "suffix": "" }, { "first": "S", "middle": [ "A" ], "last": "Thompson", "suffix": "" } ], "year": 1988, "venue": "Text", "volume": "8", "issue": "", "pages": "243--281", "other_ids": {}, "num": null, "urls": [], "raw_text": "Mann, W. C. and Thompson, S. A. (1988) \"Rhetorical Structure Theory: Toward a functional theory of text organization.\" Text 8:243-281.", "links": null }, "BIBREF7": { "ref_id": "b7", "title": "The structure of discourse and 'subordination'", "authors": [ { "first": "C", "middle": [], "last": "Matthiessen", "suffix": "" }, { "first": "S", "middle": [ "A" ], "last": "Thompson", "suffix": "" } ], "year": 1988, "venue": "Clause Combining in Grammar and Discourse. John Benjamins: Amsterdam and Philadelphia", "volume": "", "issue": "", "pages": "275--329", "other_ids": {}, "num": null, "urls": [], "raw_text": "Matthiessen, C. and Thompson, S. A. (1988) \"The structure of discourse and 'subordination'.\" In Haiman, J. and S. A. Thompson, (eds.). 1988. Clause Combining in Grammar and Discourse. John Benjamins: Amsterdam and Philadelphia. 275-329.", "links": null } }, "ref_entries": { "TABREF2": { "type_str": "table", "html": null, "text": "", "content": "
AlgorithmPrecisionRecall F% Change% Change in
in F 5index size
Baseline NLM34.343.238.240.000.0
Subordinate clauses35.940.237.93-0.82-31.4
Table 2 Alta Vista: Average effect of eliminating one third of terms
PrecisionRecallF% Change% Change in
in Findex size
36.936.436.65-4.34-28.8
", "num": null }, "TABREF3": { "type_str": "table", "html": null, "text": "", "content": "
PrecisionRecallF% Change% Change in
in Findex size
28.37.511.86-68.99-73.8
", "num": null }, "TABREF4": { "type_str": "table", "html": null, "text": "", "content": "
AlgorithmPrecisionRecallF% Change% Change in
in Findex size
Baseline NLM34.343.238.240.000.0
ADVCL34.642.137.98-0.67-7.0
ABBCL~34.343.238.240.00-0.3
INFCL34.842.138.10-0.36-11.8
RELCL34.942.638.370.33-7.3
COMPCL34.542.938.240.00-7.4
PRPRTCL34.542.938.240.01-4.2
Because of interactions among the different
clause types, the effects illustrated in
", "num": null }, "TABREF6": { "type_str": "table", "html": null, "text": "", "content": "
AlgorithmPrecisionRecallF% Change% Change in
in Findex size
Baseline NLM39.229.033.340.000.0
Subordinate clauses41.125.931.78-4.91-29.0
", "num": null }, "TABREF7": { "type_str": "table", "html": null, "text": "", "content": "
PrecisionRecall F% Change% Change in
in Findex size
40.223.829.88-11.57-29.5
", "num": null }, "TABREF8": { "type_str": "table", "html": null, "text": "", "content": "
PrecisionRecallF% Change% Change in
in Findex size
40.97.412.53-62.41-77.1
", "num": null }, "TABREF9": { "type_str": "table", "html": null, "text": "", "content": "
AlgorithmPrecisionRecall F% Change% Change in
in Findex size
Baseline NLM39.229.033.340.000.0
ADVCL39.928.433.18-0.47-5.8
ABBCL39.629.033.480.43-0.4
INFCL40.028.333.15-0.57-9.2
RELCL39.728.232.98-1.10-9.5
COMPCL38.928.332.76-1.75-3.3
PRPRTCL39.829.033.550.64-5.5
", "num": null } } } }