English
Related papers

Related papers: S\'emantique des d\'eterminants dans un cadre rich…

200 papers

The semantics of determiner phrases, be they definite de- scriptions, indefinite descriptions or quantified noun phrases, is often as- sumed to be a fully solved question: common nouns are properties, and determiners are generalised…

Computation and Language · Computer Science 2016-03-02 Christian Retoré

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 propose a cognitively and linguistically motivated set of sorts for lexical semantics in a compositional setting: the classifiers in languages that do have such pronouns. These sorts are needed to include lexical considerations in a…

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

We investigate the possibility of modelling the syntax and semantics of natural language by constraints, or rules, imposed by the multi-dimensional type theory Nabla. The only multiplicity we explicitly consider is two, namely one dimension…

Computation and Language · Computer Science 2007-05-23 Jørgen Villadsen

This paper presents a lexical disambiguation system, initially developed for English and now adapted to French. This system associates a word with its meaning in a given context using electronic dictionaries as semantically annotated…

Digital Libraries · Computer Science 2016-08-16 Caroline Brun , Bernard Jacquemin , Frédérique Segond

We present a novel approach to construction of a formal semantics for a programming language. Our approach, using a parametric denotational semantics, allows the semantics to be easily extended to support new language features, and…

Programming Languages · Computer Science 2018-12-04 In-Ho Yi

Detecting fine-grained differences in content conveyed in different languages matters for cross-lingual NLP and multilingual corpora analysis, but it is a challenging machine learning problem since annotation is expensive and hard to scale.…

Computation and Language · Computer Science 2020-10-09 Eleftheria Briakou , Marine Carpuat

This paper surveys the common approach to quantification and generalised quantification in formal linguistics and philosophy of language. We point out how this general setting departs from empirical linguistic data, and give some hints for…

Logic · Mathematics 2013-01-30 Michele Abrusci , Christian Retoré

Existing syntactic grammars of natural languages, even with a far from complete coverage, are complex objects. Assessments of the quality of parts of such grammars are useful for the validation of their construction. We evaluated the…

Computation and Language · Computer Science 2007-11-22 Eric Laporte

We present a framework, named the Montagovian generative lexicon, for computing the semantics of natural language sentences, expressed in many sorted higher order logic. Word meaning is depicted by lambda terms of second order lambda…

Logic in Computer Science · Computer Science 2014-01-06 Christian Retoré

Deep compositional models of meaning acting on distributional representations of words in order to produce vectors of larger text constituents are evolving to a popular area of NLP research. We detail a compositional distributional…

Computation and Language · Computer Science 2015-08-14 Jianpeng Cheng , Dimitri Kartsaklis

Capturing the meaning of sentences has long been a challenging task. Current models tend to apply linear combinations of word features to conduct semantic composition for bigger-granularity units e.g. phrases, sentences, and documents.…

Computation and Language · Computer Science 2019-02-27 Benyou Wang , Qiuchi Li , Massimo Melucci , Dawei Song

We propose a mathematical framework for a unification of the distributional theory of meaning in terms of vector space models, and a compositional theory for grammatical types, for which we rely on the algebra of Pregroups, introduced by…

Computation and Language · Computer Science 2010-03-24 Bob Coecke , Mehrnoosh Sadrzadeh , Stephen Clark

We develop a system which must be able to perform the same inferences that a human reader of an accident report can do and more particularly to determine the apparent causes of the accident. We describe the general framework in which we are…

Artificial Intelligence · Computer Science 2007-05-23 Farid Nouioua , Daniel Kayser

Algebraic theories with dependency between sorts form the structural core of Martin-L\"of type theory and similar systems. Their denotational semantics are typically studied using categorical techniques; many different categorical…

Category Theory · Mathematics 2024-12-31 Benedikt Ahrens , Peter LeFanu Lumsdaine , Paige Randall North

Lexicon-Grammar tables are a very rich syntactic lexicon for the French language. This linguistic database is nevertheless not directly suitable for use by computer programs, as it is incomplete and lacks consistency. Tables are defined on…

Computation and Language · Computer Science 2010-09-27 Elsa Tolone , Stavroula Voyatzi , Christian Leclère

We earlier described two taggers for French, a statistical one and a constraint-based one. The two taggers have the same tokeniser and morphological analyser. In this paper, we describe aspects of this work concerned with the definition of…

cmp-lg · Computer Science 2008-02-03 Jean-Pierre Chanod , Pasi Tapanainen

The recognition and classification of Named Entities (NER) are regarded as an important component for many Natural Language Processing (NLP) applications. The classification is usually made by taking into account the immediate context in…

Computation and Language · Computer Science 2010-04-01 Claude Martineau , Elsa Tolone , Stavroula Voyatzi

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

Type analyses of logic programs which aim at inferring the types of the program being analyzed are presented in a unified abstract interpretation-based framework. This covers most classical abstract interpretation-based type analyzers for…

Software Engineering · Computer Science 2009-09-29 Claudio Vaucheret , Francisco Bueno
‹ Prev 1 2 3 10 Next ›