English
Related papers

Related papers: Extracting and Learning a Dependency-Enhanced Type…

200 papers

While information from the field of linguistic typology has the potential to improve performance on NLP tasks, reliable typological data is a prerequisite. Existing typological databases, including WALS and Grambank, suffer from…

Computation and Language · Computer Science 2024-02-05 Emi Baylor , Esther Ploeger , Johannes Bjerva

This paper describes a method for compiling a constraint-based grammar into a potentially more efficient form for processing. This method takes dependent disjunctions within a constraint formula and factors them into non-interacting groups…

cmp-lg · Computer Science 2008-02-03 John Griffith

This paper addresses structural ambiguity in Dutch relative clauses. By investigating the task of disambiguation by grounding, we study how the presence of a prior sentence can resolve relative clause ambiguities. We apply this method to…

Computation and Language · Computer Science 2023-05-25 Gijs Wijnholds , Michael Moortgat

Native type systems are those in which type constructors are derived from term constructors, as well as the constructors of predicate logic and intuitionistic type theory. We present a method to construct native type systems for a broad…

Logic in Computer Science · Computer Science 2022-11-04 Christian Williams , Michael Stay

We generalize intuitionistic tense logics to the multi-modal case by placing grammar logics on an intuitionistic footing. We provide axiomatizations for a class of base intuitionistic grammar logics as well as provide axiomatizations for…

Logic · Mathematics 2021-10-05 Tim S. Lyon

Grammar refers to the system of rules that governs the structural organization and the semantic relations among linguistic units such as sentences, phrases, and words within a given language. In natural language processing, there remains a…

Computation and Language · Computer Science 2026-02-24 Lujun Li , Yewei Song , Lama Sleem , Yiqun Wang , Yangjie Xu , Cedric Lothritz , Niccolo Gentile , Radu State , Tegawende F. Bissyande , Jacques Klein

Dependently typed lambda calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types" notion, such calculi can also encode the correspondence between…

Logic in Computer Science · Computer Science 2010-07-07 Zachary Snow , David Baelde , Gopalan Nadathur

Large language models (LLMs) have proven to be highly effective for solving complex reasoning tasks. Surprisingly, their capabilities can often be improved by iterating on previously generated solutions. In this context, a reasoning plan…

Artificial Intelligence · Computer Science 2025-12-05 MohammadHossein Bateni , Vincent Cohen-Addad , Yuzhou Gu , Silvio Lattanzi , Simon Meierhans , Christopher Mohri

In this thesis, I address the problem of automatically acquiring lexical semantic knowledge, especially that of case frame patterns, from large corpus data and using the acquired knowledge in structural disambiguation. The approach I adopt…

Computation and Language · Computer Science 2007-05-23 Hang LI

Large language models have recently shown promising progress in mathematical reasoning when fine-tuned with human-generated sequences walking through a sequence of solution steps. However, the solution sequences are not formally structured…

Machine Learning · Computer Science 2022-12-07 Andrew J. Nam , Mengye Ren , Chelsea Finn , James L. McClelland

Introducing attentional mechanism in neural network is a powerful concept, and has achieved impressive results in many natural language processing tasks. However, most of the existing models impose attentional distribution on a flat…

Computation and Language · Computer Science 2016-07-25 PengFei Liu , Xipeng Qiu , Xuanjing Huang

Syllabification describes the task of dividing words into syllables. Due to many rules and exceptions, training an algorithm to perform syllabification with high accuracy remains a challenge. Throughout the last decades, different…

Computation and Language · Computer Science 2026-05-29 Gus Lathouwers , Wieke Harmsen , Catia Cucchiarini , Helmer Strik

Several approaches exist to data-mining big corpora of formal proofs. Some of these approaches are based on statistical machine learning, and some -- on theory exploration. However, most are developed for either untyped or simply-typed…

Programming Languages · Computer Science 2017-05-23 Ekaterina Komendantskaya , Jonathan Heras

Empirical grammar research has become increasingly data-driven, but the systematic analysis of annotated corpora still requires substantial methodological and technical effort. We explore how agentic large language models (LLMs) can…

Computation and Language · Computer Science 2025-12-02 Matej Klemen , Tjaša Arčon , Luka Terčon , Marko Robnik-Šikonja , Kaja Dobrovoljc

In this paper, we introduce a novel interpreting framework that learns an interpretable model based on an ontology-based sampling technique to explain agnostic prediction models. Different from existing approaches, our algorithm considers…

Machine Learning · Computer Science 2020-04-02 Phung Lai , NhatHai Phan , Han Hu , Anuja Badeti , David Newman , Dejing Dou

We present an approach for assessing how multilingual large language models (LLMs) learn syntax in terms of multi-formalism syntactic structures. We aim to recover constituent and dependency structures by casting parsing as sequence…

Computation and Language · Computer Science 2023-09-21 Alberto Muñoz-Ortiz , David Vilares , Carlos Gómez-Rodríguez

Deep-learning models for language generation tasks tend to produce repetitive output. Various methods have been proposed to encourage lexical diversity during decoding, but this often comes at a cost to the perceived fluency and adequacy of…

Computation and Language · Computer Science 2021-09-22 Giulio Zhou , Gerasimos Lampouras

This paper examines the characterization and learning of grammars defined with enriched representational models. Model-theoretic approaches to formal language theory traditionally assume that each position in a string belongs to exactly one…

Formal Languages and Automata Theory · Computer Science 2019-06-25 Jane Chandlee , Remi Eyraud , Jeffrey Heinz , Adam Jardine , Jonathan Rawski

Large language models make remarkable progress in reasoning capabilities. Existing works focus mainly on deductive reasoning tasks (e.g., code and math), while another type of reasoning mode that better aligns with human learning, inductive…

Computation and Language · Computer Science 2025-03-18 Kedi Chen , Zhikai Lei , Fan Zhang , Yinqi Zhang , Qin Chen , Jie Zhou , Liang He , Qipeng Guo , Kai Chen , Wei Zhang

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
‹ Prev 1 4 5 6 7 8 10 Next ›