English
Related papers

Related papers: LexGram - a practical categorial grammar formalism…

200 papers

This study analyses Turkish syntax from an informational point of view. Sign based linguistic representation and principles of HPSG (Head-driven Phrase Structure Grammar) theory are adapted to Turkish. The basic informational elements are…

cmp-lg · Computer Science 2008-02-03 Onur Tolga Sehitoglu

We introduce the logical grammar emdebbing (LGE), a model inspired by pregroup grammars and categorial grammars to enable unsupervised inference of lexical categories and syntactic rules from a corpus of text. LGE produces comprehensible…

Computation and Language · Computer Science 2023-06-07 Sean Deyo , Veit Elser

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

We propose a generalization of Categorial Grammar in which lexical categories are defined by means of recursive constraints. In particular, the introduction of relational constraints allows one to capture the effects of (recursive) lexical…

cmp-lg · Computer Science 2008-02-03 Gosse Bouma , Gertjan van Noord

In this paper, we summerize the work done on the resources of Modern Greek on the Lexicon-Grammar of verbs. We detail the definitional features of each table, and all changes made to the names of features to make them consistent. Through…

Computation and Language · Computer Science 2011-11-15 Kyriaki Ioannidou , Elsa Tolone

The ability of Large Language Models (LLMs) to precisely follow complex and fine-grained lexical instructions is a cornerstone of their utility and controllability. However, evaluating this capability remains a significant challenge.…

Computation and Language · Computer Science 2026-03-24 Huimin Ren , Yan Liang , Baiqiao Su , Chaobo Sun , Hengtong Lu , Kaike Zhang , Chen Wei

We describe L-FLAT, a Logtalk Toolkit for teaching Formal Languages and Automata Theory. L-FLAT supports the definition of \textsl{alphabets}, the definition of \textsl{orders} over alphabet symbols, the partial definition of…

Programming Languages · Computer Science 2011-12-19 Paulo Moura , Artur Miguel Dias

Legal multi-label classification is a critical task for organizing and accessing the vast amount of legal documentation. Despite its importance, it faces challenges such as the complexity of legal language, intricate label dependencies, and…

Computation and Language · Computer Science 2025-04-15 Emily Johnson , Xavier Holt , Noah Wilson

In this paper we present a unification-based lexical platform designed for highly inflected languages (like Roman ones). A formalism is proposed for encoding a lemma-based lexical source, well suited for linguistic generalizations. From…

cmp-lg · Computer Science 2016-08-15 José M. Goñi , José C. González

This paper presents the XTAG system, a grammar development tool based on the Tree Adjoining Grammar (TAG) formalism that includes a wide-coverage syntactic grammar for English. The various components of the system are discussed and…

cmp-lg · Computer Science 2008-02-03 Christy Doran , Dania Egedi , Beth Ann Hockey , B. Srinivas , Martin Zaidel

Formality is one of the important characteristics of text documents. The automatic detection of the formality level of a text is potentially beneficial for various natural language processing tasks. Before, two large-scale datasets were…

Computation and Language · Computer Science 2023-09-11 Daryna Dementieva , Nikolay Babakov , Alexander Panchenko

Graph-based ranking methods, such as LexRank, are fundamental in Natural Language Processing (NLP) applications like text summarization, as they measure the relative importance of textual units. Building on recent advances in ranking…

Optimization and Control · Mathematics 2025-09-10 Anna Timonina-Farkas

We propose a concrete surface representation of abstract categorial grammars in the category of word cobordisms or cowordisms for short, which are certain bipartite graphs decorated with words in a given alphabet, generalizing linear logic…

Logic in Computer Science · Computer Science 2021-07-21 Sergey Slavnov

We present a metagrammatical formalism, {\em generic rules}, to give a default interpretation to grammar rules. Our formalism introduces a process of {\em dynamic binding} interfacing the level of pure grammatical knowledge representation…

cmp-lg · Computer Science 2008-02-03 Julio Gonzalo , Teresa Solias

Evaluating the performance of Grammatical Error Correction (GEC) models has become increasingly challenging, as large language model (LLM)-based GEC systems often produce corrections that diverge from provided gold references. This…

Computation and Language · Computer Science 2025-06-24 Jinxiang Xie , Yilin Li , Xunjian Yin , Xiaojun Wan

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 in Computer Science · Computer Science 2019-02-12 Sergey Slavnov

We present a broad coverage Japanese grammar written in the HPSG formalism with MRS semantics. The grammar is created for use in real world applications, such that robustness and performance issues play an important role. It is connected to…

Computation and Language · Computer Science 2007-05-23 Melanie Siegel , Emily M. Bender

The integration of lexical semantics and pragmatics in the analysis of the meaning of natural lan- guage has prompted changes to the global framework derived from Montague. In those works, the original lexicon, in which words were assigned…

Computation and Language · Computer Science 2013-09-05 Bruno Mery , Christian Retoré

We present a system for the investigation of computational properties of categorial grammar parsing based on a labelled analytic tableaux theorem prover. This proof method allows us to take a modular approach, in which the basic grammar can…

cmp-lg · Computer Science 2008-02-03 Saturnino F. Luz-Filho , Patrick Sturt

This paper describes an abstract machine for linguistic formalisms that are based on typed feature structures, such as HPSG. The core design of the abstract machine is given in detail, including the compilation process from a high-level…

cmp-lg · Computer Science 2008-02-03 Shuly Wintner , Nissim Francez