Using logic in the generation of referring expressions

Mostrar otras versiones (1)

The problem of generating referring expressions (GRE) is an important task in natural language generation. In this paper, we advocate for the use of logical languages in the output of the content determination phase (i.e., when the relevant features of the object to be referred are selected). Many d...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Areces, C.
Otros Autores: Figueira, S., Gorín, D.
Formato: Acta de conferencia Capítulo de libro
Lenguaje:Inglés
Publicado: 2011
Acceso en línea:Registro en Scopus
DOI
Handle
Registro en la Biblioteca Digital
Aporte de:Registro referencial: Solicitar el recurso aquí
Biblioteca Central Dr. Luis F. Leloir (FCEN) de Universidad de Buenos Aires
LEADER 07469caa a22009257a 4500
001 PAPER-10451
003 AR-BaUEN
005 20230518204029.0
008 190411s2011 xx ||||fo|||| 00| 0 eng|d
024 7 |2 scopus  |a 2-s2.0-79960121973 
040 |a Scopus  |b spa  |c AR-BaUEN  |d AR-BaUEN 
100 1 |a Areces, C. 
245 1 0 |a Using logic in the generation of referring expressions 
260 |c 2011 
270 1 0 |m Areces, C.; INRIA Nancy, Grand EstFrance; email: areces@loria.fr 
506 |2 openaire  |e Política editorial 
504 |a Areces, C., Koller, A., Striegnitz, K., Referring expressions as formulas of description logic (2008) Proc. of the 5th INLG, , Salt Fork, OH, USA 
504 |a Baader, F., McGuiness, D., Nardi, D., Patel-Schneider, P., (2003) The Description Logic Handbook: Theory, Implementation and Applications, , Cambridge University Press, Cambridge 
504 |a Blackburn, P., De Rijke, M., Venema, Y., (2001) Modal Logic, , Cambridge University Press, Cambridge 
504 |a Dale, R., Cooking up referring expressions (1989) Proc. of the 27th ACL 
504 |a Dale, R., Haddock, N., Generating referring expressions involving relations (1991) Proc. of the 5th EACL 
504 |a Dale, R., Reiter, E., Computational interpretations of the Gricean maxims in the generation of referring expressions (1995) Cognitive Science, 19 
504 |a Dale, R., Viethen, J., Referring expression generation through attribute-based heuristics (2009) Proc. of the 12th ENLG Workshop, pp. 58-65 
504 |a Van Deemter, K., Generating referring expressions: Boolean extensions of the incremental algorithm (2002) Computational Linguistics, 28 (1), pp. 37-52 
504 |a Van Deemter, K., Van Der Sluis, I., Gatt, A., Building a semantically transparent corpus for the generation of referring expressions (2006) Proc. of the 4th INLG 
504 |a Dovier, A., Piazza, C., Policriti, A., An efficient algorithm for computing bisimulation equivalence (2004) Theor. Comput. Sci., 311, pp. 221-256 
504 |a Ebbinghaus, H., Flum, J., Thomas, W., (1996) Mathematical Logic, , Springer, Heidelberg 
504 |a Figueira, S., Gorín, D., On the size of shortest modal descriptions (2010) Advances in Modal Logic, 8, pp. 114-132 
504 |a Garey, M., Johnson, D., (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness, , W. Freeman, New York 
504 |a Henzinger, M.R., Henzinger, T.A., Kopke, P.W., Computing simulations on finite and infinite graphs (1995) Proc. of 36th Annual Symposium on Foundations of Computer Science, pp. 453-462. , IEEE Computer Society Press, Los Alamitos 
504 |a Hopcroft, J., An nlog(n) algorithm for minimizing states in a finite automaton (1971) Theory of Machines and Computations, , Kohave, Z. (ed.). Academic Press, London 
504 |a Horacek, H., An algorithm for generating referential descriptions with flexible interfaces (1997) Proc. of the 35th ACL, pp. 206-213 
504 |a Krahmer, E., Van Erk, S., Verleg, A., Graph-based generation of referring expressions (2003) Computational Linguistics, 29 (1) 
504 |a Paige, R., Tarjan, R., Three partition refinement algorithms (1987) SIAM J. Comput., 16 (6), pp. 973-989 
504 |a Saha, D., An incremental bisimulation algorithm (2007) LNCS, 4855, pp. 204-215. , Arvind, V., Prasad, S. (eds.) FSTTCS 2007, Springer, Heidelberg 
504 |a Stone, M., On identifying sets (2000) Proc. of the 1st INLG 
504 |a Stone, M., Webber, B., Textual economy through close coupling of syntax and semantics (1998) Proc. of the 9th INLG Workshop, pp. 178-187 
504 |a Viethen, J., Dale, R., Algorithms for generating referring expressions: Do they do what people do? (2006) Proc. of the 4th INLG 
520 3 |a The problem of generating referring expressions (GRE) is an important task in natural language generation. In this paper, we advocate for the use of logical languages in the output of the content determination phase (i.e., when the relevant features of the object to be referred are selected). Many different logics can be used for this and we argue that, for a particular application, the actual choice shall constitute a compromise between expressive power (how many objects can be distinguished), computational complexity (how difficult it is to determine the content) and realizability (how often will the selected content be realized to an idiomatic expression). We show that well-known results from the area of computational logic can then be transferred to GRE. Moreover, our approach is orthogonal to previous proposals and we illustrate this by generalizing well-known content-determination algorithms to make them parametric on the logic employed. © 2011 Springer-Verlag Berlin Heidelberg.  |l eng 
536 |a Detalles de la financiación: Consejo Nacional de Investigaciones Científicas y Técnicas, PIP 370, UBACyT 20020090200116 
536 |a Detalles de la financiación: ★ S. Figueira was partially supported by CONICET (grant PIP 370) and UBA (grant UBACyT 20020090200116). 1 For exceptions to this practice see, e.g., [16,21]. 
593 |a INRIA Nancy, Grand Est, France 
593 |a Departamento de Computación, FCEyN, UBA and CONICET, Argentina 
593 |a Departamento de Computación, FCEyN, UBA, Argentina 
690 1 0 |a COMPUTATIONAL LOGIC 
690 1 0 |a CONTENT DETERMINATION 
690 1 0 |a EXPRESSIVE POWER 
690 1 0 |a GENERATING REFERRING EXPRESSIONS 
690 1 0 |a LOGICAL LANGUAGE 
690 1 0 |a NATURAL LANGUAGE GENERATION 
690 1 0 |a REALIZABILITY 
690 1 0 |a COMPUTATIONAL LOGIC 
690 1 0 |a CONTENT DETERMINATION 
690 1 0 |a EXPRESSIVE POWER 
690 1 0 |a GENERATING REFERRING EXPRESSIONS 
690 1 0 |a LOGICAL LANGUAGE 
690 1 0 |a NATURAL LANGUAGE GENERATION 
690 1 0 |a REFERRING EXPRESSIONS 
690 1 0 |a RELEVANT FEATURES 
690 1 0 |a COMPUTATIONAL LINGUISTICS 
690 1 0 |a LOGIC PROGRAMMING 
690 1 0 |a NATURAL LANGUAGE PROCESSING SYSTEMS 
690 1 0 |a COMPUTATIONAL LINGUISTICS 
690 1 0 |a LINGUISTICS 
690 1 0 |a LOGIC PROGRAMMING 
690 1 0 |a NATURAL LANGUAGE PROCESSING SYSTEMS 
690 1 0 |a COMPUTATIONAL COMPLEXITY 
690 1 0 |a COMPUTER CIRCUITS 
700 1 |a Figueira, S. 
700 1 |a Gorín, D. 
711 2 |c Montpellier  |d 29 June 2011 through 1 July 2011  |g Código de la conferencia: 85461 
773 0 |d 2011  |g v. 6736 LNAI  |h pp. 17-32  |p Lect. Notes Comput. Sci.  |n Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)  |x 03029743  |w (AR-BaUEN)CENRE-983  |z 9783642222207  |t 6th International Conference on Logical Aspects of Computational Linguistics, LACL 2011 
856 4 1 |u https://www.scopus.com/inward/record.uri?eid=2-s2.0-79960121973&doi=10.1007%2f978-3-642-22221-4_2&partnerID=40&md5=b2002d022df1de8f17bdcae8973260e2  |y Registro en Scopus 
856 4 0 |u https://doi.org/10.1007/978-3-642-22221-4_2  |y DOI 
856 4 0 |u https://hdl.handle.net/20.500.12110/paper_03029743_v6736LNAI_n_p17_Areces  |y Handle 
856 4 0 |u https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v6736LNAI_n_p17_Areces  |y Registro en la Biblioteca Digital 
961 |a paper_03029743_v6736LNAI_n_p17_Areces  |b paper  |c PE 
962 |a info:eu-repo/semantics/article  |a info:ar-repo/semantics/artículo  |b info:eu-repo/semantics/publishedVersion 
963 |a VARI 
999 |c 71404 

Ejemplares similares