Sciweavers

2696 search results - page 8 / 540
» Semantic Abstraction and Anaphora
Sort
View
DAARC
2007
Springer
124views Algorithms» more  DAARC 2007»
14 years 4 months ago
"Who Are We Talking About?" Tracking the Referent in a Question Answering Series
Abstract. The capability of handling anaphora is becoming a key feature for Question Answering systems, as it can play a crucial role at different stages of the QA loop. At the qu...
Matteo Negri, Milen Kouylekov
ENTCS
2008
110views more  ENTCS 2008»
13 years 10 months ago
On a Fully Abstract Model for a Quantum Linear Functional Language: (Extended Abstract)
ly abstract model for a quantum unctional language (extended abstract) Peter Selinger1 ,2 Dalhousie University, Halifax, Nova Scotia, Canada Beno^it Valiron3 University of Ottawa, ...
Peter Selinger, Benoît Valiron
SEMCO
2007
IEEE
14 years 4 months ago
Unrestricted Coreference: Identifying Entities and Events in OntoNotes
Most research in the field of anaphora or coreference detection has been limited to noun phrase coreference, usually on a restricted set of entities, such as ACE entities. In par...
Sameer S. Pradhan, Lance A. Ramshaw, Ralph M. Weis...
LREC
2008
121views Education» more  LREC 2008»
13 years 11 months ago
Prolexbase: a Multilingual Relational Lexical Database of Proper Names
This paper deals with a multilingual relational lexical database of proper name, Prolexbase, a free resource available on the CNRTL website. The Prolex model is based on two main ...
Denis Maurel
LICS
1994
IEEE
14 years 1 months ago
A Fully Abstract Semantics for Concurrent Graph Reduction
abstract semantics for concurrent graph reduction ALAN JEFFREY This paper presents a fully abstract semantics for a variant of the untyped -calculus with recursive declarations. We...
Alan Jeffrey