English
Related papers

Related papers: Multiplicative-Additive Focusing for Parsing as De…

200 papers

Sparsity-based models and techniques have been exploited in many signal processing and imaging applications. Data-driven methods based on dictionary and sparsifying transform learning enable learning rich image features from data, and can…

Machine Learning · Computer Science 2019-09-25 Saiprasad Ravishankar , Anna Ma , Deanna Needell

Distinguishing between arguments and adjuncts of a verb is a longstanding, nontrivial problem. In natural language processing, argumenthood information is important in tasks such as semantic role labeling (SRL) and prepositional phrase (PP)…

Computation and Language · Computer Science 2019-04-16 Najoung Kim , Kyle Rawlins , Benjamin Van Durme , Paul Smolensky

We study infinite words fixed by a morphism and their derived words. A derived word is a coding of return words to a factor. We exhibit two examples of sets of morphisms which are closed under derivation --- any derived word with respect to…

Combinatorics · Mathematics 2019-11-28 Václav Košík , Štěpán Starosta

Spurious correlations threaten the validity of statistical classifiers. While model accuracy may appear high when the test data is from the same distribution as the training data, it can quickly degrade when the test distribution changes.…

Machine Learning · Computer Science 2020-12-21 Zhao Wang , Aron Culotta

The problem of identifying a probabilistic context free grammar has two aspects: the first is determining the grammar's topology (the rules of the grammar) and the second is estimating probabilistic weights for each rule. Given the hardness…

Formal Languages and Automata Theory · Computer Science 2021-03-10 Dolav Nitay , Dana Fisman , Michal Ziv-Ukelson

Spurious correlations are a threat to the trustworthiness of natural language processing systems, motivating research into methods for identifying and eliminating them. However, addressing the problem of spurious correlations requires more…

Computation and Language · Computer Science 2022-05-05 Jacob Eisenstein

Spurious correlations are brittle associations between certain attributes of inputs and target variables, such as the correlation between an image background and an object class. Deep image classifiers often leverage them for predictions,…

Computer Vision and Pattern Recognition · Computer Science 2024-06-18 Guangtao Zheng , Wenqian Ye , Aidong Zhang

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…

Computation and Language · Computer Science 2023-08-17 Nicholas Edwards , Hannah Rohde , Henry Conklin

Approximations during program analysis are a necessary evil, as they ensure essential properties, such as soundness and termination of the analysis, but they also imply not always producing useful results. Automatic techniques have been…

Programming Languages · Computer Science 2018-12-18 Isabel Garcia-Contreras , Jose F. Morales , Manuel V. Hermenegildo

Natural language reasoning plays an increasingly important role in improving language models' ability to solve complex language understanding tasks. An interesting use case for reasoning is the resolution of context-dependent ambiguity. But…

Computation and Language · Computer Science 2023-10-24 Stefan F. Schouten , Peter Bloem , Ilia Markov , Piek Vossen

Abductive reasoning aims to find plausible explanations for an event. This style of reasoning is critical for commonsense tasks where there are often multiple plausible explanations. Existing approaches for abductive reasoning in natural…

Computation and Language · Computer Science 2023-05-25 Wenting Zhao , Justin T. Chiu , Claire Cardie , Alexander M. Rush

This paper explores goal-directed proof search in first-order multi-modal logic. The key issue is to design a proof system that respects the modularity and locality of assumptions of many modal logics. By forcing ambiguities to be…

Logic in Computer Science · Computer Science 2007-05-23 Matthew Stone

Analyzing how human beings resolve syntactic ambiguity has long been an issue of interest in the field of linguistics. It is, at the same time, one of the most challenging issues for spoken language understanding (SLU) systems as well. As…

Computation and Language · Computer Science 2020-05-22 Won Ik Cho , Jeonghwa Cho , Woo Hyun Kang , Nam Soo Kim

The multiple extension problem arises frequently in diagnostic and default inference. That is, we can often use any of a number of sets of defaults or possible hypotheses to explain observations or make Predictions. In default inference,…

Artificial Intelligence · Computer Science 2013-04-11 Eric Neufeld , David L Poole

Mechanistic interpretability aims to understand how neural networks generalize beyond their training data by reverse-engineering their internal structures. We introduce patterning as the dual problem: given a desired form of generalization,…

Machine Learning · Computer Science 2026-01-21 George Wang , Daniel Murfet

We present a detailed replication study of the BASS framework, an abstractive summarization system based on the notion of Unified Semantic Graphs. Our investigation includes challenges in replicating key components and an ablation study to…

Computation and Language · Computer Science 2024-03-26 Osman Alperen Koraş , Jörg Schlötterer , Christin Seifert

I explore some of the issues that arise when trying to establish a connection between the underspecification hypothesis pursued in the NLP literature and work on ambiguity in semantics and in the psychological literature. A theory of…

cmp-lg · Computer Science 2008-02-03 Massimo Poesio

Modelling qualitative uncertainty in formal argumentation is essential both for practical applications and theoretical understanding. Yet, most of the existing works focus on \textit{abstract} models for arguing with uncertainty. Following…

Artificial Intelligence · Computer Science 2026-02-18 Carlo Proietti , Antonio Yuste-Ginel

Prefix parsing asks whether an input prefix can be extended to a complete string generated by a given grammar. In the weighted setting, it also provides prefix probabilities, which are central to context-free language modeling,…

Computation and Language · Computer Science 2026-05-05 Clemente Pasti , Andreas Opedal , Timothy J. O'Donnell , Ryan Cotterell , Tim Vieira

There have been several efforts to extend distributional semantics beyond individual words, to measure the similarity of word pairs, phrases, and sentences (briefly, tuples; ordered sets of words, contiguous or noncontiguous). One way to…

Machine Learning · Computer Science 2013-10-21 Peter D. Turney
‹ Prev 1 3 4 5 6 7 10 Next ›