中文
相关论文

相关论文: Ellipsis and Higher-Order Unification

200 篇论文

The paper describes a substitutional approach to ellipsis resolution giving comparable results to Dalrymple, Shieber and Pereira (1991), but without the need for order-sensitive interleaving of quantifier scoping and ellipsis resolution. It…

cmp-lg · 计算机科学 2016-08-31 Richard Crouch

Although sloppy interpretation is usually accounted for by theories of ellipsis, it often arises in non-elliptical contexts. In this paper, a theory of sloppy interpretation is provided which captures this fact. The underlying idea is that…

cmp-lg · 计算机科学 2008-02-03 Claire Gardent

In this paper, we provide an account of how to generate sentences with coordination constructions from clause-sized semantic representations. An algorithm is developed to generate sentences with ellipsis, gapping, right-node-raising, and…

cmp-lg · 计算机科学 2007-05-23 James Shaw

We present a hybrid text understanding methodology for the resolution of textual ellipsis. It integrates conceptual criteria (based on the well-formedness and conceptual strength of role chains in a terminological knowledge base) and…

cmp-lg · 计算机科学 2008-02-03 Udo Hahn , Katja Markert , Michael Strube

We propose an analysis of corrections which models some of the requirements corrections place on context. We then show that this analysis naturally extends to the interaction of corrections with pronominal anaphora on the one hand, and…

cmp-lg · 计算机科学 2008-02-03 Claire Gardent , Michael Kohlhase , Noor van Neusen

In this paper, we discuss the question whether phrasal comparatives should be given a direct interpretation, or require an analysis as elliptic constructions, and answer it with Yes and No. The most adequate analysis of wide reading…

cmp-lg · 计算机科学 2008-02-03 Jan Lerner , Manfred Pinkal

We provide a general account of parallelism in discourse, and apply it to the special case of resolving possible readings for instances of VP ellipsis. We show how several problematic examples are accounted for in a natural and…

cmp-lg · 计算机科学 2008-02-03 Jerry R. Hobbs , Andrew Kehler

Pragmatics is core to natural language, enabling speakers to communicate efficiently with structures like ellipsis and anaphora that can shorten utterances without loss of meaning. These structures require a listener to interpret an…

计算与语言 · 计算机科学 2023-08-17 Nicholas Edwards , Hannah Rohde , Henry Conklin

The paper adresses the problem of reasoning with ambiguities. Semantic representations are presented that leave scope relations between quantifiers and/or other operators unspecified. Truth conditions are provided for these representations…

cmp-lg · 计算机科学 2008-02-03 Uwe Reyle

We regard explanations as a blending of the input sample and the model's output and offer a few definitions that capture various desired properties of the function that generates these explanations. We study the links between these…

机器学习 · 计算机科学 2020-01-16 Lior Wolf , Tomer Galanti , Tamir Hazan

Most, if not all forms of ellipsis (e.g., so does Mary) are similar to reading comprehension questions (what does Mary do), in that in order to resolve them, we need to identify an appropriate text span in the preceding discourse. Following…

计算与语言 · 计算机科学 2021-01-20 Rahul Aralikatte , Matthew Lamm , Daniel Hardt , Anders Søgaard

This paper proposes an alternative to standard first-order logic that seeks greater naturalness, generality, and semantic self-containment. The system removes the first-order restriction, avoids type hierarchies, and dispenses with external…

逻辑 · 数学 2025-08-12 Mauro Avon

A hybrid methodology for the resolution of text-level ellipsis is presented in this paper. It incorporates conceptual proximity criteria applied to ontologically well-engineered domain knowledge bases and an approach to centering based on…

cmp-lg · 计算机科学 2008-02-03 Michael Strube , Udo Hahn

We introduce ologisms. They generate from ologs by extending their logical expressivity, from the possibility of considering constraints of equational nature only to the possibility of considering constraints of syllogistic nature, in…

计算机科学中的逻辑 · 计算机科学 2023-06-22 Ruggero Pagnan

This paper presents a novel framework for reconstructing multi-hop explanations in science Question Answering (QA). While existing approaches for multi-hop reasoning build explanations considering each question in isolation, we propose a…

人工智能 · 计算机科学 2021-02-11 Marco Valentino , Mokanarangan Thayaparan , André Freitas

We revisit evaluation of logical formulas that allow both uninterpreted relations, constrained to be finite, as well as an interpreted vocabulary over an infinite domain. This formalism was denoted embedded finite model theory in the past.…

计算机科学中的逻辑 · 计算机科学 2024-05-22 Michael Benedikt , Ehud Hrushovski

This paper presents a theoretical research based approach to ellipsis resolution in machine translation. The formula of discourse is applied in order to resolve ellipses. The validity of the discourse formula is analyzed by applying it to…

计算与语言 · 计算机科学 2010-07-29 Sana Ullah , M. A. Khan , Kyung Sup Kwak

It is claimed that a variety of facts concerning ellipsis, event reference, and interclausal coherence can be explained by two features of the linguistic form in question: (1) whether the form leaves behind an empty constituent in the…

cmp-lg · 计算机科学 2008-02-03 Andrew Kehler

The theory of modular forms and spherical harmonic analysis are applied to establish new best bounds towards the counting and equidistribution of rational points on spheres and other higher dimensional ellipsoids, in what may be viewed as a…

数论 · 数学 2024-02-01 Claire Burrin , Matthias Gröbner

In this article we undertake a study of extension complexity from the perspective of formal languages. We define a natural way to associate a family of polytopes with binary languages. This allows us to define the notion of extension…

计算复杂性 · 计算机科学 2019-08-29 Hans Raj Tiwary
‹ 上一页 1 2 3 10 下一页 ›