English
Related papers

Related papers: Treating clitics with minimalist grammars

200 papers

Automated definition generation systems have been proposed to support vocabulary expansion for language learners. The main barrier to the success of these systems is that learners often struggle to understand definitions due to the presence…

Computation and Language · Computer Science 2026-04-28 Aaron Gluck , Katharina von der Wense , Maria Leonor Pacheco

Shifting to a lexicalized grammar reduces the number of parsing errors and improves application results. However, such an operation affects a syntactic parser in all its aspects. One of our research objectives is to design a realistic model…

Computation and Language · Computer Science 2007-11-22 Eric Laporte , Sébastien Paumier

Identifying linguistic differences between dialects of a language often requires expert knowledge and meticulous human analysis. This is largely due to the complexity and nuance involved in studying various dialects. We present a novel…

Computation and Language · Computer Science 2024-03-26 Roy Xie , Orevaoghene Ahia , Yulia Tsvetkov , Antonios Anastasopoulos

Cross-Lingual Text Simplification (CLTS) aims to make content more accessible across languages by simultaneously addressing both linguistic complexity and translation. This study investigates the effectiveness of different prompting…

Computation and Language · Computer Science 2026-04-28 Ido Dahan , Omer Toledano , Roey J. Gafter , Sharon Pardo , Oren Tsur , Hila Zahavi , Elior Sulem

We first recall some basic notions on minimalist grammars and on categorial grammars. Next we shortly introduce partially commutative linear logic, and our representation of minimalist grammars within this categorial system, the so-called…

Computation and Language · Computer Science 2010-12-15 Maxime Amblard , Alain Lecomte , Christian Retoré

We introduce proper display calculi for basic monotonic modal logic, the conditional logic CK and a number of their axiomatic extensions. These calculi are sound, complete, conservative and enjoy cut elimination and subformula property. Our…

Existing methods for complexity estimation are typically developed for entire documents. This limitation in scope makes them inapplicable for shorter pieces of text, such as health assessment tools. These typically consist of lists of…

Computation and Language · Computer Science 2024-04-02 Sondre Wold , Petter Mæhlum , Oddbjørn Hove

The Lambek calculus provides a foundation for categorial grammar in the form of a logic of concatenation. But natural language is characterized by dependencies which may also be discontinuous. In this paper we introduce the displacement…

Computation and Language · Computer Science 2010-04-26 Glyn Morrill , Oriol Valentín

The variation of word meaning according to the context leads us to enrich the type system of our syntactical and semantic analyser of French based on categorial grammars and Montague semantics (or lambda-DRT). The main advantage of a deep…

Computation and Language · Computer Science 2013-05-20 Christian Retoré

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

We leverage generative large language models for language learning applications, focusing on estimating the difficulty of foreign language texts and simplifying them to lower difficulty levels. We frame both tasks as prediction problems and…

Computation and Language · Computer Science 2024-07-26 Henri Jamet , Yash Raj Shrestha , Michalis Vlachos

Sign Language (SL) automatic processing slowly progresses bottom-up. The field has seen proposition to handle the video signal, to recognize and synthesize sublexical and lexical units. It starts to see the development of supra-lexical…

Computation and Language · Computer Science 2014-03-19 Rémi Dubot , Christophe Collet

Although unification can be used to implement a weak form of $\beta$-reduction, several linguistic phenomena are better handled by using some form of $\lambda$-calculus. In this paper we present a higher order feature description calculus…

cmp-lg · Computer Science 2008-02-03 Luis Damas , Nelma Moreira

We introduce proper display calculi for basic monotonic modal logic,the conditional logic CK and a number of their axiomatic extensions. These calculi are sound, complete, conservative and enjoy cut elimination and subformula property. Our…

We first present our view of detection and correction of syntactic errors. We then introduce a new correction method, based on heuristic criteria used to decide which correction should be preferred. Weighting of these criteria leads to a…

cmp-lg · Computer Science 2009-09-25 Damien Genthial , Jacques Courtin , Jacques Menezo Equipe Trilan

This paper explores morpho-syntactic ambiguities for French to develop a strategy for part-of-speech disambiguation that a) reflects the complexity of French as an inflected language, b) optimizes the estimation of probabilities, c) allows…

cmp-lg · Computer Science 2007-05-23 Evelyne Tzoukermann , Dragomir R. Radev , William A. Gale

The short note describes the chart parser for multimodal type-logical grammars which has been developed in conjunction with the type-logical treebank for French. The chart parser presents an incomplete but fast implementation of proof…

Computation and Language · Computer Science 2018-04-09 Richard Moot

Reading text in real-world scenarios often requires understanding the context surrounding it, especially when dealing with poor-quality text. However, current scene text recognizers are unaware of the bigger picture as they operate on…

Computer Vision and Pattern Recognition · Computer Science 2023-07-25 Aviad Aberdam , David Bensaïd , Alona Golts , Roy Ganz , Oren Nuriel , Royee Tichauer , Shai Mazor , Ron Litman

Large language models (LLMs) can explain grammatical rules, yet they often fail to apply those rules when judging sentence acceptability. We present "grammar prompting", an explain-then-process paradigm: a large LLM first produces a concise…

Computation and Language · Computer Science 2025-06-04 Russell Scheinberg , Ameeta Agrawal , Amber Shore , So Young Lee

We study the notion of stratification, as used in subsystems of linear logic with low complexity bounds on the cut-elimination procedure (the so-called light logics), from an abstract point of view, introducing a logical system in which…

Logic in Computer Science · Computer Science 2015-09-04 Pierre Boudes , Damiano Mazza , Lorenzo Tortora de Falco
‹ Prev 1 2 3 10 Next ›