Normalized Alignment of Dependency Trees for Detecting Textual Entailment

In this paper, we investigate the usefulness of normalized alignment of dependency trees for entailment prediction. Overall, our approach yields an accuracy of 60% on the RTE2 test set, which is a significant improvement over the baseline. Results vary substantially across the different subsets, with a peak performance on the summarization data. We conclude that normalized alignment is useful for detecting textual entailments, but a robust approach will probably need to include additional sources of information

The design-by-adaptation approach to universal access: learning from videogame technology

This paper proposes an alternative approach to the design of universally accessible interfaces to that provided by formal design frameworks applied ab initio to the development of new software. This approach, design-byadaptation, involves the transfer of interface technology and/or design principles from one application domain to another, in situations where the recipient domain is similar to the host domain in terms of modelled systems, tasks and users. Using the example of interaction in 3D virtual environments, the paper explores how principles underlying the design of videogame interfaces may be applied to a broad family of visualization and analysis software which handles geographical data (virtual geographic environments, or VGEs). One of the motivations behind the current study is that VGE technology lags some way behind videogame technology in the modelling of 3D environments, and has a less-developed track record in providing the variety of interaction methods needed to undertake varied tasks in 3D virtual worlds by users with varied levels of experience. The current analysis extracted a set of interaction principles from videogames which were used to devise a set of 3D task interfaces that have been implemented in a prototype VGE for formal evaluation

Belief Revision in Science: Informational Economy and Paraconsistency

In the present paper, our objective is to examine the application of belief revision models to scientific rationality. We begin by considering the standard model AGM, and along the way a number of problems surface that make it seem inadequate for this specific application. After considering three different heuristics of informational economy that seem fit for science, we consider some possible adaptations for it and argue informally that, overall, some paraconsistent models seem to better satisfy these principles, following Testa (2015). These models have been worked out in formal detail by Testa, Cogniglio, & Ribeiro (2015, 2017)

Conversational Implicatures (and How to Spot Them)

In everyday conversations we often convey information that goes above and beyond what we strictly speaking say: exaggeration and irony are obvious examples. H.P. Grice introduced the technical notion of a conversational implicature in systematizing the phenomenon of meaning one thing by saying something else. In introducing the notion, Grice drew a line between what is said, which he understood as being closely related to the conventional meaning of the words uttered, and what is conversationally implicated, which can be inferred from the fact that an utterance has been made in context. Since Grice’s seminal work, conversational implicatures have become one of the major research areas in pragmatics. This article introduces the notion of a conversational implicature, discusses some of the key issues that lie at the heart of the recent debate, and explicates tests that allow us to reliably distinguish between semantic entailments and conventional implicatures on the one hand and conversational implicatures on the other

Polynomial Size Analysis of First-Order Shapely Functions

We present a size-aware type system for first-order shapely function definitions. Here, a function definition is called shapely when the size of the result is determined exactly by a polynomial in the sizes of the arguments. Examples of shapely function definitions may be implementations of matrix multiplication and the Cartesian product of two lists. The type system is proved to be sound w.r.t. the operational semantics of the language. The type checking problem is shown to be undecidable in general. We define a natural syntactic restriction such that the type checking becomes decidable, even though size polynomials are not necessarily linear or monotonic. Furthermore, we have shown that the type-inference problem is at least semi-decidable (under this restriction). We have implemented a procedure that combines run-time testing and type-checking to automatically obtain size dependencies. It terminates on total typable function definitions.Comment: 35 pages, 1 figur