English
Related papers

Related papers: How to define a context-free backbone for DGs: Imp…

200 papers

We present a deep hierarchical recurrent neural network for sequence tagging. Given a sequence of words, our model employs deep gated recurrent units on both character and word levels to encode morphology and context information, and…

Computation and Language · Computer Science 2016-08-10 Zhilin Yang , Ruslan Salakhutdinov , William Cohen

An interesting and frequent type of multi-word expression (MWE) is the headless MWE, for which there are no true internal syntactic dominance relations; examples include many named entities ("Wells Fargo") and dates ("July 5, 2020") as well…

Computation and Language · Computer Science 2020-05-08 Tianze Shi , Lillian Lee

As LLMs are increasingly integrated into agentic systems, they must adhere to dynamically defined, machine-interpretable interfaces. We evaluate LLMs as in-context interpreters: given a novel context-free grammar, can LLMs generate…

Artificial Intelligence · Computer Science 2026-04-23 Hanqi Li , Lu Chen , Kai Yu

Domain models enable autonomous agents to solve long-horizon tasks by producing interpretable plans. However, in open-world environments, a single general domain model cannot capture the variety of tasks, so agents must generate suitable…

Robotics · Computer Science 2025-10-02 Claudius Kienle , Benjamin Alt , Oleg Arenz , Jan Peters

We present a general formal argumentation system for dealing with the detachment of conditional obligations. Given a set of facts, constraints, and conditional obligations, we answer the question whether an unconditional obligation is…

Artificial Intelligence · Computer Science 2016-06-02 Mathieu Beirlaen , Christian Straßer

Reasoning over knowledge graphs is traditionally built upon a hierarchy of languages in the Semantic Web Stack. Starting from the Resource Description Framework (RDF) for knowledge graphs, more advanced constructs have been introduced…

Formal Languages and Automata Theory · Computer Science 2020-03-10 Zhangsheng Lai , Aik Beng Ng , Liang Ze Wong , Simon See , Shaowei Lin

Fully data-driven, deep learning-based models are usually designed as language-independent and have been shown to be successful for many natural language processing tasks. However, when the studied language is low-resourced and the amount…

Computation and Language · Computer Science 2022-09-21 Şaziye Betül Özateş , Arzucan Özgür , Tunga Güngör , Balkız Öztürk

In derivational morphology, what mechanisms govern the variation in form-meaning relations between words? The answers to this type of questions are typically based on intuition and on observations drawn from limited data, even when a wide…

Computation and Language · Computer Science 2026-04-15 Hathout Nabil , Basilio Calderone , Fiammetta Namer , Franck Sajous

Most definitions of ontology, viewed as a "specification of a conceptualization", agree on the fact that if an ontology can take different forms, it necessarily includes a vocabulary of terms and some specification of their meaning in…

Artificial Intelligence · Computer Science 2008-01-09 Christophe Roche

Language models have emerged as a central component across NLP, and a great deal of progress depends on the ability to cheaply adapt them (e.g., through finetuning) to new domains and tasks. A language model's vocabulary$-$typically…

Computation and Language · Computer Science 2020-10-07 Nikolaos Pappas , Phoebe Mulcaire , Noah A. Smith

In cross-lingual text classification, it is required that task-specific training data in high-resource source languages are available, where the task is identical to that of a low-resource target language. However, collecting such training…

Computation and Language · Computer Science 2021-09-13 Nuttapong Chairatanakul , Noppayut Sriwatanasakdi , Nontawat Charoenphakdee , Xin Liu , Tsuyoshi Murata

RDF (Resource Description Framework) is a standard language to represent graph databases. Query languages for RDF databases usually include primitives to support path queries, linking pairs of vertices of the graph that are connected by a…

Databases · Computer Science 2020-04-08 Ciro M. Medeiros , Martin A. Musicante , Umberto S. Costa

Text documents are structured on multiple levels of detail: individual words are related by syntax, but larger units of text are related by discourse structure. Existing language models generally fail to account for discourse structure, but…

Computation and Language · Computer Science 2016-02-23 Yangfeng Ji , Trevor Cohn , Lingpeng Kong , Chris Dyer , Jacob Eisenstein

Unsupervised dependency parsing, which tries to discover linguistic dependency structures from unannotated data, is a very challenging task. Almost all previous work on this task focuses on learning generative models. In this paper, we…

Computation and Language · Computer Science 2017-08-04 Jiong Cai , Yong Jiang , Kewei Tu

Muller and Schupp introduced the concept of context-free graphs (originating from Cayley graphs of context-free groups). These graphs are always tree-like (i.e. quasi-isometric to a tree) and in this paper we investigate the subclass of…

Formal Languages and Automata Theory · Computer Science 2026-03-10 Jan Philipp Wächter

Parsing Expression Grammars (PEGs) are a recognition-based formalism which allows to describe the syntactical and the lexical elements of a language. The main difference between Context-Free Grammars (CFGs) and PEGs relies on the…

Formal Languages and Automata Theory · Computer Science 2020-11-10 Sérgio Medeiros , Carlos Olarte

To model behavioral and neural correlates of language comprehension in naturalistic environments researchers have turned to broad-coverage tools from natural-language processing and machine learning. Where syntactic structure is explicitly…

Computation and Language · Computer Science 2023-04-18 Miloš Stanojević , Jonathan R. Brennan , Donald Dunagan , Mark Steedman , John T. Hale

Literal movement grammars (LMGs) provide a general account of extraposition phenomena through an attribute mechanism allowing top-down displacement of syntactical information. LMGs provide a simple and efficient treatment of complex…

cmp-lg · Computer Science 2016-08-31 Annius V. Groenink

Augmenting Transformers with linguistic structures effectively enhances the syntactic generalization performance of language models. Previous work in this direction focuses on syntactic tree structures of languages, in particular…

Computation and Language · Computer Science 2026-05-18 Tianyu Huang , Yida Zhao , Chuyan Zhou , Kewei Tu

Relational prediction tasks are fundamental in many real-world applications, where data are naturally stored in relational databases (RDBs). Relational Deep Learning (RDL) addresses this problem by modeling RDBs as graphs and applying graph…

Machine Learning · Computer Science 2026-05-21 Yi Huang , Qingyun Sun , Jia Li , Xingcheng Fu , Jianxin Li