Generating Bridging Definite Descriptions
| Autor: | Kristina Striegnitz, Claire Gardent |
|---|---|
| Přispěvatelé: | Natural Language Processing: representation, inference and semantics (TALARIS), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université Henri Poincaré - Nancy 1 (UHP)-Université Nancy 2-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS)-Université Henri Poincaré - Nancy 1 (UHP)-Université Nancy 2-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS), Harry Bunt and Reinhard Muskens |
| Jazyk: | angličtina |
| Rok vydání: | 2008 |
| Předmět: |
Theoretical computer science
Computer science anaphore associative 05 social sciences bridging [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH] Inference Natural language generation 02 engineering and technology Definite description 050105 experimental psychology Noun phrase Bridging (programming) natural language generation definite descriptions Description logic 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing 0501 psychology and cognitive sciences Incremental algorithm génération de textes descriptions définies inférence Associative property |
| Zdroj: | Computing Meaning Harry Bunt and Reinhard Muskens. Computing Meaning, 3, Kluwer Academic Publishers, pp.369--396, 2008, Studies in Linguistics and Philosophy-83, 978-1-4020-5956-8 Computing Meaning ISBN: 9781402059575 |
| Popis: | International audience; In this paper, we focus on the role knowledge based reasoning plays in the generation of definite descriptions. Specifically, we propose an extension of Dale and Reiter's incremental algorithm which covers not only directly anaphoric descriptions but also indirect and associative anaphora. Starting from a formalism independent algorithm, we further show how this algorithm can be implemented using description logic. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|