English
Related papers

Related papers: Lexicalization and Grammar Development

200 papers

Large language models (LLMs), such as GPT4 and LLaMA, are creating significant advancements in natural language processing, due to their strong text encoding/decoding ability and newly found emergent capability (e.g., reasoning). While LLMs…

Computation and Language · Computer Science 2024-11-22 Bowen Jin , Gang Liu , Chi Han , Meng Jiang , Heng Ji , Jiawei Han

Large Language Models (LLMs) present massive inherent knowledge and superior semantic comprehension capability, which have revolutionized various tasks in natural language processing. Despite their success, a critical gap remains in…

Computation and Language · Computer Science 2025-02-11 Ben Liu , Jihai Zhang , Fangquan Lin , Cheng Yang , Min Peng

Graph plays a significant role in representing and analyzing complex relationships in real-world applications such as citation networks, social networks, and biological data. Recently, Large Language Models (LLMs), which have achieved…

Machine Learning · Computer Science 2024-04-25 Yuhan Li , Zhixun Li , Peisong Wang , Jia Li , Xiangguo Sun , Hong Cheng , Jeffrey Xu Yu

This paper describes our work on parsing Turkish using the lexical-functional grammar formalism. This work represents the first significant effort for parsing Turkish. Our implementation is based on Tomita's parser developed at…

cmp-lg · Computer Science 2008-02-03 Zelal Gungordu , Kemal Oflazer

To take advantage of Large Language Model in theorem formalization and proof, we propose a reinforcement learning framework to iteratively optimize the pretrained LLM by rolling out next tactics and comparing them with the expected ones.…

Artificial Intelligence · Computer Science 2025-02-14 Zhiling Luo

We describe the first experiment of conversion of Lexicon-Grammar tables for French verbs into the Lexical Markup Framework (LMF) format. The Lexicon-Grammar of the French language is currently one of the major sources of lexical and…

Computation and Language · Computer Science 2026-05-15 Eric Laporte , Elsa Tolone , Mathieu Constant

We propose a categorial grammar based on classical multiplicative linear logic. This can be seen as an extension of abstract categorial grammars (ACG) and is at least as expressive. However, constituents of {\it linear logic grammars (LLG)}…

Logic · Mathematics 2020-08-04 Sergey Slavnov

In this paper we provide for parsing with respect to grammars expressed in a general TFS-based formalism, a restriction of ALE. Our motivation being the design of an abstract (WAM-like) machine for the formalism, we consider parsing as a…

cmp-lg · Computer Science 2016-08-31 Shuly Wintner , Nissim Francez

Semantic parsing is the task of producing structured meaning representations for natural language sentences. Recent research has pointed out that the commonly-used sequence-to-sequence (seq2seq) semantic parsers struggle to generalize…

Computation and Language · Computer Science 2022-06-02 Dora Jambor , Dzmitry Bahdanau

Critical to natural language generation is the production of correctly inflected text. In this paper, we isolate the task of predicting a fully inflected sentence from its partially lemmatized version. Unlike traditional morphological…

Computation and Language · Computer Science 2019-05-07 Ekaterina Vylomova , Ryan Cotterell , Timothy Baldwin , Trevor Cohn , Jason Eisner

Human languages have evolved to be structured through repeated language learning and use. These processes introduce biases that operate during language acquisition and shape linguistic systems toward communicative efficiency. In this paper,…

Computation and Language · Computer Science 2024-12-16 Tom Kouwenhoven , Max Peeperkorn , Tessa Verhoef

Because of their superior ability to preserve sequence information over time, Long Short-Term Memory (LSTM) networks, a type of recurrent neural network with a more complex computational unit, have obtained strong results on a variety of…

Computation and Language · Computer Science 2015-06-02 Kai Sheng Tai , Richard Socher , Christopher D. Manning

We tackle the task of enriching ontologies by automatically translating natural language sentences into Description Logic. Since Large Language Models (LLMs) are the best tools for translations, we fine-tuned a GPT-3 model to convert…

Artificial Intelligence · Computer Science 2023-08-01 Patricia Mateiu , Adrian Groza

In this chapter, we introduce a new dialogical system for first order classical logic which is close to natural language argumentation, and we prove its completeness with respect to usual classical validity. We combine our dialogical system…

Computation and Language · Computer Science 2020-08-18 Davide Catta , Richard Moot , Christian Retoré

Traditionally, formal languages are defined as sets of words. More recently, the alternative coalgebraic or coinductive representation as infinite tries, i.e., prefix trees branching over the alphabet, has been used to obtain compact and…

Logic in Computer Science · Computer Science 2023-06-22 Dmitriy Traytel

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

Once one has enriched LFG's formal machinery with the linear logic mechanisms needed for semantic interpretation as proposed by Dalrymple et. al., it is natural to ask whether these make any existing components of LFG redundant. As…

cmp-lg · Computer Science 2007-05-23 Mark Johnson

With XML becoming an ubiquitous language for data interoperability purposes in various domains, efficiently querying XML data is a critical issue. This has lead to the design of algebraic frameworks based on tree-shaped patterns akin to the…

Databases · Computer Science 2017-01-18 Marouane Hachicha , Jérôme Darmont

The paper describes an extensive experiment in inside-outside estimation of a lexicalized probabilistic context free grammar for German verb-final clauses. Grammar and formalism features which make the experiment feasible are described.…

Computation and Language · Computer Science 2007-05-23 Franz Beil , Glenn Carroll , Detlef Prescher , Stefan Riezler , Mats Rooth

Though linguistic knowledge emerges during large-scale language model pretraining, recent work attempt to explicitly incorporate human-defined linguistic priors into task-specific fine-tuning. Infusing language models with syntactic or…

Computation and Language · Computer Science 2022-10-25 Changlong Yu , Tianyi Xiao , Lingpeng Kong , Yangqiu Song , Wilfred Ng