Pronouns play a decisive role in every natural language as the linguistic elements that enable semantic cohesion in a text. Therefore, anaphora resolution (i.e. the task of computing the semantic content of pronouns) is both an important theoretical issue and a major technological challenge for any software application that aims at a fine-grained semantic analysis of natural language texts. Binding Theory is the branch of generative linguistics devoted to discovering the principles that rule the distribution and interpretation of pronouns in a sentence. In this book we combine insights issued from the most recent findings of Binding Theory into an original computational framework for anaphora resolution. Computer scientists interested in Linguistics applied to Natural Language Processing will benefit from the synthetic presentation of basic concepts of modern Computational Semantics and Binding Theory, as well as any linguist interested in exploring the computational implications of Binding Theory.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.