Base_JSON/prefixA/json/A00/A00-1026.json

{
    "paper_id": "A00-1026",
    "header": {
        "generated_with": "S2ORC 1.0.0",
        "date_generated": "2023-01-19T01:11:52.328209Z"
    },
    "title": "Extracting Molecular Binding Relationships from Biomedical Text",
    "authors": [
        {
            "first": "Thomas",
            "middle": [
                "C"
            ],
            "last": "Rindflesch",
            "suffix": "",
            "affiliation": {
                "laboratory": "",
                "institution": "National Library of Medicine",
                "location": {
                    "postCode": "8600, 20894",
                    "settlement": "Rockville Pike Bethesda",
                    "region": "MD"
                }
            },
            "email": ""
        },
        {
            "first": "Jayant",
            "middle": [
                "V"
            ],
            "last": "Rajan",
            "suffix": "",
            "affiliation": {
                "laboratory": "",
                "institution": "University of Rochester Rochester",
                "location": {
                    "postCode": "14620",
                    "region": "NY"
                }
            },
            "email": "jayant.rajan@mc.rochester.edu"
        },
        {
            "first": "Lawrence",
            "middle": [],
            "last": "Hunter",
            "suffix": "",
            "affiliation": {
                "laboratory": "",
                "institution": "National Cancer Institute",
                "location": {
                    "addrLine": "7550 Wisconsin Avenue Bethesda",
                    "postCode": "20894"
                }
            },
            "email": "lhunter@nih.gov"
        }
    ],
    "year": "",
    "venue": null,
    "identifiers": {},
    "abstract": "ARBITER is a Prolog program that extracts assertions about macromolecular binding relationships from biomedical text. We describe the domain knowledge and the underspecified linguistic analyses that support the identification of these predications. After discussing a formal evaluation of ARBITER, we report on its application to 491,000 MEDLINE ~ abstracts, during which almost 25,000 binding relationships suitable for entry into a database of macromolecular function were extracted.",
    "pdf_parse": {
        "paper_id": "A00-1026",
        "_pdf_hash": "",
        "abstract": [
            {
                "text": "ARBITER is a Prolog program that extracts assertions about macromolecular binding relationships from biomedical text. We describe the domain knowledge and the underspecified linguistic analyses that support the identification of these predications. After discussing a formal evaluation of ARBITER, we report on its application to 491,000 MEDLINE ~ abstracts, during which almost 25,000 binding relationships suitable for entry into a database of macromolecular function were extracted.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Abstract",
                "sec_num": null
            }
        ],
        "body_text": [
            {
                "text": "Far more scientific information exists in the literature than in any structured database. Convenient access to this information could significantly benefit research activities in various fields. The emerging technology of information extraction (Appelt and Israel 1997, Hearst 1999) provides a means of gaining access to this information. In this paper we report on a project to extract biomolecular data from biomedical text. We concentrate on molecular binding affinity, which provides a strong indication of macromolecular function and is a core phenomenon in molecular biology. Our ultimate goal is to automatically construct a database of binding relationships asserted in MEDLINE citations.",
                "cite_spans": [
                    {
                        "start": 245,
                        "end": 256,
                        "text": "(Appelt and",
                        "ref_id": "BIBREF2"
                    },
                    {
                        "start": 257,
                        "end": 282,
                        "text": "Israel 1997, Hearst 1999)",
                        "ref_id": null
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Introduction",
                "sec_num": null
            },
            {
                "text": "The National Library of Medicine's MEDLINE textual database is an online repository of more than 10 million citations from the biomedical literature. All citations contain the title of the corresponding article along with other bibliographic information. In addition, a large number of citations contain author-supplied abstracts. Initial studies indicate that there are ap-proximately 500,000 MEDLINE citations relevant to molecular binding affinity.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Introduction",
                "sec_num": null
            },
            {
                "text": "Our decision to apply information extraction technology to binding relationships was guided not only by the biological importance of this phenomenon but also by the relatively straightforward syntactic cuing of binding predications in text. The inflectional forms of a single verb, bind, indicate this relationship in the vast majority of cases, and our initial work is limited to these instances. For example, our goal in this project is to extract the binding predications in (2) from the text in (1).",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Introduction",
                "sec_num": null
            },
            {
                "text": "(1) CC chemokine receptor 1 (CCR1) is expressed in neutrophils, monocytes, lymphocytes, and eosinophils, and binds the leukocyte chemoattractant and hematopoiesis regulator macrophage inflammatory protein (MIP)-1 alpha, as well as several related CC chemokines.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Introduction",
                "sec_num": null
            },
            {
                "text": "(2) <CC chemokine receptor 1> BINDS <leukocyte chemoattractant> <CC chemokine receptor 1> BINDS <hematopoiesis regulator macrophage inflammatory protein-1 alpha> <CC chemokine receptor 1> BINDS <related CC chemokine> Considerable interest in information extraction has concentrated on identifying named entities in text pertaining to current events (for example, Wacholder et al. 1997, Voorhees and Harman 1998, and MUC-7) ; however, several recent efforts have been directed at biomolecular data (Blaschke et al. 1999 , Craven and Kumlien 1999 , and Rindflesch et al. 2000 . The overall goal is to transform the information encoded in text into a more readily accessible tbrmat, typically a template with slots named for the participants in the scenario of interest. The template for molecular binding can be thought of as a simple predication with predicate \"bind\" and two arguments which participate (symmetrically) in the relationship: BINDS(<X>, <Y>).",
                "cite_spans": [
                    {
                        "start": 363,
                        "end": 398,
                        "text": "Wacholder et al. 1997, Voorhees and",
                        "ref_id": null
                    },
                    {
                        "start": 399,
                        "end": 415,
                        "text": "Harman 1998, and",
                        "ref_id": "BIBREF22"
                    },
                    {
                        "start": 416,
                        "end": 422,
                        "text": "MUC-7)",
                        "ref_id": null
                    },
                    {
                        "start": 497,
                        "end": 518,
                        "text": "(Blaschke et al. 1999",
                        "ref_id": "BIBREF5"
                    },
                    {
                        "start": 519,
                        "end": 544,
                        "text": ", Craven and Kumlien 1999",
                        "ref_id": "BIBREF7"
                    },
                    {
                        "start": 545,
                        "end": 573,
                        "text": ", and Rindflesch et al. 2000",
                        "ref_id": "BIBREF20"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Introduction",
                "sec_num": null
            },
            {
                "text": "Various strategies, both linguistic and statistical, have been used in information extraction efforts. We introduce a Prolog program called ARBITER (Assess and Retrieve Binding Terminology) that takes advantage of an existing domain knowledge source and relies on syntactic cues provided by a partial parser in order to identify and extract binding relations from text. We discuss the syntactic processing used and then report on a formal evaluation of ARBITER against a test collection of 116 MEDLINE citations in which the binding relations were marked by hand. Finally, we provide a brief overview of the results of applying ARBITER to the 500,000 MEDLINE citations discussing molecular binding affinity.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Introduction",
                "sec_num": null
            },
            {
                "text": "Our strategy for extracting binding relationships from text divides the task into two phases: During the first phase we identify all potential binding arguments, and then in the second phase we extract just those binding terms which are asserted in the text as participating in a particular binding predication. In support of this processing, we rely on the linguistic and domain knowledge contained in the National Library of Medicine's Unified Medical Language System ~ (UMLS \u00ae) as well an existing tool, the SPECIALIST minimal commitment parser (Aronson et al. 1994) . The UMLS (Humphreys et al. 1998) consists of several knowledge sources applicable in the biomedical domain: the Metathesaums, Semantic Network, and SPECIALIST Lexicon (McCray et al. 1994) . The Metathesaurus was constructed from more than forty controlled vocabularies and contains more than 620,000 biomedical concepts. The characteristic of the Metathesaurus most relevant for this project is that each concept is associated with a semantic type that categorizes the concept into subareas of biology or medicine. Examples pertinent to binding terminology include the semantic types 'Amino Acid, Peptide, or Protein' and 'Nucleotide Sequence'. The SPECIALIST Lexicon (with associated lexical access tools) supplies syntactic information for a large compilation of biomedical and general English terms.",
                "cite_spans": [
                    {
                        "start": 548,
                        "end": 569,
                        "text": "(Aronson et al. 1994)",
                        "ref_id": "BIBREF3"
                    },
                    {
                        "start": 581,
                        "end": 604,
                        "text": "(Humphreys et al. 1998)",
                        "ref_id": "BIBREF12"
                    },
                    {
                        "start": 739,
                        "end": 759,
                        "text": "(McCray et al. 1994)",
                        "ref_id": "BIBREF13"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Extracting Binding Relationships from Text",
                "sec_num": "1"
            },
            {
                "text": "The SPECIALIST minimal commitment parser relies on the SPECIALIST Lexicon as well as the Xerox stochastic tagger (Cutting et al. 1992) . The output produced is in the tradition of partial parsing (Hindle 1983 , McDonald 1992 , Weischedel et al. 1993 ) and concentrates on the simple noun phrase, what Weischedel et al. (1993) call the \"core noun phrase,\" that is a noun phrase with no modification to the right of the head. Several approaches provide similar output based on statistics (Church 1988 , Zhai 1997 , for example), a finite-state machine (Ait-Mokhtar and Chanod 1997), or a hybrid approach combining statistics and linguistic rules (Voutilainen and Padro 1997).",
                "cite_spans": [
                    {
                        "start": 113,
                        "end": 134,
                        "text": "(Cutting et al. 1992)",
                        "ref_id": "BIBREF8"
                    },
                    {
                        "start": 196,
                        "end": 208,
                        "text": "(Hindle 1983",
                        "ref_id": "BIBREF11"
                    },
                    {
                        "start": 209,
                        "end": 224,
                        "text": ", McDonald 1992",
                        "ref_id": "BIBREF14"
                    },
                    {
                        "start": 225,
                        "end": 249,
                        "text": ", Weischedel et al. 1993",
                        "ref_id": "BIBREF25"
                    },
                    {
                        "start": 301,
                        "end": 325,
                        "text": "Weischedel et al. (1993)",
                        "ref_id": "BIBREF25"
                    },
                    {
                        "start": 486,
                        "end": 498,
                        "text": "(Church 1988",
                        "ref_id": "BIBREF6"
                    },
                    {
                        "start": 499,
                        "end": 510,
                        "text": ", Zhai 1997",
                        "ref_id": "BIBREF26"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Extracting Binding Relationships from Text",
                "sec_num": "1"
            },
            {
                "text": "The SPECIALIST parser is based on the notion of barrier words (Tersmette et al. 1988) , which indicate boundaries between phrases. After lexical look-up and resolution of category label ambiguity by the Xerox tagger, complementizers, conjunctions, modals, prepositions, and verbs are marked as boundaries. Subsequently, boundaries are considered to open a new phrase (and close the preceding phrase). Any phrase containing a noun is considered to be a (simple) noun phrase, and in such a phrase, the right-most noun is labeled as the head, and all other items (other than determiners) are labeled as modifiers. An example of the output from the SPECIALIST parser is given below in (4). The partial parse produced serves as the basis for the first phase of extraction of binding relationships, namely the identification of those simple noun phrases acting as potential binding arguments (referred to as \"binding terms\").",
                "cite_spans": [
                    {
                        "start": 62,
                        "end": 85,
                        "text": "(Tersmette et al. 1988)",
                        "ref_id": "BIBREF21"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Extracting Binding Relationships from Text",
                "sec_num": "1"
            },
            {
                "text": "In order to identify binding terminology in text we rely on the approach discussed in (Rindfiesch et al. 1999) . Text with locally-defined acronyms expanded is submitted to the Xerox tagger and the SPECIALIST parser. Subsequent processing concentrates on the heads of simple noun phrases and proceeds in a series of cascaded steps that depend on existing domain knowledge as well as several small, special-purpose resources in order to determine whether each noun phrase encountered is to be considered a binding term.",
                "cite_spans": [
                    {
                        "start": 86,
                        "end": 110,
                        "text": "(Rindfiesch et al. 1999)",
                        "ref_id": null
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Identifying binding terminology",
                "sec_num": "1.1"
            },
            {
                "text": "As the first step in the process, an existing program, MetaMap, (Aronson et al. 1994) attempts to map each simple noun phrase to a concept in the UMLS Metathesaurus. The semantic type for concepts corresponding to successfully mapped noun phrases is then checked against a small subset of UMLS semantic types referring to bindable entities, such as 'Amino Acid, Peptide, or Protein', 'Nucleotide Sequence', 'Carbohydrate', 'Cell', and 'Virus'. For concepts with a semantic type in this set, the corresponding noun phrase is considered to be a binding",
                "cite_spans": [
                    {
                        "start": 64,
                        "end": 85,
                        "text": "(Aronson et al. 1994)",
                        "ref_id": "BIBREF3"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Identifying binding terminology",
                "sec_num": "1.1"
            },
            {
                "text": "The heads of noun phrases that do not map to a concept in the Metathesaurus are tested against a small set of general \"binding words,\" which often indicate that the noun phrase in which they appear is a binding term. The set of binding words includes such nouns as cleft, groove, membrane, ligand, motif, receptor, domain, element, and molecule.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "term.",
                "sec_num": null
            },
            {
                "text": "The head of a noun phrase that did not submit to the preceding steps is examined to see whether it adheres to the morphologic shape of a normal English word. In this context such a word is often an acronym not defined locally and indicates the presence of a binding term (Fukuda et al. 1998) . A normal English word has at least one vowel and no digits, and a text token that contains at least one letter and is not a norreal English word functions as a binding word in this context. The final step in identifying binding terms is to join contiguous simple noun phrases qualifying as binding terms into a single macro-noun phrase. Rindflesch et al. (1999) use the term \"macro-noun phrase\" to refer to structures that include reduced relative clauses (commonly introduced by prepositions or participles) as well as appositives. Two binding terms joined by a form of be are also treated as though they formed a macro-noun phrase, as in Jel42 is an IgG which binds ...",
                "cite_spans": [
                    {
                        "start": 271,
                        "end": 291,
                        "text": "(Fukuda et al. 1998)",
                        "ref_id": "BIBREF9"
                    },
                    {
                        "start": 631,
                        "end": 655,
                        "text": "Rindflesch et al. (1999)",
                        "ref_id": "BIBREF19"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "term.",
                "sec_num": null
            },
            {
                "text": "The results of identifying binding terms (and thus potential binding arguments) are given in (4) for the sentence in (3). In (4) evidence supporting identification as a binding term is given in braces. Note that in the underspecified syntactic analysis, prepositional phrases are treated as (simple) noun phrases that have a preposition as their first member.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "term.",
                "sec_num": null
            },
            {
                "text": "(3) Je142 is an IgG which binds to the small bacterial protein, HPr and the structure of the complex is known at high resolution.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "term.",
                "sec_num": null
            },
            {
                "text": "(4) [binding_term([ head(Je142) ",
                "cite_spans": [
                    {
                        "start": 4,
                        "end": 31,
                        "text": "[binding_term([ head(Je142)",
                        "ref_id": null
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "term.",
                "sec_num": null
            },
            {
                "text": "Before addressing the strategy for determining the arguments of binding predications, we discuss the general treatment of macro-noun phrases during the second part of the processing. Although ARBITER attempts to recover complete macro-noun phrases during the first phase, only the most specific (and biologically useful) part of a macro-noun phrase is recovered during the extraction of binding predications. Terms referring to specific molecules are more useful than those referring to general classes of bindable entities, such as receptor, ligand, protein, or molecule. The syntactic head of a macro-noun phrase (the first simple noun phrase in the list) is not always the most specific or most useful term in the construction.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Identifying binding terms as arguments of relationships",
                "sec_num": "1.2"
            },
            {
                "text": "The Specificity Rule for determining the most specific part of the list of simple binding terms constituting a macro-noun phrase chooses the first simple term in the list which has either of the following two characteristics: a) The head was identified by the Morphology Shape Rule. b) The noun phrase maps to a UMLS concept having one of the following semantic types: 'Amino Acid, Peptide, or Protein', 'Nucleic Acid, Nucleoside, or Nucleotide', 'Nucleotide Sequence', 'Immunologic Factor', or 'Gene or Genome'. For example, in (5), the second simple term, TNF-alpha promoter, maps to the Metathesaurus with semantic type 'Nucleotide Sequence' and is thus considered to be the most specific term in this complex-noun phrase. In identifying binding terms as arguments of a complete binding predication, as indicated above, we examine only those binding relations cued by some form of the verb bind (bind, binds, bound, and binding) . The list of minimal syntactic phrases constituting the partial parse of the input sentence is examined from left to right; for each occurrence of a form of binds, the two binding terms serving as arguments are then sought. (During the tagging process, we force bind, binds, and bound to be labeled as \"verb,\" and binding as \"noun.\") A partial analysis of negation and coordination is undertaken by ARBITER, but anaphora resolution and a syntactic treatment of relativization are not attempted. With the added constraint that a binding argument must have been identified as a binding term based on the domain knowledge resources used, the partial syntactic analysis available to ARBITER supports the accurate identification of a large number of binding predications asserted in the research literature.",
                "cite_spans": [
                    {
                        "start": 898,
                        "end": 931,
                        "text": "(bind, binds, bound, and binding)",
                        "ref_id": null
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "l_qt~",
                "sec_num": null
            },
            {
                "text": "It is convenient to categorize binding predications into two classes depending on which form of bind cues the predication: a) binding and b) bind, binds, and bound. In our test collection (discussed below), about half of the binding re-lationships asserted in the text are cued by the gerundive or participial form binding. In this syntactic predication, the resources available from the underspecified syntactic parse serve quite well as the basis for correctly identifying the arguments of the binding relationship.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Arguments of binding",
                "sec_num": "1.2.1"
            },
            {
                "text": "The ",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Arguments of binding",
                "sec_num": "1.2.1"
            },
            {
                "text": "The arguments of forms of bind other than binding invariably occur on either side of the cuing verb form. The default strategy for identifying both arguments in these instances is to choose the closest binding term on either side of the verb. In the cases we have investigated, this strategy works often enough to be useful for the surface object. However, due to predicate coordination as well as relativization, such a strategy often fails to identify correctly the surface subject of bind (binds or bound) when more than one binding term precedes the verb. We therefore use the strategy summarized in (7) for recovering the surface subject in such instances.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Arguments of bind",
                "sec_num": "1.2.2"
            },
            {
                "text": "(7) When more than one binding term precedes a form of bind other than binding, choose the most specific of these binding terms as the surface subject of the predication.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Arguments of bind",
                "sec_num": "1.2.2"
            },
            {
                "text": "\"Most specific\" is determined (recursively) for a series of binding terms in the same way that the most specific part of a complex binding term is determined.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Arguments of bind",
                "sec_num": "1.2.2"
            },
            {
                "text": "The input text (8) provides an example of a binding predication cued by binds in which the arguments appear (immediately) on either side of the cuing verb. The two macro-noun phrases serving as potential arguments are underlined.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Arguments of bind",
                "sec_num": "1.2.2"
            },
            {
                "text": "(8) A transcription factor, Auxin Response Factor 1, that binds to tl!e sequence TGTCTC in auxin response elements was cloned from Arabidopsis by using a yeast one-hybrid system.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Arguments of bind",
                "sec_num": "1.2.2"
            },
            {
                "text": "(9) <auxin response factor 1> BINDS <sequence tgtctc>",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Arguments of bind",
                "sec_num": "1.2.2"
            },
            {
                "text": "In the extracted binding relationship in (9), the Specificity Rule chooses Auxin Response Factor 1 from the first macro-noun phrase because it maps to the UMLS Metathesaurus with semantic type 'Amino Acid, Peptide, or Protein'. In the second argument, the sequence TGTCTC has a head that submits to the Morphology Shape Rule and hence is considered to be more specific than auxin response elements.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Arguments of bind",
                "sec_num": "1.2.2"
            },
            {
                "text": "In (10), the Specificity Rule applies correctly to select the surface subject of the binding predication when multiple binding terms appear to the left of the verb.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Arguments of bind",
                "sec_num": "1.2.2"
            },
            {
                "text": "(10) Phosphatidylinositol transfer protein has a single lipid-binding site that can reversibly bind phosphatidylinositol and phosphatidylcholine and transfer these lipids between membrane compartments in vitro.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Arguments of bind",
                "sec_num": "1.2.2"
            },
            {
                "text": "<phosphatidylinositol transfer protein> BINDS <phosphatidylcholine> <phosphatidylinositol transfer protein>",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Arguments of bind",
                "sec_num": "1.2.2"
            },
            {
                "text": "Both Phosphatidylinositol transfer protein and a single lipid-binding site occur to the left of bind and have been identified as binding terms by the first phase of processing. However, Phosphatidylinositol transfer protein maps to the corresponding Metathesaurus concept with semantic type 'Amino Acid, Peptide, or Protein, thus causing it to be more specific than a single lipidbinding site. The second predication listed in (10) was correctly extracted due to coordination processing.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "BINDS <phosphatidylinositol>",
                "sec_num": null
            },
            {
                "text": "ARBITER pursues limited coordination identification in the spirit of Agarwal and Boggess (1992) and Rindflesch (1995) . Only binding terms are considered as candidates for coordination. For each conjunction encountered, the phrase immediately to the right is examined; if it is a binding term, all contiguous binding terms occurring immediately to the left of the conjunct are considered to be coordinate with the right conjunct. Coordination inside the simple noun phrase is not considered, and therefore structures such as The TCR alpha beta or -gamma delta chains are not recognized. Nonetheless, as indicated in (11), this limited approach to noun phrase coordination is often effective.",
                "cite_spans": [
                    {
                        "start": 100,
                        "end": 117,
                        "text": "Rindflesch (1995)",
                        "ref_id": "BIBREF18"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "BINDS <phosphatidylinositol>",
                "sec_num": null
            },
            {
                "text": "(11) Purified recombinant NC 1, like authentic NC 1, also bound specifically to fibronectin, collagen type I, and a laminin 5/6 complex. <authentic ncl> BINDS <laminin 5 / 6 complex> <authentic ncl > BINDS <collagen type i> <authentic ncl> BINDS <fibronectin> <purified recombinant ncl > BINDS <laminin 5 / 6 complex> <purified recombinant ncl> BINDS <collagen type i> <purified recombinant ncl > BINDS <fibronectin> Although the particular underspecified syntactic analysis used in the identification of binding predications in the biomedical research literature is limited in several important ways, it appears adequate to enable this project with a useful level of effectiveness, and this is supported by evaluation.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "BINDS <phosphatidylinositol>",
                "sec_num": null
            },
            {
                "text": "In order to determine ARBITER's effectiveness, the program was formally evaluated against a gold standard of MEDLINE citations in which the binding predications asserted were marked by hand. A search of MEDLINE limited to one month (June 1997) and based on the text words ((bind, binds, binding, or bound) and (protein or proteins)) retrieved 116 citations with 1,141 sentences; of these, 346 contained some form of the verb bind. 260 binding predications were identified in the binding sentences. (The binding sentences also contained 2,025 simple noun phrases, 1,179 of which were marked as being binding terms.)",
                "cite_spans": [
                    {
                        "start": 272,
                        "end": 305,
                        "text": "((bind, binds, binding, or bound)",
                        "ref_id": null
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Evaluation",
                "sec_num": "2"
            },
            {
                "text": "In processing this test collection, ARBITER extracted 181 binding predications, 132 of which were correct. Since ARBITER missed 128 marked binding predications (false negatives) and incorrectly identified 49 such relationships, recall and precision as measures of effectiveness are 51% and 73%, respectively.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Evaluation",
                "sec_num": "2"
            },
            {
                "text": "In comparing ARBITER's output against that marked in the gold standard, fairly stringent matching criteria were used. A binding predication extracted from a particular sentence by ARBITER had to appear in that same sentence in the gold standard (not just the same citation) in order to be counted as correct. Further, in the gold standard, only the most specific component of a macro-noun phrase was marked as being the correct argument for a particular binding predication. If ARBITER retrieved any other part of a macro-noun phrase in identifying the arguments of that predication, it was assessed as an error.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Evaluation",
                "sec_num": "2"
            },
            {
                "text": "A large number of ARBITER errors are due to two phenomena: difficulties in correctly identifying binding terms during the first phase of processing and syntactic complexity confounding argument identification during the second phase. An example of the first error type is seen in (12), where the failure to identify ran as a binding term caused ARBITER to miss the correct binding predication asserted in this sentence (indicated by \"-FN->\").",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Evaluation",
                "sec_num": "2"
            },
            {
                "text": "(12) Requirement of guanosine triphosphatebound ran for signal-mediated nuclear protein export.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Evaluation",
                "sec_num": "2"
            },
            {
                "text": "-FN-> <guanosine triphosphate> BINDS <Ran> -FP-> < guanosine triphosphate> BINDS <signal -mediate nuclear protein export>",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Evaluation",
                "sec_num": "2"
            },
            {
                "text": "This error then led to the false positive error (\"-FP->\") when the program wrongly interpreted the next noun phrase in the sentence (signalmediated nuclear protein export) as the second argument in this predication. The interaction of coordination and negation in (13) caused ARBITER to partially misinterpret the binding predications in this sentence. Although some of the coordination in (13) was processed properly, resulting in the relationships listed, the negated coordination associated with the noun phrase visual arrestin was not interpreted correctly, and thus ARBITER failed to identify the predication marked as a false negative.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Evaluation",
                "sec_num": "2"
            },
            {
                "text": "As an initial application of ARBITER we ran the program on 491,356 MEDLINE citations, which were retrieved using the same search strategy responsible for the gold standard. During this run, 331,777 sentences in 192,997 citations produced 419,782 total binding assertions. Extrapolating from the gold standard evaluation, we assume that this is about half of the total binding predications asserted in the citations processed and that somewhat less than three quarters of those extracted are correct. The initial list of 419,982 binding triples represents what ARBITER determined was asserted in the text being processed. Many of these assertions, such as those in (14), while correct, are too general to be useful. 14<receptors> BINDS <Peptides> <Erythrocytes> BINDS <Antibodies> Further processing on ARBITER raw output extracted specific protein names and genomic structures and reduced the number of such binding predications to 345,706. From these more specific binding predication, we began the construction of a database containing binding relations asserted in the literature. More detailed discussion of this database can be found in (Rajan et al. in prep); however, here we give an initial description of its characteristics.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Application",
                "sec_num": "3"
            },
            {
                "text": "We submitted the 345,706 more specific ARBITER binding predications to a search in GenBank (Benson et al. 1998) and determined that 106,193 referred to a GenBank entry. The number of Genbank entries with at least one binding assertion is 11,617. Preliminary results indicate that the database we are constructing will have some of the following characteristics:",
                "cite_spans": [
                    {
                        "start": 91,
                        "end": 111,
                        "text": "(Benson et al. 1998)",
                        "ref_id": null
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Application",
                "sec_num": "3"
            },
            {
                "text": "\u2022 10,769 bindings between two distinct Genbank entries (5,569 unique) \u2022 875 more binding assertions found between an entry and a specific DNA sequence",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Application",
                "sec_num": "3"
            },
            {
                "text": "\u2022 27,345 bindings between a Genbank entry and a UMLS Metathesaurus concept \u2022 5,569 unique relationships among pairs of entries (involving 11,617 unique entries)",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Application",
                "sec_num": "3"
            },
            {
                "text": "The cooperation of structured domain knowledge and underspecified syntactic analysis enables the extraction of macromolecular binding relationships from the research literature. Although our implementation is domain-specific, the underlying principles are amenable to broader applicability. ARBITER makes a distinction between first labeling binding terms and then identifying certain of these terms as arguments in a binding predication. The first phase of this processing is dependent on biomedical domain knowledge accessible from the UMLS. Applying the techniques we propose in other areas would require at least a minimum of semantic classification of the concepts involved. General, automated techniques that could supply this requirement are becoming increasingly available (Morin and Jacquemin 1999, for example).",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Conclusion",
                "sec_num": null
            },
            {
                "text": "Although we concentrated on the inflectional forms of a single verb, the principles we invoke to support argument identification during the second phase of processing apply generally to English predication encoding strategies (with a minimum of effort necessary to address prepositional cuing of gerundive arguments for specific verbs). The approach to noun phrase coordination also applies generally, so long as hypernymic classification is available for the heads of the potential conjuncts.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Conclusion",
                "sec_num": null
            }
        ],
        "back_matter": [
            {
                "text": "We are grateful to John Wilbur for assistance with accessing GenBank, to Alan Aronson for modifications to MetaMap, and to James Mork for providing the distributed system that supported the processing of MEDLINE citations.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Acknowledgements",
                "sec_num": null
            }
        ],
        "bib_entries": {
            "BIBREF0": {
                "ref_id": "b0",
                "title": "A simple but useful approach to conjunct identification",
                "authors": [
                    {
                        "first": "R",
                        "middle": [],
                        "last": "Agaxwal",
                        "suffix": ""
                    },
                    {
                        "first": "L",
                        "middle": [],
                        "last": "Boggess",
                        "suffix": ""
                    }
                ],
                "year": 1992,
                "venue": "Proceedings of the 30th Annual Meeting of the Association for Computational Linguistics",
                "volume": "",
                "issue": "",
                "pages": "15--21",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Agaxwal R. and Boggess L. (1992) A simple but use- ful approach to conjunct identification. Proceed- ings of the 30th Annual Meeting of the Associa- tion for Computational Linguistics, pp. 15-21.",
                "links": null
            },
            "BIBREF1": {
                "ref_id": "b1",
                "title": "Incremental finite-state parsing",
                "authors": [
                    {
                        "first": "S",
                        "middle": [],
                        "last": "Ait-Mokhtar",
                        "suffix": ""
                    },
                    {
                        "first": "Chanod J.-P",
                        "middle": [],
                        "last": "",
                        "suffix": ""
                    }
                ],
                "year": 1997,
                "venue": "Proceedings of the Fifth Conference on Applied Natural Language Processing",
                "volume": "",
                "issue": "",
                "pages": "72--81",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Ait-Mokhtar S. and Chanod J.-P. (1997) Incremental finite-state parsing. Proceedings of the Fifth Con- ference on Applied Natural Language Processing, pp. 72-9.",
                "links": null
            },
            "BIBREF2": {
                "ref_id": "b2",
                "title": "Tutorial on building information extraction systems",
                "authors": [
                    {
                        "first": "D",
                        "middle": [
                            "E"
                        ],
                        "last": "Appelt",
                        "suffix": ""
                    },
                    {
                        "first": "D",
                        "middle": [],
                        "last": "Israel",
                        "suffix": ""
                    }
                ],
                "year": 1997,
                "venue": "Fifth Conference on Applied Natural Language Processing",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Appelt D. E. and Israel D. (1997) Tutorial on build- ing information extraction systems. Fifth Confer- ence on Applied Natural Language Processing.",
                "links": null
            },
            "BIBREF3": {
                "ref_id": "b3",
                "title": "Exploiting a large thesaurus for information retrieval",
                "authors": [
                    {
                        "first": "A",
                        "middle": [
                            "R"
                        ],
                        "last": "Aronson",
                        "suffix": ""
                    },
                    {
                        "first": "T",
                        "middle": [
                            "C"
                        ],
                        "last": "Rindflesch",
                        "suffix": ""
                    },
                    {
                        "first": "A",
                        "middle": [
                            "C"
                        ],
                        "last": "Browne",
                        "suffix": ""
                    }
                ],
                "year": 1994,
                "venue": "Proceedings of RIAO 94",
                "volume": "",
                "issue": "",
                "pages": "197--216",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Aronson A. R., Rindflesch T. C., and Browne A. C. (1994) Exploiting a large thesaurus for informa- tion retrieval. Proceedings of RIAO 94, pp. 197- 216.",
                "links": null
            },
            "BIBREF5": {
                "ref_id": "b5",
                "title": "Automatic extraction of biological information from scientific text: protein-protein interactions",
                "authors": [
                    {
                        "first": "C",
                        "middle": [],
                        "last": "Blaschke",
                        "suffix": ""
                    },
                    {
                        "first": "M",
                        "middle": [
                            "A"
                        ],
                        "last": "Andrade",
                        "suffix": ""
                    },
                    {
                        "first": "C",
                        "middle": [],
                        "last": "Ouzounis",
                        "suffix": ""
                    },
                    {
                        "first": "Valencia",
                        "middle": [
                            "A"
                        ],
                        "last": "",
                        "suffix": ""
                    }
                ],
                "year": 1999,
                "venue": "Intelligent Systems for Molecular Biology (ISMB)",
                "volume": "7",
                "issue": "",
                "pages": "60--67",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Blaschke C., Andrade M. A., Ouzounis C., and Va- lencia A. (1999) Automatic extraction of biological information from scientific text: protein-protein interactions. Intelligent Systems for Molecular Bi- ology (ISMB), 7, pp. 60-7.",
                "links": null
            },
            "BIBREF6": {
                "ref_id": "b6",
                "title": "A stochastic parts program and noun phrase parser for unrestricted text",
                "authors": [
                    {
                        "first": "K",
                        "middle": [
                            "W"
                        ],
                        "last": "Church",
                        "suffix": ""
                    }
                ],
                "year": 1988,
                "venue": "Proceedings of the Second Conference on Applied Natural Language Processing",
                "volume": "",
                "issue": "",
                "pages": "136--143",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Church K. W. (1988) A stochastic parts program and noun phrase parser for unrestricted text. Proceed- ings of the Second Conference on Applied Natural Language Processing, pp. 136-143.",
                "links": null
            },
            "BIBREF7": {
                "ref_id": "b7",
                "title": "Constructing biological knowledge bases by extracting information from text sources. Intelligent Systems for Molecular",
                "authors": [
                    {
                        "first": "M",
                        "middle": [],
                        "last": "Craven",
                        "suffix": ""
                    },
                    {
                        "first": "J",
                        "middle": [],
                        "last": "Kumlien",
                        "suffix": ""
                    }
                ],
                "year": 1999,
                "venue": "Biology",
                "volume": "7",
                "issue": "",
                "pages": "77--86",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Craven M. and Kumlien J. (1999) Constructing bio- logical knowledge bases by extracting information from text sources. Intelligent Systems for Molecu- lar Biology (ISMB), 7, pp. 77-86.",
                "links": null
            },
            "BIBREF8": {
                "ref_id": "b8",
                "title": "A practical part-of-speech tagger",
                "authors": [
                    {
                        "first": "D",
                        "middle": [
                            "R"
                        ],
                        "last": "Cutting",
                        "suffix": ""
                    },
                    {
                        "first": "J",
                        "middle": [],
                        "last": "Kupiec",
                        "suffix": ""
                    },
                    {
                        "first": "J",
                        "middle": [
                            "O"
                        ],
                        "last": "Pedersen",
                        "suffix": ""
                    },
                    {
                        "first": "P",
                        "middle": [],
                        "last": "Sibun",
                        "suffix": ""
                    }
                ],
                "year": 1992,
                "venue": "Proceedings of the Third Conference on Applied Natural Language Processing",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Cutting D. R., Kupiec J., Pedersen J. O., and Sibun P. (1992) A practical part-of-speech tagger. Pro- ceedings of the Third Conference on Applied Natu- ral Language Processing.",
                "links": null
            },
            "BIBREF9": {
                "ref_id": "b9",
                "title": "Toward information extraction: Identifying protein names from biological papers",
                "authors": [
                    {
                        "first": "F",
                        "middle": [],
                        "last": "Fukuda",
                        "suffix": ""
                    },
                    {
                        "first": "T",
                        "middle": [],
                        "last": "Tsunoda",
                        "suffix": ""
                    },
                    {
                        "first": "A",
                        "middle": [],
                        "last": "Tamura",
                        "suffix": ""
                    },
                    {
                        "first": "T",
                        "middle": [],
                        "last": "Takagi",
                        "suffix": ""
                    }
                ],
                "year": 1998,
                "venue": "Pacific Symposium on Biocomputing (PSB)",
                "volume": "3",
                "issue": "",
                "pages": "705--721",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Fukuda F., Tsunoda T., Tamura A., and Takagi T. (1998) Toward information extraction: Identifying protein names from biological papers. Pacific Symposium on Biocomputing (PSB), 3, pp. 705- 16.",
                "links": null
            },
            "BIBREF10": {
                "ref_id": "b10",
                "title": "Untangling text data mining",
                "authors": [
                    {
                        "first": "M",
                        "middle": [
                            "A"
                        ],
                        "last": "Hearst",
                        "suffix": ""
                    }
                ],
                "year": 1999,
                "venue": "Proceedings of the 37th Annual Meeting of the Association for Computational Linguistics",
                "volume": "",
                "issue": "",
                "pages": "3--10",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Hearst M. A. (1999) Untangling text data mining. Proceedings of the 37th Annual Meeting of the As- sociation for Computational Linguistics, pp. 3-10.",
                "links": null
            },
            "BIBREF11": {
                "ref_id": "b11",
                "title": "Deterministic parsing of syntactic non-fluencies",
                "authors": [
                    {
                        "first": "D",
                        "middle": [],
                        "last": "Hindle",
                        "suffix": ""
                    }
                ],
                "year": 1983,
                "venue": "Proceedings of the 21st Annual Meeting of the Association for Computational Linguistics",
                "volume": "",
                "issue": "",
                "pages": "123--131",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Hindle D. (1983) Deterministic parsing of syntactic non-fluencies. Proceedings of the 21st Annual Meeting of the Association for Computational Lin- guistics, pp. 123-8.",
                "links": null
            },
            "BIBREF12": {
                "ref_id": "b12",
                "title": "The Unified Medical language System: An informatics research collaboration",
                "authors": [
                    {
                        "first": "B",
                        "middle": [
                            "L"
                        ],
                        "last": "Humphreys",
                        "suffix": ""
                    },
                    {
                        "first": "D",
                        "middle": [
                            "A B"
                        ],
                        "last": "Lindberg",
                        "suffix": ""
                    },
                    {
                        "first": "H",
                        "middle": [
                            "M"
                        ],
                        "last": "Schoolman",
                        "suffix": ""
                    },
                    {
                        "first": "G",
                        "middle": [
                            "O"
                        ],
                        "last": "Barnett",
                        "suffix": ""
                    }
                ],
                "year": 1998,
                "venue": "Journal of the American Medical Informatics Association",
                "volume": "",
                "issue": "1",
                "pages": "1--13",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Humphreys B. L., Lindberg D. A. B., Schoolman H. M., and Barnett G. O. (1998) The Unified Medical language System: An informatics research collabo- ration. Journal of the American Medical Informat- ics Association, 5/1, pp. 1-13.",
                "links": null
            },
            "BIBREF13": {
                "ref_id": "b13",
                "title": "Lexical methods for managing variation in biomedical terminologies",
                "authors": [
                    {
                        "first": "A",
                        "middle": [
                            "T"
                        ],
                        "last": "Mccray",
                        "suffix": ""
                    },
                    {
                        "first": "S",
                        "middle": [],
                        "last": "Srinivasan",
                        "suffix": ""
                    },
                    {
                        "first": "A",
                        "middle": [
                            "C"
                        ],
                        "last": "Browne",
                        "suffix": ""
                    }
                ],
                "year": 1994,
                "venue": "Proceedings of the 18th Annual Symposium on Computer Applications in Medical Care",
                "volume": "",
                "issue": "",
                "pages": "235--244",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "McCray A. T., Srinivasan S., and Browne A. C. (1994) Lexical methods for managing variation in biomedical terminologies. Proceedings of the 18th Annual Symposium on Computer Applications in Medical Care, pp. 235-9.",
                "links": null
            },
            "BIBREF14": {
                "ref_id": "b14",
                "title": "Robust partial parsing through incremental, multi-algorithm processing",
                "authors": [
                    {
                        "first": "D",
                        "middle": [
                            "D"
                        ],
                        "last": "Mcdonald",
                        "suffix": ""
                    }
                ],
                "year": 1992,
                "venue": "",
                "volume": "",
                "issue": "",
                "pages": "83--99",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "McDonald D. D. (1992) Robust partial parsing through incremental, multi-algorithm processing. In \"Text-Based Intelligent Systems,\" P. S. Jacobs, ed., pp. 83-99.",
                "links": null
            },
            "BIBREF15": {
                "ref_id": "b15",
                "title": "Projecting corpus-based semantic links on a thesaurus",
                "authors": [
                    {
                        "first": "E",
                        "middle": [],
                        "last": "Morin",
                        "suffix": ""
                    },
                    {
                        "first": "C",
                        "middle": [],
                        "last": "Jacquemin",
                        "suffix": ""
                    }
                ],
                "year": null,
                "venue": "Proceedings of the 37th Annual Meeting of the Association for Computational Linguistics",
                "volume": "",
                "issue": "",
                "pages": "389--96",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Morin E. and Jacquemin C. Projecting corpus-based semantic links on a thesaurus. Proceedings of the 37th Annual Meeting of the Association for Com- putational Linguistics, pp. 389-96.",
                "links": null
            },
            "BIBREF16": {
                "ref_id": "b16",
                "title": "MUC-7. Message Understanding Conference Proceedings",
                "authors": [],
                "year": null,
                "venue": "",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "MUC-7. Message Understanding Conference Pro- ceedings, http://www.muc.saic.com.",
                "links": null
            },
            "BIBREF17": {
                "ref_id": "b17",
                "title": "prep.) Mining MEDLINE",
                "authors": [
                    {
                        "first": "J",
                        "middle": [
                            "V"
                        ],
                        "last": "Rajan",
                        "suffix": ""
                    },
                    {
                        "first": "L",
                        "middle": [],
                        "last": "Hunter",
                        "suffix": ""
                    },
                    {
                        "first": "T",
                        "middle": [
                            "C"
                        ],
                        "last": "Rindflesch",
                        "suffix": ""
                    }
                ],
                "year": null,
                "venue": "",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Rajan J. V., Hunter L., and Rindflesch T. C. (In prep.) Mining MEDLINE.",
                "links": null
            },
            "BIBREF18": {
                "ref_id": "b18",
                "title": "Integrating natural language processing and biomedical domain knowledge for increased information retrieval effectiveness. Proceedings of the 5th Annual Dual-Use Technologies and Applications Conference",
                "authors": [
                    {
                        "first": "T",
                        "middle": [
                            "C"
                        ],
                        "last": "Rindflesch",
                        "suffix": ""
                    }
                ],
                "year": 1995,
                "venue": "",
                "volume": "",
                "issue": "",
                "pages": "260--265",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Rindflesch T. C. (1995) Integrating natural language processing and biomedical domain knowledge for increased information retrieval effectiveness. Pro- ceedings of the 5th Annual Dual-Use Technologies and Applications Conference, pp. 260-5.",
                "links": null
            },
            "BIBREF19": {
                "ref_id": "b19",
                "title": "Mining molecular binding terminology from biomedical text",
                "authors": [
                    {
                        "first": "T",
                        "middle": [
                            "C"
                        ],
                        "last": "Rindflesch",
                        "suffix": ""
                    },
                    {
                        "first": "L",
                        "middle": [],
                        "last": "Hunter",
                        "suffix": ""
                    },
                    {
                        "first": "A",
                        "middle": [
                            "R"
                        ],
                        "last": "Aronson",
                        "suffix": ""
                    }
                ],
                "year": 1999,
                "venue": "Proceedings of the AMIA Annual Symposium",
                "volume": "",
                "issue": "",
                "pages": "127--131",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Rindflesch T. C., Hunter L., and Aronson A. R. (1999) Mining molecular binding terminology from biomedical text. Proceedings of the AMIA Annual Symposium, pp. 127-131.",
                "links": null
            },
            "BIBREF20": {
                "ref_id": "b20",
                "title": "EDGAR: Extraction of drug, s, genes and relations from the biomedical literature",
                "authors": [
                    {
                        "first": "T",
                        "middle": [
                            "C"
                        ],
                        "last": "Rindflesch",
                        "suffix": ""
                    },
                    {
                        "first": "L",
                        "middle": [],
                        "last": "Tanabe",
                        "suffix": ""
                    },
                    {
                        "first": "J",
                        "middle": [
                            "N"
                        ],
                        "last": "Weinstein",
                        "suffix": ""
                    },
                    {
                        "first": "L",
                        "middle": [],
                        "last": "Hunter",
                        "suffix": ""
                    }
                ],
                "year": 2000,
                "venue": "Pacific Symposium on Biocomputing (PSB)",
                "volume": "5",
                "issue": "",
                "pages": "514--539",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Rindflesch T. C., Tanabe L., Weinstein J. N., and Hunter L. (2000) EDGAR: Extraction of drug, s, genes and relations from the biomedical literature. Pacific Symposium on Biocomputing (PSB), 5, pp. 514-25.",
                "links": null
            },
            "BIBREF21": {
                "ref_id": "b21",
                "title": "Barrier word method for detecting molecular biology multiple word terms",
                "authors": [
                    {
                        "first": "K",
                        "middle": [
                            "W F"
                        ],
                        "last": "Tersmette",
                        "suffix": ""
                    },
                    {
                        "first": "A",
                        "middle": [
                            "F"
                        ],
                        "last": "Scott",
                        "suffix": ""
                    },
                    {
                        "first": "G",
                        "middle": [
                            "W"
                        ],
                        "last": "Moore",
                        "suffix": ""
                    },
                    {
                        "first": "N",
                        "middle": [
                            "W"
                        ],
                        "last": "Matheson",
                        "suffix": ""
                    },
                    {
                        "first": "R",
                        "middle": [
                            "E"
                        ],
                        "last": "Miller",
                        "suffix": ""
                    }
                ],
                "year": 1988,
                "venue": "Proceedings of the 12th Annual Symposium on Computer Applications in Medical Care",
                "volume": "",
                "issue": "",
                "pages": "207--218",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Tersmette K. W. F., Scott A. F., Moore G.W., Mathe- son N. W., and Miller R. E. (1988) Barrier word method for detecting molecular biology multiple word terms. Proceedings of the 12th Annual Sym- posium on Computer Applications in Medical Care, pp. 207-11.",
                "links": null
            },
            "BIBREF22": {
                "ref_id": "b22",
                "title": "The Seventh Text Retrieval Conference",
                "authors": [
                    {
                        "first": "E",
                        "middle": [
                            "M"
                        ],
                        "last": "Voorhees",
                        "suffix": ""
                    },
                    {
                        "first": "D",
                        "middle": [
                            "K"
                        ],
                        "last": "Harman",
                        "suffix": ""
                    }
                ],
                "year": 1998,
                "venue": "",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Voorhees E. M. and Harman D. K. (1998) The Sev- enth Text Retrieval Conference.",
                "links": null
            },
            "BIBREF23": {
                "ref_id": "b23",
                "title": "Developing a hybrid NP parser",
                "authors": [
                    {
                        "first": "A",
                        "middle": [],
                        "last": "Vourtilainen",
                        "suffix": ""
                    },
                    {
                        "first": "L",
                        "middle": [],
                        "last": "Padro",
                        "suffix": ""
                    }
                ],
                "year": 1997,
                "venue": "Proceedings of the Fifth Conference on Applied Natural Language Processing",
                "volume": "",
                "issue": "",
                "pages": "80--87",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Vourtilainen A. and Padro L. (1997) Developing a hybrid NP parser. Proceedings of the Fifth Confer- ence on Applied Natural Language Processing, pp. 80-7.",
                "links": null
            },
            "BIBREF24": {
                "ref_id": "b24",
                "title": "Disambiguation of proper names in text",
                "authors": [
                    {
                        "first": "N",
                        "middle": [],
                        "last": "Wacholder",
                        "suffix": ""
                    },
                    {
                        "first": "Y",
                        "middle": [],
                        "last": "Ravin",
                        "suffix": ""
                    },
                    {
                        "first": "M",
                        "middle": [],
                        "last": "Choi",
                        "suffix": ""
                    }
                ],
                "year": 1997,
                "venue": "Proceedings of the Fifth Conference on Applied Natural Language Processing",
                "volume": "",
                "issue": "",
                "pages": "202--208",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Wacholder N., Ravin Y., and Choi M. (1997) Disam- biguation of proper names in text. Proceedings of the Fifth Conference on Applied Natural Language Processing, pp. 202-208.",
                "links": null
            },
            "BIBREF25": {
                "ref_id": "b25",
                "title": "Coping with ambiguity and unknown words through probabilistic models",
                "authors": [
                    {
                        "first": "R",
                        "middle": [],
                        "last": "Weischedel",
                        "suffix": ""
                    },
                    {
                        "first": "M",
                        "middle": [],
                        "last": "Meteer",
                        "suffix": ""
                    },
                    {
                        "first": "R",
                        "middle": [],
                        "last": "Schwartz",
                        "suffix": ""
                    },
                    {
                        "first": "L",
                        "middle": [],
                        "last": "Ramshaw",
                        "suffix": ""
                    },
                    {
                        "first": "Palmucci",
                        "middle": [
                            "J"
                        ],
                        "last": "",
                        "suffix": ""
                    }
                ],
                "year": 1993,
                "venue": "Computational Linguistics",
                "volume": "19",
                "issue": "2",
                "pages": "359--382",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Weischedel R., Meteer M., Schwartz R., Ramshaw L., and Palmucci J. (1993) Coping with ambiguity and unknown words through probabilistic models. Computational Linguistics, 19/2, pp. 359-382.",
                "links": null
            },
            "BIBREF26": {
                "ref_id": "b26",
                "title": "Fast statistical parsing of noun phrases for document indexing",
                "authors": [
                    {
                        "first": "C",
                        "middle": [],
                        "last": "Zhai",
                        "suffix": ""
                    }
                ],
                "year": 1997,
                "venue": "Proceedings of the Fifth Conference on Applied Natural Language Processing",
                "volume": "",
                "issue": "",
                "pages": "312--343",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Zhai C. (1997) Fast statistical parsing of noun phrases for document indexing. Proceedings of the Fifth Conference on Applied Natural Language Processing, pp. 312-31.",
                "links": null
            }
        },
        "ref_entries": {
            "FIGREF0": {
                "type_str": "figure",
                "num": null,
                "uris": null,
                "text": "(5) binding_term( [transcriptionally active kappaB motifs], [in the TNF-alpha promoter], [in normal cells])"
            },
            "FIGREF1": {
                "type_str": "figure",
                "num": null,
                "uris": null,
                "text": "The nonvisual arrestins, beta-arrestin and arrestin3, but not visual arrestin, bind specifically to a glutathione S-transferase-clathrin terminal domain fusion protein."
            }
        }
    }
}