| { |
| "paper_id": "E95-1041", |
| "header": { |
| "generated_with": "S2ORC 1.0.0", |
| "date_generated": "2023-01-19T10:31:37.871062Z" |
| }, |
| "title": "An Algorithm to Co-Ordinate Anaphora Resolution and PPS Disambiguation Process", |
| "authors": [ |
| { |
| "first": "Saliha", |
| "middle": [], |
| "last": "Azzam", |
| "suffix": "", |
| "affiliation": { |
| "laboratory": "", |
| "institution": "CRIL", |
| "location": { |
| "addrLine": "Ing6nierie -CAMS La Sorbonne 174, Rue de la RSpubhque", |
| "postCode": "92817", |
| "settlement": "Puteaux", |
| "country": "France" |
| } |
| }, |
| "email": "azzam@cril-ing.fr" |
| } |
| ], |
| "year": "", |
| "venue": null, |
| "identifiers": {}, |
| "abstract": "Both anaphora resolution and prepositional phrase (PP) attachment are the most frequent ambiguities in natural language processing. Several methods have been proposed to deal with each phenomenon separately, however none of proposed systems has considered the way of dealing both phenomena We tackle this issue here, proposing an algorithm to coordinate the treatment of these two problems efficiently, i.e., the aim is also to exploit at each step all the results that each component can provide.", |
| "pdf_parse": { |
| "paper_id": "E95-1041", |
| "_pdf_hash": "", |
| "abstract": [ |
| { |
| "text": "Both anaphora resolution and prepositional phrase (PP) attachment are the most frequent ambiguities in natural language processing. Several methods have been proposed to deal with each phenomenon separately, however none of proposed systems has considered the way of dealing both phenomena We tackle this issue here, proposing an algorithm to coordinate the treatment of these two problems efficiently, i.e., the aim is also to exploit at each step all the results that each component can provide.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Abstract", |
| "sec_num": null |
| } |
| ], |
| "body_text": [ |
| { |
| "text": "Several methods have been proposed to deal with anaphora resolution and prepositional phrase (PP) attachment phenomenon and separately, so that the literature is very abundant : for PPs see e.g., (Frazier and Fodor, 1979; Hobbs, 1990) , and (Wilks and Huang, 1985) , and for anaphora see e.g., (Carter, 1986; Reinhart, 1983) and (Sidner, 1983) . However none of these methods has considered the way of dealing both phenomena in the same concrete system. We propose in this paper an algorithm that deals with both phenomena, in the same analyser. The anaphora module pertains to the recent methods, uses a set of resolution rules based on the focusing approach, see (Sidner, 1983) . These rules are applied to the conceptual representation and their output is a set of candidate antecedents. Concerning the PPs, unattached prepositions involve empty or unfilled roles in the Conceptual Structures (CSs), expressed in a frame-based language (Zarri, 1999) . The disambiguation procedure alms at filling the empty roles using attachment rules.", |
| "cite_spans": [ |
| { |
| "start": 196, |
| "end": 221, |
| "text": "(Frazier and Fodor, 1979;", |
| "ref_id": null |
| }, |
| { |
| "start": 222, |
| "end": 234, |
| "text": "Hobbs, 1990)", |
| "ref_id": null |
| }, |
| { |
| "start": 241, |
| "end": 264, |
| "text": "(Wilks and Huang, 1985)", |
| "ref_id": "BIBREF4" |
| }, |
| { |
| "start": 294, |
| "end": 308, |
| "text": "(Carter, 1986;", |
| "ref_id": null |
| }, |
| { |
| "start": 309, |
| "end": 324, |
| "text": "Reinhart, 1983)", |
| "ref_id": "BIBREF2" |
| }, |
| { |
| "start": 329, |
| "end": 343, |
| "text": "(Sidner, 1983)", |
| "ref_id": "BIBREF3" |
| }, |
| { |
| "start": 665, |
| "end": 679, |
| "text": "(Sidner, 1983)", |
| "ref_id": "BIBREF3" |
| }, |
| { |
| "start": 939, |
| "end": 952, |
| "text": "(Zarri, 1999)", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "This work was accomplished in the context of COBALT project (LRE 61-01 ), dealing with financial news. A detailed discussion about both procedures of anaphora resolution and PP attachment is largely developed in (Azzam, 1994) .", |
| "cite_spans": [ |
| { |
| "start": 212, |
| "end": 225, |
| "text": "(Azzam, 1994)", |
| "ref_id": "BIBREF0" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "Two of the main principles of the algorithm are :", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "The algorithm", |
| "sec_num": "2" |
| }, |
| { |
| "text": "a) The algorithm is applied on the text sentence by sentence, i.e. the ambiguities of the previous sentences have already been considered (resolved or not).", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "The algorithm", |
| "sec_num": "2" |
| }, |
| { |
| "text": "b) The anaphora procedure skips the resolution of a given anaphor when this anaphor is preceded by an unattached preposition. This is because the resolution rules may have an empty role as a parameter, due to this unattached preposition. The resolution of the anaphor is then postponed to the second phase of anaphora resolution.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "The algorithm", |
| "sec_num": "2" |
| }, |
| { |
| "text": "The proposed procedure is based on successive calls to the anaphora module and to the PP attachment module. The output of each call is a set of CSs that represent the intermediate resuits exchanged between each call and on which both modules operate in turn. The aim is to fill the unfilled roles in the CSs, due to anaphora or unattached PPs. To summarize the algorithm is: 1) Apply the anaphora module first. 2) Apply the PP attachment procedure.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "The algorithm", |
| "sec_num": "2" |
| }, |
| { |
| "text": "3) If some anaphora.are left unresolved, apply the anaphora module again. 4) If there are still unattached PPs, apply the attachment procedure again. 5) Repeat (3) and (4), until all VPs and anaphors are treated.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "The algorithm", |
| "sec_num": "2" |
| }, |
| { |
| "text": "The order in which the two modules are called is based on efficiency deduced from statistical data performed on COBALT corpuses.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "The algorithm", |
| "sec_num": "2" |
| }, |
| { |
| "text": "Three main cases are faced by the algorithm : a) When the anaphor occurs before a given preposition in the sentence, its resolution does not depend on where the preposition is to be attached (except for cataphors that are quite rare). In this case the anaphora module can be applied before the attachment procedure.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "The algorithm", |
| "sec_num": "2" |
| }, |
| { |
| "text": "The example 1 below shows that the resolution of the anaphoric pronoun that must be performed first and that the PP starting with of be attached later.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "The algorithm", |
| "sec_num": "2" |
| }, |
| { |
| "text": "(1) The sale of Credito was first proposed last August and that of BCI late last ~lear. b) When the anaphor occurs after one or several unattached prepositions, it could be an intrasententiai anaphor (i.e. referring to an entity in the same sentence), then its resolution may depend on one of the previous prepositional phrases. In this case, the resolution of the anaphora is postponed to a next call of the anaphora module according to principle b) stated above. c) When the anaphor is included in a PP (particular case of b), PP attachment rules need semantic information about the \"object\" of the PP; when it is a pronoun, no semantic information is available, so that the attachment rules can not be applied. The anaphoric pronouns have to be resolved first, so as to determine what semantic class they refer to ; the PP attachment procedure can then be applied. When a sequence contains more than two such PPs, i.e., with anaphors as objects, the length of a cycle is more than 4.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "The algorithm", |
| "sec_num": "2" |
| }, |
| { |
| "text": "3 An example (~) UPHB shares have been suspended since October ~g at the firm's request following a surge in its share price on a takeover rumour.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "The algorithm", |
| "sec_num": "2" |
| }, |
| { |
| "text": "The pronoun its can not be resolved by the anaphora resolution module because it is preceded by unattached PPs ; its resolution is skipped.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "-", |
| "sec_num": null |
| }, |
| { |
| "text": "-The PP attachment procedure is then called to determine the attachment of since and at while the object of the in PP comprises an anaphoric pronoun its (case c).", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "-", |
| "sec_num": null |
| }, |
| { |
| "text": "-The anaphora module is called again to resolve the anaphoric pronoun its, which is possible, in this example, since the previous PPs have been attached and there is no anaphors before.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "-", |
| "sec_num": null |
| }, |
| { |
| "text": "-Finally, the PP attachment procedure has to be called again for the in PP.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "-", |
| "sec_num": null |
| }, |
| { |
| "text": "Notice that even if each module is called several times, there is no redundancy in the processing. The algorithm should be considered as the splitting of both anaphora resolution and PP attachment procedures into several phases and not as the repetition of each procedure.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "-", |
| "sec_num": null |
| }, |
| { |
| "text": "The objective was to emphasise more than it has been done until now, the fact that PP attachment and anaphora resolution could interact in the same system in order to produce a complete conceptual analysis, instead of slowing down each other. The algorithm we proposed in this. paper, is independent of the used approaches in both anaphora and attachment modules. It concerns rather the way of managing the interaction between the two modules.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Conclusion", |
| "sec_num": "4" |
| }, |
| { |
| "text": "Our actual work addresses more the problems inside each module. The attachment module has been implemented at 99%. Presently we are working on the extension of the anaphora module particularly to deal also with the anaphoric definite noun phrases.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Conclusion", |
| "sec_num": "4" |
| } |
| ], |
| "back_matter": [], |
| "bib_entries": { |
| "BIBREF0": { |
| "ref_id": "b0", |
| "title": "CLAM COBALT conceptual analyser", |
| "authors": [ |
| { |
| "first": "S", |
| "middle": [], |
| "last": "Azzam", |
| "suffix": "" |
| } |
| ], |
| "year": 1994, |
| "venue": "CRIL Ing~nierie", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Azzam, S. 1994. CLAM COBALT conceptual analyser (COBALT Tech. Report Del6.2). CRIL Ing~nierie.", |
| "links": null |
| }, |
| "BIBREF1": { |
| "ref_id": "b1", |
| "title": "The sausage machine: A New Two-Stage Parsing Model, Cognition, 6. I-Iobbs", |
| "authors": [ |
| { |
| "first": "D", |
| "middle": [], |
| "last": "Carter", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Ellis Horwood", |
| "suffix": "" |
| }, |
| { |
| "first": "L", |
| "middle": [], |
| "last": "Frasier", |
| "suffix": "" |
| }, |
| { |
| "first": "J", |
| "middle": [ |
| "; J R" |
| ], |
| "last": "Fodor", |
| "suffix": "" |
| }, |
| { |
| "first": "J", |
| "middle": [], |
| "last": "Bear", |
| "suffix": "" |
| } |
| ], |
| "year": 1979, |
| "venue": "Proceedings of the 13th International Conference on Computational Linguistics -COLING/90", |
| "volume": "3", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Carter, D. 1987. Interpreting Anaphors in nat- ural language Texts. Chichester: Ellis Horwood. Frasier, L. and Fodor, J. 1979. The sausage machine: A New Two-Stage Parsing Model, Cog- nition, 6. I-Iobbs, J.R., and Bear, J. 1990. Two Princi- ples of Parse Reference in Proceedings of the 13th International Conference on Computational Lin- guistics -COLING/90, vol. 3, Karlgren, H., ed. Helsinki: University Press.", |
| "links": null |
| }, |
| "BIBREF2": { |
| "ref_id": "b2", |
| "title": "Anaphora and Semantic Interpretation", |
| "authors": [ |
| { |
| "first": "T", |
| "middle": [], |
| "last": "Reinhart", |
| "suffix": "" |
| } |
| ], |
| "year": 1983, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Reinhart, T. 1983. Anaphora and Semantic In- terpretation. London : Croom Helm.", |
| "links": null |
| }, |
| "BIBREF3": { |
| "ref_id": "b3", |
| "title": "Focusing for Interpretation of pronouns", |
| "authors": [ |
| { |
| "first": "C", |
| "middle": [ |
| "L" |
| ], |
| "last": "Sidner", |
| "suffix": "" |
| } |
| ], |
| "year": 1983, |
| "venue": "American Journal of Computational Linguistics", |
| "volume": "7", |
| "issue": "", |
| "pages": "217--231", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Sidner, C.L. 1983. Focusing for Interpretation of pronouns. American Journal of Computational Linguistics, 7, 217-231.", |
| "links": null |
| }, |
| "BIBREF4": { |
| "ref_id": "b4", |
| "title": "The descriptive component of hybrid knowledge representation language", |
| "authors": [ |
| { |
| "first": "Y", |
| "middle": [], |
| "last": "Wilks", |
| "suffix": "" |
| }, |
| { |
| "first": "X", |
| "middle": [], |
| "last": "Huang", |
| "suffix": "" |
| }, |
| { |
| "first": "D", |
| "middle": [], |
| "last": "Fass", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Ijcai", |
| "suffix": "" |
| }, |
| { |
| "first": "G", |
| "middle": [ |
| "P" |
| ], |
| "last": "Zarri", |
| "suffix": "" |
| } |
| ], |
| "year": 1985, |
| "venue": "Semantic networks in Artificial Intelligence, Lehmann, F", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Wilks, Y., Huang, X., and Fass, D. 1985. Syn- tax, Preference and Right Attachment, IJCAI. Zarri, G.P. 1992. The descriptive compo- nent of hybrid knowledge representation language, In: Semantic networks in Artificial Intelligence, Lehmann, F., ed. Oxford: Pergamon Press.", |
| "links": null |
| } |
| }, |
| "ref_entries": {} |
| } |
| } |
