English
Related papers

Related papers: Feature-Based TAG in place of multi-component adju…

200 papers

This paper compares the consistency-based account of agreement phenomena in `unification-based' grammars with an implication-based account based on a simple feature extension to Lambek Categorial Grammar (LCG). We show that the LCG…

cmp-lg · Computer Science 2008-02-03 Sam Bayer , Mark Johnson

Explanations in a recommender system assist users in making informed decisions among a set of recommended items. Great research attention has been devoted to generating natural language explanations to depict how the recommendations are…

Information Retrieval · Computer Science 2022-02-22 Peng Wang , Renqin Cai , Hongning Wang

Combining multiple audio features can improve the performance of music tagging, but common deep learning-based feature fusion methods often lack interpretability. To address this problem, we propose a Genetic Programming (GP) pipeline that…

Semantically non-compositional phrases constitute an intriguing research topic in Natural Language Processing. Semantic non-compositionality --the situation when the meaning of a phrase cannot be derived from the meaning of its components,…

Computation and Language · Computer Science 2019-08-16 Meghdad Farahmand

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

This is a companion piece to my paper on "Example-Based Procedural Modeling Using Graph Grammars." This paper examines some of the theoretical issues in more detail. This paper discusses some more complex parts of the implementation, why…

Graphics · Computer Science 2023-09-04 Paul Merrell

Language Models (LMs) have emerged as powerful sources of evidence for linguists seeking to develop theories of syntax. In this paper, we argue that causal interpretability methods, applied to LMs, can greatly enhance the value of such…

Computation and Language · Computer Science 2025-10-01 Sasha Boguraev , Christopher Potts , Kyle Mahowald

Existing technology can parse arbitrary context-free grammars, but only a single, static grammar per input. In order to support more powerful syntax-extension systems, we propose reflective grammars, which can modify their own syntax during…

Programming Languages · Computer Science 2011-02-14 Paul Stansifer , Mitchell Wand

The paper presents a language model that develops syntactic structure and uses it to extract meaningful information from the word history, thus enabling the use of long distance dependencies. The model assigns probability to every joint…

Computation and Language · Computer Science 2007-05-23 Ciprian Chelba

We present a parsing algorithm with polynomial time complexity for a large subset of V-TAG languages. V-TAG, a variant of multi-component TAG, can handle free-word order phenomena which are beyond the class LCFRS (which includes regular…

cmp-lg · Computer Science 2008-02-03 Tilman Becker , Owen Rambow

The paper defends the notion that semantic tagging should be viewed as more than disambiguation between senses. Instead, semantic tagging should be a first step in the interpretation process by assigning each lexical item a representation…

cmp-lg · Computer Science 2008-02-03 Paul Buitelaar

We propose two new dependent type systems. The first, is a dependent graded/linear type system where a graded dependent type system is connected via modal operators to a linear type system in the style of Linear/Non-linear logic. We then…

Logic in Computer Science · Computer Science 2023-07-20 Peter Hanukaev , Harley Eades

We present an approach to syntax-based machine translation that combines unification-style interpretation with statistical processing. This approach enables us to translate any Japanese newspaper article into English, with quality far…

cmp-lg · Computer Science 2009-09-25 Vasileios Hatzivassiloglou , Kevin Knight

In this paper we investigated two different methods to parse relative and noun complement clauses in English and resorted to distinct tags for their corresponding that as a relative pronoun and as a complementizer. We used an algorithm to…

Computation and Language · Computer Science 2022-12-07 Zineddine Tighidet , Nicolas Ballier

Despite the remarkable progress of Large Language Models (LLMs), their performance in question answering (QA) remains limited by the lack of domain-specific and up-to-date knowledge. Retrieval-Augmented Generation (RAG) addresses this…

Information Retrieval · Computer Science 2025-09-17 Yaodong Su , Yixiang Fang , Yingli Zhou , Quanqing Xu , Chuanhui Yang

Annotating music items with music genres is crucial for music recommendation and information retrieval, yet challenging given that music genres are subjective concepts. Recently, in order to explicitly consider this subjectivity, the…

Computation and Language · Computer Science 2020-09-17 Elena V. Epure , Guillaume Salha , Romain Hennequin

Reinforcement learning has proven effective for enhancing multi-step reasoning in large language models (LLMs), yet its benefits have not fully translated to multilingual contexts. Existing methods struggle with a fundamental trade-off:…

Computation and Language · Computer Science 2026-05-22 Yuchun Fan , Bei Li , Peiguang Li , Yilin Wang , Yongyu Mu , Jian Yang , Xin Chen , Rongxiang Weng , Jingang Wang , Xunliang Cai , Jingbo Zhu , Tong Xiao

Existing methods in relation extraction have leveraged the lexical features in the word sequence and the syntactic features in the parse tree. Though effective, the lexical features extracted from the successive word sequence may introduce…

Computation and Language · Computer Science 2021-07-29 Mi Zhang , Tieyun Qian

We train one multilingual model for dependency parsing and use it to parse sentences in several languages. The parsing model uses (i) multilingual word clusters and embeddings; (ii) token-level language information; and (iii)…

Computation and Language · Computer Science 2016-07-27 Waleed Ammar , George Mulcaire , Miguel Ballesteros , Chris Dyer , Noah A. Smith

In constituency parsing, span-based decoding is an important direction. However, for Chinese sentences, because of their linguistic characteristics, it is necessary to utilize other models to perform word segmentation first, which…

Computation and Language · Computer Science 2022-12-01 Zhicheng Wang , Tianyu Shi , Cong Liu