Anaphora resolution involving interactive knowledge acquisition

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionResearchpeer-review

Abstract

Anaphora resolution in current computer-processable controlled natural languages relies mainly on syntactic information, accessibility constraints and the distance of the anaphoric expression to its antecedent. This design decision has the advantage that a text can be processed automatically without any additional ontological knowledge, but it has the disadvantage that the author is severely restricted in using anaphoric expressions while writing a text. I will argue that we can allow for a wider range of anaphoric expressions whose resolution requires inference-supporting knowledge, if we consider the anaphora resolution process as an interactive knowledge acquisition process in those cases where no suitable noun phrase antecedent can be found. In particular, I will focus on definite descriptions that stand in a synonymy, subclass/superclass or part-whole relation to their noun phrase antecedent, and show how the original anaphora resolution algorithm of PENG Light can be extended in a systematic way in order to take care of these bridging definite descriptions. The solution to this problem also sheds some light on the adequate treatment of part-whole relations in a controlled natural language context.

LanguageEnglish
Title of host publicationControlled Natural Language
Subtitle of host publicationWorkshop on Controlled Natural Language, CNL 2009, Revised Papers
EditorsNorbert E. Fuchs
Place of PublicationBerlin; Heidelberg
PublisherSpringer, Springer Nature
Pages36-55
Number of pages20
Volume5972 LNAI
ISBN (Electronic)9783642144189
ISBN (Print)3642144179, 9783642144172
DOIs
Publication statusPublished - 2010
EventWorkshop on Controlled Natural Language, CNL 2009 - Marettimo Island, Italy
Duration: 8 Jun 200910 Jun 2009

Publication series

NameLecture Notes in Computer Science
Volume5972 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

OtherWorkshop on Controlled Natural Language, CNL 2009
CountryItaly
CityMarettimo Island
Period8/06/0910/06/09

Fingerprint

Knowledge Acquisition
Knowledge acquisition
Syntactics
Natural Language
Accessibility
Range of data
Text
Knowledge

Cite this

Schwitter, R. (2010). Anaphora resolution involving interactive knowledge acquisition. In N. E. Fuchs (Ed.), Controlled Natural Language: Workshop on Controlled Natural Language, CNL 2009, Revised Papers (Vol. 5972 LNAI, pp. 36-55). (Lecture Notes in Computer Science; Vol. 5972 LNAI). Berlin; Heidelberg: Springer, Springer Nature. https://doi.org/10.1007/978-3-642-14418-9_3
Schwitter, Rolf. / Anaphora resolution involving interactive knowledge acquisition. Controlled Natural Language: Workshop on Controlled Natural Language, CNL 2009, Revised Papers. editor / Norbert E. Fuchs. Vol. 5972 LNAI Berlin; Heidelberg : Springer, Springer Nature, 2010. pp. 36-55 (Lecture Notes in Computer Science).
@inproceedings{3adadfd888734d93b0fb3ae32d84dfa6,
title = "Anaphora resolution involving interactive knowledge acquisition",
abstract = "Anaphora resolution in current computer-processable controlled natural languages relies mainly on syntactic information, accessibility constraints and the distance of the anaphoric expression to its antecedent. This design decision has the advantage that a text can be processed automatically without any additional ontological knowledge, but it has the disadvantage that the author is severely restricted in using anaphoric expressions while writing a text. I will argue that we can allow for a wider range of anaphoric expressions whose resolution requires inference-supporting knowledge, if we consider the anaphora resolution process as an interactive knowledge acquisition process in those cases where no suitable noun phrase antecedent can be found. In particular, I will focus on definite descriptions that stand in a synonymy, subclass/superclass or part-whole relation to their noun phrase antecedent, and show how the original anaphora resolution algorithm of PENG Light can be extended in a systematic way in order to take care of these bridging definite descriptions. The solution to this problem also sheds some light on the adequate treatment of part-whole relations in a controlled natural language context.",
author = "Rolf Schwitter",
year = "2010",
doi = "10.1007/978-3-642-14418-9_3",
language = "English",
isbn = "3642144179",
volume = "5972 LNAI",
series = "Lecture Notes in Computer Science",
publisher = "Springer, Springer Nature",
pages = "36--55",
editor = "Fuchs, {Norbert E.}",
booktitle = "Controlled Natural Language",
address = "United States",

}

Schwitter, R 2010, Anaphora resolution involving interactive knowledge acquisition. in NE Fuchs (ed.), Controlled Natural Language: Workshop on Controlled Natural Language, CNL 2009, Revised Papers. vol. 5972 LNAI, Lecture Notes in Computer Science, vol. 5972 LNAI, Springer, Springer Nature, Berlin; Heidelberg, pp. 36-55, Workshop on Controlled Natural Language, CNL 2009, Marettimo Island, Italy, 8/06/09. https://doi.org/10.1007/978-3-642-14418-9_3

Anaphora resolution involving interactive knowledge acquisition. / Schwitter, Rolf.

Controlled Natural Language: Workshop on Controlled Natural Language, CNL 2009, Revised Papers. ed. / Norbert E. Fuchs. Vol. 5972 LNAI Berlin; Heidelberg : Springer, Springer Nature, 2010. p. 36-55 (Lecture Notes in Computer Science; Vol. 5972 LNAI).

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionResearchpeer-review

TY - GEN

T1 - Anaphora resolution involving interactive knowledge acquisition

AU - Schwitter, Rolf

PY - 2010

Y1 - 2010

N2 - Anaphora resolution in current computer-processable controlled natural languages relies mainly on syntactic information, accessibility constraints and the distance of the anaphoric expression to its antecedent. This design decision has the advantage that a text can be processed automatically without any additional ontological knowledge, but it has the disadvantage that the author is severely restricted in using anaphoric expressions while writing a text. I will argue that we can allow for a wider range of anaphoric expressions whose resolution requires inference-supporting knowledge, if we consider the anaphora resolution process as an interactive knowledge acquisition process in those cases where no suitable noun phrase antecedent can be found. In particular, I will focus on definite descriptions that stand in a synonymy, subclass/superclass or part-whole relation to their noun phrase antecedent, and show how the original anaphora resolution algorithm of PENG Light can be extended in a systematic way in order to take care of these bridging definite descriptions. The solution to this problem also sheds some light on the adequate treatment of part-whole relations in a controlled natural language context.

AB - Anaphora resolution in current computer-processable controlled natural languages relies mainly on syntactic information, accessibility constraints and the distance of the anaphoric expression to its antecedent. This design decision has the advantage that a text can be processed automatically without any additional ontological knowledge, but it has the disadvantage that the author is severely restricted in using anaphoric expressions while writing a text. I will argue that we can allow for a wider range of anaphoric expressions whose resolution requires inference-supporting knowledge, if we consider the anaphora resolution process as an interactive knowledge acquisition process in those cases where no suitable noun phrase antecedent can be found. In particular, I will focus on definite descriptions that stand in a synonymy, subclass/superclass or part-whole relation to their noun phrase antecedent, and show how the original anaphora resolution algorithm of PENG Light can be extended in a systematic way in order to take care of these bridging definite descriptions. The solution to this problem also sheds some light on the adequate treatment of part-whole relations in a controlled natural language context.

UR - http://www.scopus.com/inward/record.url?scp=77955044101&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-14418-9_3

DO - 10.1007/978-3-642-14418-9_3

M3 - Conference proceeding contribution

SN - 3642144179

SN - 9783642144172

VL - 5972 LNAI

T3 - Lecture Notes in Computer Science

SP - 36

EP - 55

BT - Controlled Natural Language

A2 - Fuchs, Norbert E.

PB - Springer, Springer Nature

CY - Berlin; Heidelberg

ER -

Schwitter R. Anaphora resolution involving interactive knowledge acquisition. In Fuchs NE, editor, Controlled Natural Language: Workshop on Controlled Natural Language, CNL 2009, Revised Papers. Vol. 5972 LNAI. Berlin; Heidelberg: Springer, Springer Nature. 2010. p. 36-55. (Lecture Notes in Computer Science). https://doi.org/10.1007/978-3-642-14418-9_3