## Project-Team SIGNES Linguistic signs, grammar and meaning: computational logic for natural language

### BibTeX

@MISC{_project-teamsignes,

author = {},

title = {Project-Team SIGNES Linguistic signs, grammar and meaning: computational logic for natural language},

year = {}

}

### OpenURL

### Abstract

Futurs

### Citations

1264 |
The minimalist program
- Chomsky
- 1995
(Show Context)
Citation Context ...inking of the observable part of the sign or of the sentence and its meaning, is a constant question in linguistics both in Chomsky’s Generative Grammar or in the Meaning-Text theory of Mel’čuk [90], =-=[67]-=-. From a mathematical and algorithmic viewpoint, this interface gives rise to some challenges: what is the link between two of the main frameworks, namely generative grammars and categorial grammars? ... |

925 | The Generative Lexicon
- Pustejovsky
- 1995
(Show Context)
Citation Context ...tational semantics, lexical semantics. Participants: Christian Bassac [correspondant], Mauro Gaio, Patrick Henry, Renaud Marlet, Bruno Mery, Reinhard Muskens, Christian Retoré. The Generative Lexicon =-=[99]-=- is a way to represent the internal structure of the meaning of words and morphemes. Hence it is relevant, not to say mandatory, for computing the semantic counterpart of morphological operations. The... |

754 | publications by the team in recent years - Major |

736 |
H.: Foundations of Statistical Natural Language Processing
- Manning, Schütze
- 1999
(Show Context)
Citation Context ... systems, spell checkers, and, in a lesser proportion, natural language generation, automatic summary, and computer aided translation.Project-Team SIGNES 3 Statistical methods and corpus linguistics =-=[88]-=- have been quite successful in the past, but there is a renewal of symbolic methods, and especially of logical ones, due to the advances in logic, the improvement of computer abilities for these rathe... |

724 |
From Discourse to Logic
- Kamp, Reyle
- 1993
(Show Context)
Citation Context ...de, we do not consider ontological aspects of semantics, or lexical semantics, but rather extend the logical semantics to discourse and dialog. This is usually done by Discourse Representation Theory =-=[79]-=-, which is topdown, incremental and involves state changes. 3.2. Word structure and automata: computational morphology Keywords: finite state automata, morphology, transducers. Participants: Gérard Hu... |

383 |
Dependency Syntax: Theory and Practice
- Mel’čuk
- 1988
(Show Context)
Citation Context ... The linking of the observable part of the sign or of the sentence and its meaning, is a constant question in linguistics both in Chomsky’s Generative Grammar or in the Meaning-Text theory of Mel’čuk =-=[90]-=-, [67]. From a mathematical and algorithmic viewpoint, this interface gives rise to some challenges: what is the link between two of the main frameworks, namely generative grammars and categorial gram... |

334 | Regular models of phonological rule systems
- Kaplan, Kay
- 1994
(Show Context)
Citation Context ... as part of syntax. It should be nevertheless observed that the computational models involved in the processing of morphology are of different aspects: finite state automata, regular tranducers, etc. =-=[81]-=-, [82]. At the other end, on the semantics side, we do not consider ontological aspects of semantics, or lexical semantics, but rather extend the logical semantics to discourse and dialog. This is usu... |

312 |
Tree Adjunct Grammars
- Joshi, Levy, et al.
- 1975
(Show Context)
Citation Context ...ontext sensitive languages, are just a bit beyond context-free languages, and they are parsable in polynomial time as well [78]. Among these classes of grammars let us mention Tree Adjoining Grammars =-=[76]-=-, [77] and Minimalist Grammars [103], [104], [91]. Dependency Grammars share some properties with them but the general paradigm is quite different [90], [68]. Edward Stabler [103] introduced Minimalis... |

134 | The convergence of mildly context-sensitive grammatical formalisms
- Joshi, Vijay-Shanker, et al.
- 1991
(Show Context)
Citation Context ...evant classes of grammars for natural language syntax, the so-called mildly context sensitive languages, are just a bit beyond context-free languages, and they are parsable in polynomial time as well =-=[78]-=-. Among these classes of grammars let us mention Tree Adjoining Grammars [76], [77] and Minimalist Grammars [103], [104], [91]. Dependency Grammars share some properties with them but the general para... |

64 | A general computational model for wordform recognition and production
- Koskenniemi
- 1984
(Show Context)
Citation Context ... morphology, transducers. Participants: Gérard Huet [correspondant], Kim Gerdes. Computational models for phonology and morphology are a traditional application of finite state technology [81], [82], =-=[83]-=-, [65]. These models often combine symbolic or logical systems, like rewriting systems, and statistical methods like probabilistic automata which can be learnt from corpora by Hidden Markov Models [88... |

52 | A Descriptive Approach to Language-Theoretic Complexity
- Rogers
- 1998
(Show Context)
Citation Context ...elated to constraint-logic programming or to monadic second order logic. In the MSO style, the pioneering work of James Rogers on Government and Binding and Tree Adjoining Grammars must be mentionned =-=[101]-=-. Uwe Mönnich, Jens Michaelis and Frank Morawietz have obtained a two step description of minimalist grammars that we are studying [95], [94]. In the constraint style issued from the Prolog-Definite C... |

51 |
Towards abstract categorial grammars
- Groote
- 2001
(Show Context)
Citation Context ...toré, Sylvain Salvati [correspondant]. Sylvain Salvati investigated in [57] the respective complexities of the membership and the universal membership problems for Abstract Categorial Grammars (ACGs) =-=[108]-=-. Although this problem has already been addressed in [107], Sylvain Salvati presents some more precise results as well as some new ones. In [58], Sylvain Salvati has showed that the parsing problem i... |

48 | Derivational minimalism is mildly context-sensitive
- Michaelis
- 1998
(Show Context)
Citation Context ... context-free languages, and they are parsable in polynomial time as well [78]. Among these classes of grammars let us mention Tree Adjoining Grammars [76], [77] and Minimalist Grammars [103], [104], =-=[91]-=-. Dependency Grammars share some properties with them but the general paradigm is quite different [90], [68]. Edward Stabler [103] introduced Minimalist Grammars (MGs) as a formalization of the most r... |

40 |
2003) Finite-State Morphology: Xerox Tools And Techniques
- Beesley, Karttunen
(Show Context)
Citation Context ...ology, transducers. Participants: Gérard Huet [correspondant], Kim Gerdes. Computational models for phonology and morphology are a traditional application of finite state technology [81], [82], [83], =-=[65]-=-. These models often combine symbolic or logical systems, like rewriting systems, and statistical methods like probabilistic automata which can be learnt from corpora by Hidden Markov Models [88]. Mor... |

30 |
Universal Grammar and American Sign Language
- Lillo-Martin
- 1991
(Show Context)
Citation Context ...guage, or direct communication in sign language. Given the rarity of linguistic study on the syntax and semantics of sign languages — some exceptions concerning American Sign Language are [96], [86], =-=[87]-=- — before being able to apply our methodology, our first task is to determine the structure of the sentence, using our personal competence as well as our relationship with the deaf community.8 Activi... |

29 | The JAVELIN question-answering system at TREC 2003: A multi-strategy approach with dynamic planning - Nyberg, Mitamura, et al. |

25 |
Proof Nets for Linguistic Analysis
- Moot
- 2002
(Show Context)
Citation Context ...d implemented by Richard Moot, is written in Prolog. This is the most developed and efficient software for categorial grammars, relying on recent development in linear logic, in particular proof nets =-=[93]-=-. Under the supervision of Yannick Le Nir and Christian Retoré, a team of students implemented in OCaML the first steps of a platform for parsing and learning categorial grammars and related formalism... |

25 |
Tree-adjoining grammars. Handbook of Formal Languages and Automata
- Joshi, Schabes
- 1996
(Show Context)
Citation Context ...face gives rise to some challenges: what is the link between two of the main frameworks, namely generative grammars and categorial grammars? The former are exemplified by Tree Adjoining Grammars TAGs =-=[77]-=- or Minimalist Grammars [103]. They enjoy efficient parsing algorithms and broad coverage of syntactic constructs. The latter (see e.g. [92]) are less efficient but provide more accurate analyses. Ind... |

21 |
Property grammars: A fully constraint-based theory
- Blache
- 2004
(Show Context)
Citation Context ...rs and Property Grammars are defined as sets of constraints. The later ones introduced by Philippe Blache offer a rather natural way to describe grammar rules and are newly studied by our group [70], =-=[66]-=-. 3.4. Sentence structure and logic: the syntax/semantics interface Keywords: Montague semantics, categorial grammars, computational semantics. Participants: Maxime Amblard, Pierre Bourreau, Greg Kobe... |

21 |
Pointing out Differences: ASL Pronouns in Syntactic Theory
- Lillo-Martin, Klima
- 1990
(Show Context)
Citation Context ...gn language, or direct communication in sign language. Given the rarity of linguistic study on the syntax and semantics of sign languages — some exceptions concerning American Sign Language are [96], =-=[86]-=-, [87] — before being able to apply our methodology, our first task is to determine the structure of the sentence, using our personal competence as well as our relationship with the deaf community.8 ... |

18 |
A Geometric Hierarchy Beyond Context-Free Languages. Theoret. Comput. Sci
- Weir
- 1992
(Show Context)
Citation Context ...e derivations of minimalist grammars are faithfully described by proof in Multiplicative Exponential Linear Logic. Makoto Kanazawa and Sylvain Salvati [43] related k-control languages defined by Weir =-=[106]-=- and mildly context sensitive formalisms by showing the relation of this hierarchy with the hierarchy of l-multiple context free languages defined in [102]. The proofs use some non-trivial properties ... |

15 |
Transducers as lexicon morphisms, phonemic segmentation by euphony analysis, application to a sanskrit tagger, in "Journal of Functional Programming
- HUET
(Show Context)
Citation Context ...t for morphology, the Zen toolkit, using finite state technology, in OCaML. He obtained excellent performances, thus proving the relevance of pure functional programming for computational linguistics =-=[73]-=-. 4. Application Domains 4.1. Sanskrit philology Keywords: Indian studies, Internet, Sanskrit, natural language processing. Participant: Gérard Huet [correspondant]. Sanskrit literature is extremely r... |

15 | Extending Lambek grammars: a logical account of minimalist grammars
- Lecomte, Retoré
- 2002
(Show Context)
Citation Context ... In order to improve the computational properties of categorial grammars, and to extend their scope, one can try to connect them to more efficient and wider formalisms, like minimalist grammars [85], =-=[84]-=-, [100].Project-Team SIGNES 5 A rather new approach to syntax is known as model-theoretic syntax. Its advantages have been underlined by Geoffrey Pullum in [98]. Instead of viewing the trees or strin... |

15 |
Categorial type logics,” in Handbook of Logic and Language
- Moortgat
- 1997
(Show Context)
Citation Context ... The former are exemplified by Tree Adjoining Grammars TAGs [77] or Minimalist Grammars [103]. They enjoy efficient parsing algorithms and broad coverage of syntactic constructs. The latter (see e.g. =-=[92]-=-) are less efficient but provide more accurate analyses. Indeed these latter systems are used for syntax as well as for logical or predicative semantics like Montague semantics [63], [69] and thus all... |

15 | Remnant Movement and Structural Complexity’, in: G. Bouma et al
- Stabler
(Show Context)
Citation Context ... beyond context-free languages, and they are parsable in polynomial time as well [78]. Among these classes of grammars let us mention Tree Adjoining Grammars [76], [77] and Minimalist Grammars [103], =-=[104]-=-, [91]. Dependency Grammars share some properties with them but the general paradigm is quite different [90], [68]. Edward Stabler [103] introduced Minimalist Grammars (MGs) as a formalization of the ... |

14 |
Communicative Organization in Natural Language: The SemanticCommunicative Structure of Sentences. Benjamins
- Mel’čuk
- 2001
(Show Context)
Citation Context ...hese latter systems are used for syntax as well as for logical or predicative semantics like Montague semantics [63], [69] and thus allow generation algorithms. Other models, like dependency grammars =-=[89]-=-, provide a different account of the syntax/semantics interface. A comparison between dependency models and generative/logical models enables an assessment of the adequacy of these families of models ... |

13 | contexts and the sharing functor: Techniques for symbolic computation
- Linear
- 2003
(Show Context)
Citation Context ...ducers, called Zen for its simplicity. The algorithmic principles of the Zen library are based on the linear contexts data structure (“zippers”) and on the sharing functor (associative memory server) =-=[71]-=-. It has been developed by Gérard Huet and is being used in his Sanskrit modelling platform (see section 5.2). It allows the construction of lexicons, the computation of morphological derivatives and ... |

12 | Generating parallel multilingual LFG-TAG grammars from a MetaGrammar - CLÉMENT, KINYON - 2003 |

12 | On Minimalist Attribute Grammars and Macro Tree Transducers
- Michaelis, Monnich, et al.
- 2001
(Show Context)
Citation Context ...ment and Binding and Tree Adjoining Grammars must be mentionned [101]. Uwe Mönnich, Jens Michaelis and Frank Morawietz have obtained a two step description of minimalist grammars that we are studying =-=[95]-=-, [94]. In the constraint style issued from the Prolog-Definite Clause Grammars, Head Phrase Structure Grammar, Construction Grammars and Property Grammars are defined as sets of constraints. The late... |

11 | Geographical information access for non-structured data - Lesbegueries, Gaio, et al. - 2006 |

10 | Topologie et grammaires formelles de lallemand - Gerdes - 2002 |

10 |
Automated extraction of type-logical supertags from the spoken dutch corpus
- Moot
- 2007
(Show Context)
Citation Context ...egree of preference in order to improve the complexity of the analysis due to the exponential number of choices. The parser has also been adapted to allow for a tight integration with the supertagger =-=[50]-=-. Additionally, several strategies for reducing the search space have been implemented, significantly improving parsing performance. Grail has received an extensive update in 2007: the graph library h... |

10 |
Applications of Finite-State Transducers
- KARTTUNEN
- 2000
(Show Context)
Citation Context ...rt of syntax. It should be nevertheless observed that the computational models involved in the processing of morphology are of different aspects: finite state automata, regular tranducers, etc. [81], =-=[82]-=-. At the other end, on the semantics side, we do not consider ontological aspects of semantics, or lexical semantics, but rather extend the logical semantics to discourse and dialog. This is usually d... |

10 |
Towards a Minimal Logic for Minimalist Grammars: a Transformational Use of Lambek Calculus
- LECOMTE, RETORÉ
- 1999
(Show Context)
Citation Context ...rface. In order to improve the computational properties of categorial grammars, and to extend their scope, one can try to connect them to more efficient and wider formalisms, like minimalist grammars =-=[85]-=-, [84], [100].Project-Team SIGNES 5 A rather new approach to syntax is known as model-theoretic syntax. Its advantages have been underlined by Geoffrey Pullum in [98]. Instead of viewing the trees or... |

9 |
Generative Grammar in Resource Logics
- RETORÉ, STABLER
(Show Context)
Citation Context ...der to improve the computational properties of categorial grammars, and to extend their scope, one can try to connect them to more efficient and wider formalisms, like minimalist grammars [85], [84], =-=[100]-=-.Project-Team SIGNES 5 A rather new approach to syntax is known as model-theoretic syntax. Its advantages have been underlined by Geoffrey Pullum in [98]. Instead of viewing the trees or strings as t... |

9 | Problèmes de filtrage et problèmes d’analyse pour les grammaires catégorielles abstraites - Salvati - 2005 |

9 |
Syntax Analysis in Sanskrit Guided by Semantic Nets Constraints
- Gérard, “Shallow
- 2006
(Show Context)
Citation Context ...relevant pseudo-solutions (segmentations) listed by the Sanskrit reader. The Sanskrit Semantic Analyzer, based on the notion of kāraka of Pān.ini, controls overgeneration using a pertinence principle =-=[42]-=-. The Sanskrit Tagger is an assistant for the tagging of a Sanskrit corpus. Given a sentence, the user chooses among different possible interpretations listed by the morpho-syntactic tools and may sav... |

8 | Améliorer un lexique syntaxique à l’aide des tables du lexiquegrammaire – adverbes en -ment
- Sagot, Fort
- 2007
(Show Context)
Citation Context ...les, whose development has been initiated by Maurice Gross. Sagot and Danlos illustrated and implemented this approach on one kind of non-standard verbal and adjectival entries: impersonal structures =-=[26]-=-. In collaboration with Karën Fort, Benoît Sagot implemented another Lefff enrichment with information originating the Lexicon-Grammar tables concerning adverbs ending with -ment [54]. In collaboratio... |

8 |
The Architecture of the Language Faculty. Linguistic Inquiry Monographs
- Jackendoff
- 1997
(Show Context)
Citation Context ...n sense, it is unlikely that human beings develop all possible interpretations when they process and understand a sentence, and in practice such a construction of all models is definitely untractable =-=[75]-=-. Thirdly, a strict compositional principle does not hold, as the famous Geach examples shows. In this project we address the first issue, which is a real limit, and the third one, in the next section... |

6 |
A Global Process to Access Documents’ Contents from a Geographical Point of View
- Gaio, Sallaberry, et al.
- 2007
(Show Context)
Citation Context ...story (i.e., geographical references). The aim of the PIV project (Virtual Itineraries in Pyrenees) is to add value to a legacy localised corpus in a geographic (spatial) oriented digital library. In =-=[20]-=-, Mauro Gaio, Christian Sallaberry, Patrick Etcheverry, Christophe Marquesuzaà and Julien Lesbegueries present the PIV project. Spatial and temporal core models are proposed to give a formal represent... |

6 |
Representing Discourse in Context’, Handbook of Logic and Language
- Kamp
- 1997
(Show Context)
Citation Context ...rtine. Montague semantics have some limits. Two of them which, technically speaking, concern the context, can be overcome by using DRT, that is Discourse Representation Theory and its variants. [79], =-=[110]-=- Firstly, if one wants to construct the semantics of a piece of text, one has to take into account sequences of sentences, either discourse or dialogue, and to handle the context which is incrementall... |

5 | syntaxe de Damourette et Pichon comme outil de représentation du sens, in "Modèles linguistiques - La |

5 | Logique linéaire et syntaxe des langues, Mémoire d’habilitation à diriger des recherches, Université de Nantes - RETORÉ - 2002 |

5 | S.: Generating Control Languages with Abstract Categorial Grammars
- Kanazawa, Salvati
(Show Context)
Citation Context ...languages of hyperedge replacement grammars; • the derivations of minimalist grammars are faithfully described by proof in Multiplicative Exponential Linear Logic. Makoto Kanazawa and Sylvain Salvati =-=[43]-=- related k-control languages defined by Weir [106] and mildly context sensitive formalisms by showing the relation of this hierarchy with the hierarchy of l-multiple context free languages defined in ... |

5 |
An automata theoretic approach to minimalism
- Kobele, Retoré, et al.
- 2007
(Show Context)
Citation Context ...Project-Team SIGNES 15 • • the derivation trees of minimalist grammars with the shortest move constraint are regular and the derived sentence can be obtained from them with a finite copying tranducer =-=[46]-=-; the derivations of Lambek grammars can be described in a free algebra; this yields several results such as: – derivations in Lambek grammars, seen as normal natural deduction trees, are not context ... |

5 |
A montague-based model of generative lexical semantics
- Mery, Bassac, et al.
- 2007
(Show Context)
Citation Context ...ect, but, as opposed to what happens with canonical type morphisms, such transformations cannot apply when no term from the lexicon enables them. Two versions of this principle are being studied: one =-=[49]-=- considers only the various aspects of the type, without a general type that specialises into them, but with transformations between aspects, while the other approach [48] actually provides a general ... |

5 | Building a morphosyntactic lexicon and a pre-syntactic processing chain for Polish, in "LNAI 5603, selected papers presented at the LTC 2007 conference
- SAGOT
- 2009
(Show Context)
Citation Context ... PAN (Warsaw, Poland), Benoît Sagot developed a new set of tools and resources for Polish which covers all the steps required to transform a raw unrestricted text into a reasonable input for a parser =-=[55]-=-. This includes (1) a large-coverage morphological lexicon, developed thanks to the IPI PAN corpus as well as a lexical acquisition technique, and (2) multiple tools for spelling correction, segmentat... |

5 |
On the Membership Problem for Non-Linear Abstract Categorial Grammars
- Salvati
(Show Context)
Citation Context ...ship problems for Abstract Categorial Grammars (ACGs) [108]. Although this problem has already been addressed in [107], Sylvain Salvati presents some more precise results as well as some new ones. In =-=[58]-=-, Sylvain Salvati has showed that the parsing problem is decidable for context-free languages of simply typed λ-terms. Generating sentences from their meaning representation, when the relation between... |

5 |
Language and Meaning – Volume 2: Intensional logic and logical grammar, The University of Chicago
- Logic
- 1991
(Show Context)
Citation Context ...er (see e.g. [92]) are less efficient but provide more accurate analyses. Indeed these latter systems are used for syntax as well as for logical or predicative semantics like Montague semantics [63], =-=[69]-=- and thus allow generation algorithms. Other models, like dependency grammars [89], provide a different account of the syntax/semantics interface. A comparison between dependency models and generative... |

4 | Morphologie et Information Lexicale, Mémoire d’habilitation à diriger des recherches, Université Michel de Montaigne Bordeaux 3 - BASSAC - 2006 |