English
Related papers

Related papers: Handling Verb Phrase Anaphora with Dependent Types…

200 papers

Recent work has considered corpus-based or statistical approaches to the problem of prepositional phrase attachment ambiguity. Typically, ambiguous verb phrases of the form {v np1 p np2} are resolved through a model which considers values…

cmp-lg · Computer Science 2008-02-03 Michael Collins , James Brooks

Aspect based sentiment analysis (ABSA) deals with the identification of the sentiment polarity of a review sentence towards a given aspect. Deep Learning sequential models like RNN, LSTM, and GRU are current state-of-the-art methods for…

Computation and Language · Computer Science 2022-08-05 Ashish Kumar , Vasundhra Dahiya , Aditi Sharan

In this paper, we describe a new corpus-based approach to prepositional phrase attachment disambiguation, and present results comparing performance of this algorithm with other corpus-based approaches to this problem.

cmp-lg · Computer Science 2008-02-03 Eric Brill , Philip Resnik

We extend the centering model for the resolution of intra-sentential anaphora and specify how to handle complex sentences. An empirical evaluation indicates that the functional information structure guides the search for an antecedent…

cmp-lg · Computer Science 2008-02-03 Michael Strube

We propose a novel framework for modeling event-related potentials (ERPs) collected during reading that couples pre-trained convolutional decoders with a language model. Using this framework, we compare the abilities of a variety of…

Computation and Language · Computer Science 2019-04-03 Shaorong Yan , Aaron Steven White

Syntactic structures used to play a vital role in natural language processing (NLP), but since the deep learning revolution, NLP has been gradually dominated by neural models that do not consider syntactic structures in their design. One…

Computation and Language · Computer Science 2023-11-28 Haoyi Wu , Kewei Tu

Event extraction is typically modeled as a multi-class classification problem where event types and argument roles are treated as atomic symbols. These approaches are usually limited to a set of pre-defined types. We propose a novel event…

Computation and Language · Computer Science 2022-03-23 Sijia Wang , Mo Yu , Shiyu Chang , Lichao Sun , Lifu Huang

Dependency parsing is a fundamental task in natural language processing (NLP), aiming to identify syntactic dependencies and construct a syntactic tree for a given sentence. Traditional dependency parsing models typically construct…

Computation and Language · Computer Science 2025-02-25 Keunha Kim , Youngjoong Ko

The execution of an event in a complex and distributed system where the dependencies vary during the evolution of the system can be represented in many ways, and one of them is to use Context-Dependent Event structures. Event structures are…

Logic in Computer Science · Computer Science 2023-06-22 G. Michele Pinna

The aspect-based sentiment analysis (ABSA) task remains to be a long-standing challenge, which aims to extract the aspect term and then identify its sentiment orientation.In previous approaches, the explicit syntactic structure of a…

Computation and Language · Computer Science 2020-04-07 Yunlong Liang , Fandong Meng , Jinchao Zhang , Jinan Xu , Yufeng Chen , Jie Zhou

Anaphoric reference is an aspect of language interpretation covering a variety of types of interpretation beyond the simple case of identity reference to entities introduced via nominal expressions covered by the traditional coreference…

Computation and Language · Computer Science 2022-05-26 Silviu Paun , Juntao Yu , Nafise Sadat Moosavi , Massimo Poesio

Languages may encode similar meanings using different sentence structures. This makes it a challenge to provide a single set of formal rules that can derive meanings from sentences in many languages at once. To overcome the challenge, we…

Computation and Language · Computer Science 2024-03-05 Laurestine Bradford , Timothy John O'Donnell , Siva Reddy

Transformer-based pre-trained models like BERT have achieved great progress on Semantic Sentence Matching. Meanwhile, dependency prior knowledge has also shown general benefits in multiple NLP tasks. However, how to efficiently integrate…

Computation and Language · Computer Science 2023-08-25 Jian Song , Di Liang , Rumei Li , Yuntao Li , Sirui Wang , Minlong Peng , Wei Wu , Yongxin Yu

High dimensional hypothesis test deals with models in which the number of parameters is significantly larger than the sample size. Existing literature develops a variety of individual tests. Some of them are sensitive to the dense and small…

Statistics Theory · Mathematics 2018-08-09 Cheng Zhou , Xinsheng Zhang , Wenxin Zhou , Han Liu

Syntactic Transformer language models aim to achieve better generalization through simultaneously modeling syntax trees and sentences. While prior work has been focusing on adding constituency-based structures to Transformers, we introduce…

Computation and Language · Computer Science 2024-07-25 Yida Zhao , Chao Lou , Kewei Tu

Robust and flexible event representations are important to many core areas in language understanding. Scripts were proposed early on as a way of representing sequences of events for such understanding, and has recently attracted renewed…

Computation and Language · Computer Science 2017-11-22 Noah Weber , Niranjan Balasubramanian , Nathanael Chambers

We present an approach to develop folds for nested data types using dependent types. We call such folds $\textit{dependently typed folds}$, they have the following properties. (1) Dependently typed folds are defined by well-founded…

Logic in Computer Science · Computer Science 2018-06-18 Peng Fu , Peter Selinger

We present a novel dependent linear type theory in which the multiplicity of some variable-i.e., the number of times the variable can be used in a program-can depend on other variables. This allows us to give precise resource annotations to…

Programming Languages · Computer Science 2026-05-20 Maximilian Doré

In this paper I explain the reasons that led me to research and conceive a novel technology for dependency parsing, mixing together the strengths of data-driven transition-based and constraint-based approaches. In particular I highlight the…

Computation and Language · Computer Science 2015-07-22 Matteo Grella

This paper presents an analysis of temporal anaphora in sentences which contain quantification over events, within the framework of Discourse Representation Theory. The analysis in (Partee 1984) of quantified sentences, introduced by a…

cmp-lg · Computer Science 2019-08-14 Rani Nelken , Nissim Francez