Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Using Set Constraints to generate Distinguishing Descriptions
 

Summary: Using Set Constraints
to generate Distinguishing Descriptions
Marilisa Amoia 1 , Claire Gardent 2 , and Stefan Thater 1
1 Computational linguistics
University of Saarbruecken
Germany
famoia,sttag@coli.uni-sb.de
http://www.coli.uni-sb.de
2 CNRS, Nancy
France
Claire.Gardent@loria.fr
http://www.loria.fr/ gardent
Abstract. Following on [Gar02] which shows that the descriptions out-
put by van Deemter algorithm [vD] are not always linguistically ap-
propriate, this paper shows how the task of generating a distinguishing
description for a given target set given a certain context can be refor-
mulated as a constraint satisfaction problem. It then investigates the
practical performance of a constraint solver that was implemented in OZ
for this CSP.
1 Introduction

  

Source: Amoia, Marilisa - Equipe Talaris, INRIA-Lorraine

 

Collections: Computer Technologies and Information Sciences