Hibernation is certainly not one of the activities of computational semanticists. In the midst of winter they defy sub-zero temperatures, vicious snowstorms, and ice-covered roads to attend the mother of all computational semantics conferences: IWCS. This has been an almost biennial tradition since December 1994, when the first IWCS was initiated by Harry Bunt and held in Tilburg, Netherlands. The workshop turned out to be a successful event, and seven more IWCS meetings were organised --- all by Harry Bunt, and all in Tilburg --- between 1997 and 2009.
The ninth episode of IWCS, however, is different from various points of view. For the first time in its history, it is not taking place in Tilburg, and not organised by Harry Bunt. IWCS released itself, crossed the channel and landed in Oxford. Yet many of its key characteristics remain as they were. For instance the IWCS logo, inspired by the park "Oude Warande" near the traditional IWCS site at Tilburg University, continues to decorate the cover of the proceedings.
The call for papers for IWCS-2011 triggered a record number of 110 submissions, of which 75 were submitted as regular papers, and 35 as short papers. The programme committee, based on a total of 328 reviews, selected 50 of these --- 30 long and 20 short (three regular papers were accepted as short papers). This gives an overall acceptance rate of 50/110 = 45% (30/72 = 42% for regular papers, and 20/38 = 53% for short papers). Two papers (one regular, one short) were withdrawn by their authors after the notification of acceptance.
Proceeding Downloads
The semantics of dialogue acts
This paper presents an update semantic for dialogue acts, defined in terms of combinations of very simple 'elementary update functions'. This approach allows fine-grained distinctions to be made between related types of dialogue acts, and relations like ...
A new semantics: merging propositional and distributional information
Despite hundreds of years of study on semantics, theories and representations of semantic content---the actual meaning of the symbols used in semantic propositions---remain impoverished. The traditional extensional and intensional models of semantics ...
Deterministic statistical mapping of sentences to underspecified semantics
We present a method for training a statistical model for mapping natural language sentences to semantic expressions. The semantics are expressions of an underspecified logical form that has properties making it particularly suitable for statistical ...
Word sense disambiguation with multilingual features
This paper explores the role played by a multilingual feature representation for the task of word sense disambiguation. We translate the context of an ambiguous word in multiple languages, and show through experiments on standard datasets that by using ...
Using inverse λ and generalization to translate English to formal languages
We present a system to translate natural language sentences to formulas in a formal or a knowledge representation language. Our system uses two inverse λ-calculus operators and using them can take as input the semantic representation of some words, ...
A model for composing semantic relations
This paper presents a model to compose semantic relations. The model is independent of any particular set of relations and uses an extended definition for semantic relations. This extended definition includes restrictions on the domain and range of ...
Implementing weighted abduction in Markov logic
Abduction is a method for finding the best explanation for observations. Arguably the most advanced approach to abduction, especially for natural language processing, is weighted abduction, which uses logical formulas with costs to guide inference. But ...
Modular graph rewriting to compute semantics
Taking an asynchronous perspective on the syntax-semantics interface, we propose to use modular graph rewriting systems as the model of computation. We formally define them and demonstrate their use with a set of modules which produce underspecified ...
Interpreting tractable versus intractable reciprocal sentences
In three experiments, we investigated the computational complexity of German reciprocal sentences with different quantificational antecedents. Building upon the tractable cognition thesis (van Rooij, 2008) and its application to the verification of ...
VerbNet class assignment as a WSD task
The VerbNet lexical resource classifies English verbs based on semantic and syntactic regularities and has been used for numerous NLP tasks, most notably, semantic role labeling. Since, in addition to thematic roles, it also provides semantic predicates,...
Acquiring entailment pairs across languages and domains: a data analysis
Entailment pairs are sentence pairs of a premise and a hypothesis, where the premise textually entails the hypothesis. Such sentence pairs are important for the development of Textual Entailment systems. In this paper, we take a closer look at a ...
Integrating logical representations with probabilistic information using Markov logic
First-order logic provides a powerful and flexible mechanism for representing natural language semantics. However, it is an open question of how best to integrate it with uncertain, probabilistic knowledge, for example regarding word meaning. This paper ...
An abstract schema for representing semantic roles and modelling the syntax-semantics interface
This paper presents a novel approach to semantic role annotation implementing an entailment-based view of the concept of semantic role. I propose to represent arguments of predicates with grammatically relevant primitive properties entailed by the ...
Concrete sentence spaces for compositional distributional models of meaning
Coecke, Sadrzadeh, and Clark [3] developed a compositional model of meaning for distributional semantics, in which each word in a sentence has a meaning vector and the distributional meaning of the sentence is a function of the tensor products of the ...
Computing semantic compositionality in distributional semantics
This article introduces and evaluates an approach to semantic compositionality in computational linguistics based on the combination of Distributional Semantics and supervised Machine Learning. In brief, distributional semantic spaces containing ...
Using query patterns to learn the duration of events
We present the first approach to learning the durations of events without annotated training data, employing web query patterns to infer duration distributions. For example, we learn that "war" lasts years or decades, while "look" lasts seconds or ...
A representation framework for cross-lingual/interlingual lexical semantic correspondences
This paper proposes a framework for representing cross-lingual/interlingual lexical semantic correspondences that are expected to be recovered through a series of on-demand/on-the-fly invocations of a lexical semantic matching process. One of the ...
Formalising and specifying underquantification
This paper argues that all subject noun phrases can be given a quantified formalisation in terms of the intersection between their denotation set and the denotation set of their verbal predicate. The majority of subject noun phrases, however, are only ...
The exploitation of spatial information in narrative discourse
We present the results of several machine learning tasks that exploit explicit spatial language to classify rhetorical relations and the spatial information of narrative events. Three corpora are annotated with figure and ground (granularity) ...
Measuring the semantic relatedness between words and images
Measures of similarity have traditionally focused on computing the semantic relatedness between pairs of words and texts. In this paper, we construct an evaluation framework to quantify cross-modal semantic relationships that exist between arbitrary ...
Elaborating a knowledge base for deep lexical semantics
We describe the methodology for constructing axioms defining event-related words, anchored in core theories of change of state and causality. We first derive from WordNet senses a smaller set of abstract, general "supersenses". We encode axioms for ...
The people's web meets linguistic knowledge: automatic sense alignment of Wikipedia and Wordnet
We propose a method to automatically align WordNet synsets and Wikipedia articles to obtain a sense inventory of higher coverage and quality. For each WordNet synset, we first extract a set of Wikipedia articles as alignment candidates; in a second step,...
Recognizing confinement in web texts
- Megumi Ohki,
- Suguru Matsuyoshi,
- Junta Mizuno,
- Kentaro Inui,
- Eric Nichols,
- Koji Murakami,
- Shouko Masuda,
- Yuji Matsumoto
In the Recognizing Textual Entailment (RTE) task, sentence pairs are classified into one of three semantic relations: Entailment, Contradiction or Unknown. While we find some sentence pairs hold full entailments or contradictions, there are a number of ...
Abductive reasoning with a large knowledge base for discourse processing
- Ekaterina Ovchinnikova,
- Jerry R. Hobbs,
- Niloofar Montazeri,
- Michael C. McCord,
- Theodore Alexandrov,
- Rutu Mulkar-Mehta
This paper presents a discourse processing framework based on weighted abduction. We elaborate on ideas described in Hobbs et al. (1993) and implement the abductive inference procedure in a system called Mini-TACITUS. Particular attention is paid to ...
Incremental dialogue act understanding
This paper presents a machine learning-based approach to the incremental understanding of dialogue utterances, with a focus on the recognition of their communicative functions. A token-based approach combining the use of local classifiers, which exploit ...
Extracting aspects of determiner meaning from dialogue in a virtual world environment
We use data from a virtual world game for automated learning of words and grammatical constructions and their meanings. The language data are an integral part of the social interaction in the game and consist of chat dialogue, which is only constrained ...
On the maximalization of the witness sets in independent set readings
Before starting, I would like to ask reader's opinion about the truth/falsity of certain NL statements. The statements are about figures depicting dots connected to stars. In the figures, we distinguish between dots and stars that are connected, i.e. ...
Ontology-based distinction between polysemy and homonymy
We consider the problem of distinguishing polysemous from homonymous nouns. This distinction is often taken for granted, but is seldom operationalized in the shape of an empirical model. We present a first step towards such a model, based on WordNet ...
Towards semi-automatic methods for improving WordNet
WordNet is extensively used as a major lexical resource in NLP. However, its quality is far from perfect, and this alters the results of applications using it. We propose here to complement previous efforts for "cleaning up" the top-level of its ...
Compositional expectation: a purely distributional model of compositional semantics
The past year has witnessed a surge of interest in the issue of compositional semantics: modelling the meaning of complex phrases. To date, distributional approaches have successfully dealt only with the meaning of individual words in context. Recent ...