English
Related papers

Related papers: Yet Another Paper about Partial Verb Phrase Fronti…

200 papers

We describe a stochastic approach to partial parsing, i.e., the recognition of syntactic structures of limited depth. The technique utilises Markov Models, but goes beyond usual bracketing approaches, since it is capable of recognising not…

cmp-lg · Computer Science 2007-05-23 Wojciech Skut , Thorsten Brants

We present a factorized compositional distributional semantics model for the representation of transitive verb constructions. Our model first produces (subject, verb) and (verb, object) vector representations based on the similarity of the…

Computation and Language · Computer Science 2016-09-27 Lilach Edelstein , Roi Reichart

In this paper we give solutions to Hamburger moment problems with missing entries. The problem of completing partial positive sequences is considered. The main result is a characterization of positive definite completable patterns, namely…

Functional Analysis · Mathematics 2015-09-22 Hayoung Choi , Farhad Jafari

This paper describes a method for estimating conditional probability distributions over the parses of ``unification-based'' grammars which can utilize auxiliary distributions that are estimated by other means. We show how this can be used…

Computation and Language · Computer Science 2007-05-23 Mark Johnson , Stefan Riezler

Abstract grammatical knowledge - of parts of speech and grammatical patterns - is key to the capacity for linguistic generalization in humans. But how abstract is grammatical knowledge in large language models? In the human literature,…

Computation and Language · Computer Science 2023-11-16 James A. Michaelov , Catherine Arnett , Tyler A. Chang , Benjamin K. Bergen

When performing Polarity Detection for different words in a sentence, we need to look at the words around to understand the sentiment. Massively pretrained language models like BERT can encode not only just the words in a document but also…

Computation and Language · Computer Science 2020-11-25 Natesh Reddy , Pranaydeep Singh , Muktabh Mayank Srivastava

A class of discrete event synthesis problems can be reduced to solving language equations f . X ⊆ S, where F is the fixed component and S the specification. Sequential synthesis deals with FSMs when the automata for F and S are prefix…

Logic in Computer Science · Computer Science 2011-11-09 Alan Mishchenko , Robert Brayton , Roland Jiang , Tiziano Villa , Nina Yevtushenko

Let P be a poset with elements 1,2,...,n. We say that P is sign-balanced if exactly half the linear extensions of P (regarded as permutations of 1,2,...,n) are even permutations, i.e., have an even number of inversions. This concept first…

Combinatorics · Mathematics 2007-05-23 Richard P. Stanley

Sentences are important semantic units of natural language. A generic, distributional representation of sentences that can capture the latent semantics is beneficial to multiple downstream applications. We observe a simple geometry of…

Computation and Language · Computer Science 2017-04-19 Jiaqi Mu , Suma Bhat , Pramod Viswanath

Several methodologies have recently been proposed to evaluate the ability of Pretrained Language Models (PLMs) to interpret negation. In this article, we build on Gubelmann and Handschuh (2022), which studies the modification of PLMs'…

Computation and Language · Computer Science 2025-10-02 David Kletz , Pascal Amsili , Marie Candito

In order to alleviate the inefficiencies caused by the interaction of the logic and functional sides, integrated languages may take advantage of \emph{demand} information -- i.e. knowing in advance which computations are needed and, to…

Programming Languages · Computer Science 2007-05-23 Julio Marino , Angel Herranz , Juan Jose Moreno-Navarro

Distributed representations of words have boosted the performance of many Natural Language Processing tasks. However, usually only one representation per word is obtained, not acknowledging the fact that some words have multiple meanings.…

Computation and Language · Computer Science 2016-02-22 Luis Nieto Piña , Richard Johansson

This paper presents a new derivative parsing algorithm for parsing expression grammars; this new algorithm is both simpler and faster than the existing parsing expression derivative algorithm presented by Moss. This new algorithm improves…

Formal Languages and Automata Theory · Computer Science 2018-08-28 Aaron Moss

Various semantics for studying the square of opposition and the hexagon of opposition have been proposed recently. We interpret sentences by imprecise (set-valued) probability assessments on a finite sequence of conditional events. We…

Probability · Mathematics 2017-10-13 Niki Pfeifer , Giuseppe Sanfilippo

The Earley algorithm is a widely used parsing method in natural language processing applications. We introduce a variant of Earley parsing that is based on a ``delayed'' recognition of constituents. This allows us to start the recognition…

cmp-lg · Computer Science 2007-05-23 Mark-Jan Nederhof , Giorgio Satta

Let F be a totally real field and p a rational prime unramified in F. We prove a partial classicality theorem for overconvergent Hilbert modular forms: when the slope is small compared to certain but not all weights, an overconvergent form…

Number Theory · Mathematics 2022-05-31 Chi-Yun Hsu

We give an algebraic characterization of half-factorial orders in algebraic number fields. This generalizes prior results for seminormal orders and for orders in quadratic number fields.

Commutative Algebra · Mathematics 2024-06-21 Balint Rago

In this paper we present a formalization of the centering approach to modeling attentional structure in discourse and use it as the basis for an algorithm to track discourse context and bind pronouns. As described in Grosz, Joshi and…

cmp-lg · Computer Science 2008-02-03 Susan E. Brennan , Marilyn Walker Friedman , Carl J. Pollard

The use of subword-level information (e.g., characters, character n-grams, morphemes) has become ubiquitous in modern word representation learning. Its importance is attested especially for morphologically rich languages which generate a…

Computation and Language · Computer Science 2019-05-07 Yi Zhu , Ivan Vulić , Anna Korhonen

Word embeddings have become a staple of several natural language processing tasks, yet much remains to be understood about their properties. In this work, we analyze word embeddings in terms of their principal components and arrive at a…

Computation and Language · Computer Science 2020-05-22 Vikas Raunak , Vaibhav Kumar , Vivek Gupta , Florian Metze