English
Related papers

Related papers: From Partial to Strictly Incremental Constituent P…

200 papers

Answering compositional questions requiring multi-step reasoning is challenging. We introduce an end-to-end differentiable model for interpreting questions about a knowledge graph (KG), which is inspired by formal approaches to semantics.…

Computation and Language · Computer Science 2018-08-30 Nitish Gupta , Mike Lewis

Speculative decoding accelerates LLM inference by utilizing otherwise idle computational resources during memory-to-chip data transfer. Current speculative decoding methods typically assume a considerable amount of available computing…

Computation and Language · Computer Science 2025-11-26 Luohe Shi , Zuchao Li , Lefei Zhang , Baoyuan Qi , Guoming Liu , Hai Zhao

Concept-based interpretability methods offer a lens into the internals of foundation models by decomposing their embeddings into high-level concepts. These concept representations are most useful when they are compositional, meaning that…

Computation and Language · Computer Science 2024-06-27 Adam Stein , Aaditya Naik , Yinjun Wu , Mayur Naik , Eric Wong

Distributed word representations are very useful for capturing semantic information and have been successfully applied in a variety of NLP tasks, especially on English. In this work, we innovatively develop two component-enhanced Chinese…

Computation and Language · Computer Science 2015-08-28 Yanran Li , Wenjie Li , Fei Sun , Sujian Li

Writers generally rely on plans or sketches to write long stories, but most current language models generate word by word from left to right. We explore coarse-to-fine models for creating narrative texts of several hundred words, and…

Computation and Language · Computer Science 2019-06-18 Angela Fan , Mike Lewis , Yann Dauphin

Easy-first parsing relies on subtree re-ranking to build the complete parse tree. Whereas the intermediate state of parsing processing is represented by various subtrees, whose internal structural information is the key lead for later…

Computation and Language · Computer Science 2019-06-12 Zuchao Li , Jiaxun Cai , Hai Zhao

Many common sequential data sources, such as source code and natural language, have a natural tree-structured representation. These trees can be generated by fitting a sequence to a grammar, yielding a hierarchical ordering of the tokens in…

Machine Learning · Computer Science 2019-08-02 Jacob Harer , Chris Reale , Peter Chin

The connection between dependency trees and spanning trees is exploited by the NLP community to train and to decode graph-based dependency parsers. However, the NLP literature has missed an important difference between the two structures:…

Computation and Language · Computer Science 2020-10-08 Ran Zmigrod , Tim Vieira , Ryan Cotterell

Semantic parsing is the problem of deriving machine interpretable meaning representations from natural language utterances. Neural models with encoder-decoder architectures have recently achieved substantial improvements over traditional…

Computation and Language · Computer Science 2019-09-30 Huseyin A. Inan , Gaurav Singh Tomar , Huapu Pan

A structural time series model additively decomposes into generative, semantically-meaningful components, each of which depends on a vector of parameters. We demonstrate that considering each generative component together with its vector of…

Methodology · Statistics 2020-09-16 David Rushing Dewhurst

Dependency parsing is an essential task in NLP, and the quality of dependency parsers is crucial for many downstream tasks. Parsers' quality often varies depending on the domain and the language involved. Therefore, it is essential to…

Computation and Language · Computer Science 2024-04-04 Adithya Kulkarni , Oliver Eulenstein , Qi Li

Incrementality is ubiquitous in human-human interaction and beneficial for human-computer interaction. It has been a topic of research in different parts of the NLP community, mostly with focus on the specific topic at hand even though…

Computation and Language · Computer Science 2018-06-15 Arne Köhn

Neural encoder-decoder models of machine translation have achieved impressive results, rivalling traditional translation models. However their modelling formulation is overly simplistic, and omits several key inductive biases built into…

Computation and Language · Computer Science 2016-01-07 Trevor Cohn , Cong Duy Vu Hoang , Ekaterina Vymolova , Kaisheng Yao , Chris Dyer , Gholamreza Haffari

Head-driven phrase structure grammar (HPSG) enjoys a uniform formalism representing rich contextual syntactic and even semantic meanings. This paper makes the first attempt to formulate a simplified HPSG by integrating constituent and…

Computation and Language · Computer Science 2020-05-06 Junru Zhou , Hai Zhao

Text generation is a fundamental building block in natural language processing tasks. Existing sequential models performs autoregression directly over the text sequence and have difficulty generating long sentences of complex structures.…

Computation and Language · Computer Science 2018-08-16 Qipeng Guo , Xipeng Qiu , Xiangyang Xue , Zheng Zhang

Parsing expression grammars (PEGs) offer a natural opportunity for building verified parser interpreters based on higher-order parsing combinators. PEGs are expressive, unambiguous, and efficient to parse in a top-down recursive descent…

Logic in Computer Science · Computer Science 2020-01-14 Clement Blaudeau , Natarajan Shankar

Intuitionistic grammar logics fuse constructive and multi-modal reasoning while permitting the use of converse modalities, serving as a generalization of standard intuitionistic modal logics. In this paper, we provide definitions of these…

Logic in Computer Science · Computer Science 2025-12-04 Tim S. Lyon

We introduce the task of cross-lingual semantic parsing: mapping content provided in a source language into a meaning representation based on a target language. We present: (1) a meaning representation designed to allow systems to target…

Computation and Language · Computer Science 2018-04-24 Sheng Zhang , Kevin Duh , Benjamin Van Durme

Transition-based and graph-based dependency parsers have previously been shown to have complementary strengths and weaknesses: transition-based parsers exploit rich structural features but suffer from error propagation, while graph-based…

Computation and Language · Computer Science 2019-08-28 Artur Kulmizev , Miryam de Lhoneux , Johannes Gontrum , Elena Fano , Joakim Nivre

Building meaningful phrase representations is challenging because phrase meanings are not simply the sum of their constituent meanings. Lexical composition can shift the meanings of the constituent words and introduce implicit information.…

Computation and Language · Computer Science 2019-05-21 Vered Shwartz , Ido Dagan
‹ Prev 1 8 9 10 Next ›