Search

Your search keyword '"Moot, Richard"' showing total 232 results
Start Over Author "Moot, Richard"

Refine your results

more »

more »

more »

more »
232 results on '"Moot, Richard"'

51. Type-logical investigations: proof-theoretic, computational and linguistic aspects of modern type-logical grammars

Author

Moot, Richard, Exploration et exploitation de données textuelles (TEXTE), Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM), Université Montpellier, and Christian Retoré

Subjects
computational linguistics, [MATH.MATH-LO]Mathematics [math]/Logic [math.LO], théorie de la démonstration, type-logical grammar, grammaires catégorielles, linguistique informatique, proof theory, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]
Published
2021

69. ��THEL: Automatically Extracted Typelogical Derivations for Dutch

Author

Kogkalidis, Konstantinos, Moortgat, Michael, and Moot, Richard

Subjects
FOS: Computer and information sciences, Computation and Language (cs.CL)
Abstract

We present ��THEL, a semantic compositionality dataset for written Dutch. ��THEL consists of two parts. First, it contains a lexicon of supertags for about 900 000 words in context. The supertags correspond to types of the simply typed linear lambda-calculus, enhanced with dependency decorations that capture grammatical roles supplementary to function-argument structures. On the basis of these types, ��THEL further provides 72 192 validated derivations, presented in four formats: natural-deduction and sequent-style proofs, linear logic proofnets and the associated programs (lambda terms) for meaning composition. ��THEL's types and derivations are obtained by means of an extraction algorithm applied to the syntactic analyses of LASSY Small, the gold standard corpus of written Dutch. We discuss the extraction algorithm and show how `virtual elements' in the original LASSY annotation of unbounded dependencies and coordination phenomena give rise to higher-order types. We suggest some example usecases highlighting the benefits of a type-driven approach at the syntax semantics interface. The following resources are open-sourced with ��THEL: the lexical mappings between words and types, a subset of the dataset consisting of 7 924 semantic parses, and the Python code that implements the extraction algorithm., 8 pages plus abstract, LREC 2020

Published
2019
Full Text
View/download PDF

70. Proof-Theoretic Aspects of Hybrid Type-Logical Grammars

Author

Stevens-Guille, Symon Jory, Moot, Richard, Stevens-Guille, Symon, Exploration et exploitation de données textuelles (TEXTE), Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), and Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)

Subjects
Property (philosophy), Current (mathematics), Unary operation, Computer science, 010102 general mathematics, Hybrid type, Computer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing), 0102 computer and information sciences, 01 natural sciences, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], Algebra, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, Rule-based machine translation, 010201 computation theory & mathematics, Proof theory, Computer Science::Logic in Computer Science, 0101 mathematics, Proof net, Computer Science::Formal Languages and Automata Theory
Abstract

International audience; This paper explores proof-theoretic aspects of hybrid type-logical grammars, a logic combining Lambek grammars with lambda grammars. We prove some basic properties of the calculus, such as nor-malisation and the subformula property and also present a proof net calculus for hybrid type-logical grammars. In addition to clarifying the logical foundations of hybrid type-logical grammars, the current study opens the way to variants and extensions of the original system, including but not limited to a non-associative version and a multimodal version incorporating structural rules and unary modes.

Published
2019
Full Text
View/download PDF

71. Polysemy, Individuation and Co-Predication: a simple solution to the counting puzzle implemented using lambda-DRT and MGL

Author

Mery, Bruno, Moot, Richard, Retoré, Christian, Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Exploration et exploitation de données textuelles (TEXTE), Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), and Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)

Subjects
[MATH.MATH-LO]Mathematics [math]/Logic [math.LO], ComputingMilieux_MISCELLANEOUS
Abstract

International audience

Published
2018

73. LinearOne

Author

Moot, Richard, Moot, Richard, and Contenus et Interactions - Analyse et synthèse dans les grammaires catégorielles abstraites : du lexique au discours - - Polymnie2012 - ANR-12-CORD-0004 - CONTINT - VALID

Subjects
first order logic, Type-logical grammar, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Mathematics::General Mathematics, latex, Linear logic, displacement calculus grammars, Mathematics::Logic, logic programming, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, theorem proving, [INFO.INFO-CL] Computer Science [cs]/Computation and Language [cs.CL], TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS, Computer Science::Logic in Computer Science, Computer Science::Mathematical Software, swi prolog, Proof net
Abstract

LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.

Published
2016

74. Collecting Crowd-Sourced Lexical Coercions for Compositional Semantic Analysis

Author

Lafourcade, Mathieu, Mery, Bruno, Mirzapour, Mehdi, Moot, Richard, Retoré, Christian, Exploration et exploitation de données textuelles (TEXTE), Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM), Laboratoire Bordelais de Recherche en Informatique (LaBRI), and Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)

Subjects
[INFO.INFO-TT]Computer Science [cs]/Document and Text Processing
Abstract

International audience; Type-theoretic frameworks for compositional semantics are aimed at producing structured meaning representations of natural language utterances. Using elements of lexical semantics, these frameworks are able to represent many difficult phenomena related to the polysemy of words and their context-dependent meanings. However, they are just as powerful as their built-in lexical resources. This paper explores ways to create and enrich wide-coverage, weighted lexical resources from crowd-sourced data, specifically, investigating how existing rich lexical networks-created and validated by serious games-can be used to infer linguistic coercions with ranking.

Published
2017

75. Grail Light

Author

Moot, Richard and Moot, Richard

Subjects
categorial-grammar, chart-parser, natural-language-understanding, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, type-logical grammar, [INFO.INFO-CL] Computer Science [cs]/Computation and Language [cs.CL], logic-programming, parsing, parser, logical-grammars, natural-language-processing
Abstract

Grail Light is a light-weight chart parser for multimodal type-logical grammars, written in SWI Prolog. It is accompanied by a set of auxiliary tools for interaction with the supertagger, interactive parsing, corpus extraction, etc. Together with the part-of-speech tag and supertag models, Grail Light can function as a wide-coverage parser for French, assigning Discourse Representation Structures as the meaning of parsed sentences. Grail Light produces natural deduction proofs like those found in the TLGbank and uses the same conventions for formulas, rules and proofs.

Published
2015

78. Typed Hilbert Operators for the Lexical Semantics of Singular and Plural Determiner Phrases

Author

Mery, Bruno, Moot, Richard, Retoré, Christian, Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Exploration et exploitation de données textuelles (TEXTE), Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM), Christian Retoré, Stergios Chatzikyriakidis, and Fabio Pasquali

Subjects
Plurals, Determiner phrases, Epsilon calculus, Lexical semantics, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL]
Abstract

International audience; We have proposed a framework based upon the λ-calculus with higher-order intuitionistic types for the symbolic computation of the semantic analysis, integrating lexical data ([Bassac et al., 2010, Mery, 2011, Retoré, 2014]). We discuss the pertinence of using Russell's ι and Hilbert's ε and τ operators for the semantics of the definite and indefinite determiners, recapitulating the main points of [Retoré, 2014], extending the work of von Heusinger in [Egli and von Heusinger, 1995] with higher-order tyiping in a multi-sorted frameowrk. We then study the possible implications of using such operators on underspecified sets of individuals such as those used when computing the semantics of plurals or massive entities, as done in [Mery et al., 2015].

Published
2015

79. Proofs nets and the categorial flow of information

Author

Moortgat, Michael, Moot, Richard, Utrecht Institute of Linguistics OTS (UiL OTS), Utrecht University [Utrecht], Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Alexandru Baltag, Davide Grossi, Alexandru Marcoci, Ben Rodenhäuser, Sonja Smets, Moot, Richard, and Alexandru Baltag, Davide Grossi, Alexandru Marcoci, Ben Rodenhäuser, Sonja Smets

Subjects
Continuation Passing Translation, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, Lambek-Grishin calculus, [INFO.INFO-CL] Computer Science [cs]/Computation and Language [cs.CL], Computer Science::Logic in Computer Science, Proof theory, Proof nets, Computer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing), [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL]
Abstract

International audience; The Lambek-Grishin calculus (LG) is a multiple-conclusion extension of Lambek's categorial type logic with dual families of fusion ('merge') and fission operations, and linear distributivity principles relating these two. Thanks to the distributivity principles, LG captures dependency patterns beyond context-free, both in syntax and semantics. In this paper we represent the information flow in categorial derivations in terms of a proof net graphical calculus. We study the correspondence between the composition graphs for these nets and the terms associated with focused sequent derivations.

Published
2012

80. Wide-coverage semantics for spatio-temporal reasoning

Author

Moot, Richard, Moot, Richard, Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), and Itipy

Subjects
categorial grammar, [INFO.INFO-CL] Computer Science [cs]/Computation and Language [cs.CL], itineraries, Lambek calculus, lambda calculus, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], spatial logic
Abstract

International audience; In this article, I describe my research on wide-coverage semantics for French- language texts and on its application to produce detailed semantic descriptions of itineraries. Using a categorial grammar semi-automatically extracted from the French Treebank and a manually constructed semantic lexicon, the resulting parser computes discourse representation structures representing the meaning of arbitrary text. The main goal of this paper is to apply and specialize this general framework of wide-coverage semantics to the spatial and temporal organisation of the Itipy corpus -- a set of 19th century texts discussing voyages through the Pyrenees mountains. The implemented system gives satisfying results and opens the door to the integration with specialized extensions, such as a separate module computing the discourse relations between the textual units.

Published
2012

81. Second order lambda calculus for meaning assembly: on the logical syntax of plurals

Author

Moot, Richard, Retoré, Christian, Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Linguistic signs, grammar and meaning: computational logic for natural language (SIGNES), Université Sciences et Technologies - Bordeaux 1-Inria Bordeaux - Sud-Ouest, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS), Moot, Richard, Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS), and Université Sciences et Technologies - Bordeaux 1 (UB)-Inria Bordeaux - Sud-Ouest

Subjects
TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, [INFO.INFO-CL] Computer Science [cs]/Computation and Language [cs.CL], TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS, Hardware_REGISTER-TRANSFER-LEVELIMPLEMENTATION, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL]
Abstract

International audience; We propose the use of the second order lambda calculus as a "glue language" for meaning assembly and illustrate its use by giving a logical treatment of some (basic) fact about plurals, distributivity and collectivity.

Published
2011

82. Wide-Coverage French Syntax and Semantics using Grail

Author

Moot, Richard, Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Linguistic signs, grammar and meaning: computational logic for natural language (SIGNES), Université Sciences et Technologies - Bordeaux 1-Inria Bordeaux - Sud-Ouest, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS), Région Aquitaine, Projet Itipy, Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS), Université Sciences et Technologies - Bordeaux 1 (UB)-Inria Bordeaux - Sud-Ouest, and Moot, Richard

Subjects
[INFO.INFO-TT]Computer Science [cs]/Document and Text Processing, type-logical grammar, [INFO.INFO-TT] Computer Science [cs]/Document and Text Processing, Categorial grammar, Discourse Representation Theory
Abstract

The system demo introduces Grail, a general-purpose parser for multimodal categorial grammars, with special emphasis on recent research which makes Grail suitable for wide-coverage French syntax and semantics. These developments have been possible thanks to a categorial grammar which has been extracted semi-automatically from the Paris 7 treebank and a semantic lexicon which maps word, part-of-speech tags and formulas combinations to Discourse Representation Structures., Cette démonstration décrit Grail : un analyseur syntaxique pour grammaires catégorielles. Elle met l'accent sur les recherches récentes qui ont permis à Grail de donner des analyses syntaxiques et sémantiques du Français. Ces développements sont possibles grâce à une grammaire extraite semi- automatiquement du corpus de Paris 7 ainsi qu'un lexique sémantique qui traduit des combinaisons de mots, des étiquettes syntaxiques et des formules en Discourse Representation Structures.

Published
2010

83. Semi-automated Extraction of a Wide-Coverage Type-Logical Grammar for French

Author

Moot, Richard, Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Linguistic signs, grammar and meaning: computational logic for natural language (SIGNES), Université Sciences et Technologies - Bordeaux 1-Inria Bordeaux - Sud-Ouest, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS), Région Aquitaine, Projet Itipy, Moot, Richard, Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS), and Université Sciences et Technologies - Bordeaux 1 (UB)-Inria Bordeaux - Sud-Ouest

Subjects
[INFO.INFO-TT]Computer Science [cs]/Document and Text Processing, supertagging, type-logical grammar, [INFO.INFO-TT] Computer Science [cs]/Document and Text Processing, Categorial grammar, grammar extraction
Abstract

The paper describes the development of a wide-coverage type-logical grammar for French, which has been extracted from the Paris 7 treebank and received a significant amount of manual ver- ification and cleanup. The resulting treebank is evaluated using a supertagger and performs at a level comparable to the best supertagging results for English., Cet article décrit le développement d'une grammaire catégorielle à large couverture du Français, extraite à partir du corpus arboré de Paris 7 et vérifiée et corrigée manuellement. Le gram- maire catégorielle résultant est évaluée en utilisant un supertagger et obtient des résultats comparables aux meilleurs supertaggers pour l'Anglais.

Published
2010

84. Extraction of Type-Logical Supertags from the Spoken Dutch Corpus

Author

Moot, Richard, Moot, Richard, Aravind Joshi and Srinivas Bangalore, Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Linguistic signs, grammar and meaning: computational logic for natural language (SIGNES), Université Sciences et Technologies - Bordeaux 1-Inria Bordeaux - Sud-Ouest, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS), Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS), and Université Sciences et Technologies - Bordeaux 1 (UB)-Inria Bordeaux - Sud-Ouest

Subjects
[INFO.INFO-CL] Computer Science [cs]/Computation and Language [cs.CL], InformationSystems_INFORMATIONSTORAGEANDRETRIEVAL, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL]
Abstract

The Spoken Dutch Corpus assigns 1 million of its 9 million total words a syn- tactic annotation in the form of dependency graphs. We will look at strategies for automatically extracting a lexicon of type-logical supertags from these dependency graphs and investigate how different levels of lexical detail affect the size of the resulting lexicon as well as the performance with respect to supertag disambiguation.

Published
2010

85. Lambek Grammars, Tree Adjoining Grammars and Hyperedge Replacement Grammars

Author

Moot, Richard, Moot, Richard, Programme 'blanc' - Vers une pragmatique théorique basée sur la théorie des continuations et sur la ludique - - PRELUDE2006 - ANR-06-BLAN-0032 - BLANC - VALID, Linguistic signs, grammar and meaning: computational logic for natural language (SIGNES), INRIA Futurs, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Sciences et Technologies - Bordeaux 1-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Université Bordeaux Montaigne-Centre National de la Recherche Scientifique (CNRS), Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), ANR-06-BLAN-0032,PRELUDE,Vers une pragmatique théorique basée sur la théorie des continuations et sur la ludique(2006), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Sciences et Technologies - Bordeaux 1 (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Université Bordeaux Montaigne (UBM)-Centre National de la Recherche Scientifique (CNRS), and Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS)

Subjects
TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, [INFO.INFO-CL] Computer Science [cs]/Computation and Language [cs.CL], [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL]
Abstract

International audience; Two recent extension of the non-associative Lambek calculus, the Lambek-Grishin calculus and the multimodal Lambek calculus, are shown to generate the same class of languages as tree adjoining grammars, using (tree generating) hyperedge replacement grammars as an intermediate step. As a consequence both extensions are mildly context-sensitive formalisms and benefit from polynomial parsing algorithms.

Published
2008

86. Filtering Axiom Links for Proof Nets

Author

Moot, Richard, Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), INRIA, LaBRI - Laboratoire Bordelais de Recherche en Informatique, Laura Kallmeyer and Paola Monachesi and Gerald Penn and Giorgio Satta, and Moot, Richard

Subjects
Mathematics::Logic, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, [INFO.INFO-CL] Computer Science [cs]/Computation and Language [cs.CL], Computer Science::Logic in Computer Science, TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS, Lambek calculus, Computer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing), parsing, proof nets, complexity, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL]
Abstract

Extended version of my submission to Formal Grammar 2007.; An important problem for proving statements in multimodal categorial grammar is that even when using proof nets — which improve upon proof search in natural deduction and sequent calculus by identifying all equivalent proofs — the number of possible axiom links to consider is still enormous. We will propose several efficient strategies to reduce the number of axiom links and will evaluate the resulting combined strategy against a large number of statements in both multimodal and Lambek categorial grammars and find that we eliminate a very large number of the axiom links which do not correspond to any proof net.

Published
2008

87. L'ordre des mots dans les grammaires catégorielles

Author

Moot, Richard, Retoré, Christian, Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Kim Gerdes et Claude Muller, and Moot, Richard

Subjects
[INFO.INFO-CL] Computer Science [cs]/Computation and Language [cs.CL], [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL]
Published
2004

88. Parsing Corpus-Induced Type-Logical Grammars

Author

Moot, Richard, Linguistic signs, grammar and meaning: computational logic for natural language (SIGNES), INRIA Futurs, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Sciences et Technologies - Bordeaux 1-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Université Bordeaux Montaigne-Centre National de la Recherche Scientifique (CNRS), Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Utrecht Institute of Linguistics OTS (UiL OTS), Utrecht University [Utrecht], Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Sciences et Technologies - Bordeaux 1 (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Université Bordeaux Montaigne (UBM)-Centre National de la Recherche Scientifique (CNRS), Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS), and Moot, Richard

Subjects
TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, [INFO.INFO-CL] Computer Science [cs]/Computation and Language [cs.CL], [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL]
Abstract

International audience; Type-logical grammars which have been automatically extracted from linguistic corpora provide parsers for these grammars with a considerable challenge. The size of the lexicon and the combinatory possibilities of the lexical entries both call for rethinking of the traditional type-logical parsing strategies. We show how methods from statistical natural language processing can be incorporated into a type-logical parser, give some preliminary data and sketch some new experiments we expect to produce better results.

Published
2003

89. Plurals: individuals and sets in a richly typed semantics

Author

Mery, Bruno, Moot, Richard, Retoré, Christian, Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), jSAI-ISAI, Shunsuke Yatabe, Centre National de la Recherche Scientifique - CNRS (FRANCE), Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE), Institut Polytechnique de Bordeaux - IPB (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), Université de Bordeaux (FRANCE), and Institut National Polytechnique de Toulouse - INPT (FRANCE)

Subjects
Logique en informatique, FOS: Computer and information sciences, Higher-Order Lambda-Calculus, Computer Science - Computation and Language, Informatique et langage, Intelligence artificielle, Apprentissage, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], Semantics, Plurals, ACM: J.: Computer Applications/J.5: ARTS AND HUMANITIES/J.5.4: Linguistics, TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS, Computation and Language (cs.CL)
Abstract

International audience; We developed a type-theoretical framework for natural lan- guage semantics that, in addition to the usual Montagovian treatment of compositional semantics, includes a treatment of some phenomena of lex- ical semantic: coercions, meaning, transfers, (in)felicitous co-predication. In this setting we see how the various readings of plurals (collective, dis- tributive, coverings,...) can be modelled.

Published
2013

91. Note de lecture sur 'Discourse processing' de Manfred Stede

Author

Retoré, Christian, Moot, Richard, Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), and Université Fédérale Toulouse Midi-Pyrénées

Subjects
[INFO.INFO-TT]Computer Science [cs]/Document and Text Processing, [SHS.LANGUE]Humanities and Social Sciences/Linguistics, ComputingMilieux_MISCELLANEOUS, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]
Abstract

International audience

Published
2013

93. Traitement automatique sur corpus de récits de voyages pyrénéens : Une analyse syntaxique, sémantique et temporelle

Author

Lefeuvre, Anaïs, Moot, Richard, Retoré, Christian, Sandillon-Rezer, Noémie-Fleur, Linguistic signs, grammar and meaning: computational logic for natural language (SIGNES), Université Sciences et Technologies - Bordeaux 1-Inria Bordeaux - Sud-Ouest, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS), Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), ATALA/AFCP, Université Sciences et Technologies - Bordeaux 1 (UB)-Inria Bordeaux - Sud-Ouest, Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS), and Lefeuvre, Anaïs

Subjects
grammaire catégorielle, [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], [INFO.INFO-CL] Computer Science [cs]/Computation and Language [cs.CL], compositionalité, interface syntaxe-sémantique, interface sémantique-pragmatique, [SHS.LANGUE]Humanities and Social Sciences/Linguistics, [SHS.LANGUE] Humanities and Social Sciences/Linguistics, théorie des types, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], [INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], analyse temporelle, récit de voyage
Abstract

International audience; Cet article présente notre utilisation de la théorie des types dans laquelle nous nous situons pour l'analyse syntaxique, sémantique et pour la construction du lexique. Notre outil, Grail permet de traiter le discours automatiquement à partir du texte brut et nous le testons sur un corpus de récit de voyages pyrénéens, Ititpy. Nous expliquons donc notre usage des grammaires catégorielles et plus particulièrement du calcul de Lambek et la correspondance entre ces catégories et le λ-calcul simplement typé dans le cadre de la DRT. Une flexibilité du typage doit être autorisée dans certains cas et bloquée dans d'autres. Quelques phénomènes linguistiques participant à une forme de glissement de sens provocant des conflits de types sont présentés. Nous expliquons ensuite nos motivations d'ordre pragmatique à utiliser un système à sortes et types variables en sémantique lexicale puis notre traitement compositionnel du temps des évènements inspiré du Binary Tense de (Verkuyl, 2008).

Published
2012

94. A discursive analysis of itineraries in an historical and regional corpus of travels: syntax, semantics, and pragmatics in a unified type theoretical framework

Author

Moot, Richard, Prévot, Laurent, Retoré, Christian, Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Linguistic signs, grammar and meaning: computational logic for natural language (SIGNES), Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Inria Bordeaux - Sud-Ouest, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Sciences et Technologies - Bordeaux 1, Laboratoire Parole et Langage (LPL), Aix Marseille Université (AMU)-Centre National de la Recherche Scientifique (CNRS), Projet ITIPY de la région Aquitaine, Université Sciences et Technologies - Bordeaux 1-Inria Bordeaux - Sud-Ouest, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS), Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS), and Université Sciences et Technologies - Bordeaux 1 (UB)-Inria Bordeaux - Sud-Ouest

Subjects
[SHS.LANGUE]Humanities and Social Sciences/Linguistics, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL]
Abstract

International audience; In this paper we will discuss the application of (Segmented) Discourse Representation Theory and the Generative Lexicon to the analysis of a historical French corpus of itineraries in the Pyre ́ne ́es. Our research will focus in particular on how type coercion (Pustejovsky, 1995) can help us give a correct analysis of cases of so-called "fictive motion" (Talmy, 1999), which is evident is phrases like. (1) The road runs along the coast for two hours. (2) The path descended abruptly. This case is particular in that an entity (which is considered immobile and which, in the context, defines a path) is the subject of a movement verb and that the combination is interpreted as a generic statement about the nature of this path, without any movement necessarily taking place.

Published
2011

95. A discursive analysis of itineraries in an historical and regional corpus of travels

Author

Moot, Richard, Prévot, Laurent, Retoré, Christian, Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Linguistic signs, grammar and meaning: computational logic for natural language (SIGNES), Université Sciences et Technologies - Bordeaux 1-Inria Bordeaux - Sud-Ouest, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS), Laboratoire Parole et Langage (LPL), Aix Marseille Université (AMU)-Centre National de la Recherche Scientifique (CNRS), and Projet ITIPY de la région Aquitaine

Subjects
[SHS.LANGUE]Humanities and Social Sciences/Linguistics, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL]
Abstract

International audience; In this paper we will discuss the application of (Segmented) Discourse Representation Theory and the Generative Lexicon to the analysis of a historical French corpus of itineraries in the Pyre ́ne ́es. Our research will focus in particular on how type coercion (Pustejovsky, 1995) can help us give a correct analysis of cases of so-called "fictive motion" (Talmy, 1999), which is evident is phrases like. (1) The road runs along the coast for two hours. (2) The path descended abruptly. This case is particular in that an entity (which is considered immobile and which, in the context, defines a path) is the subject of a movement verb and that the combination is interpreted as a generic statement about the nature of this path, without any movement necessarily taking place.

Published
2011

96. Un calcul de termes typés pour la pragmatique lexicale: chemins et voyageurs fictifs dans un corpus de récits de voyage

Author

Moot, Richard, Prévot, Laurent, Retoré, Christian, Laboratoire Parole et Langage (LPL), Aix Marseille Université (AMU)-Centre National de la Recherche Scientifique (CNRS), Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Linguistic signs, grammar and meaning: computational logic for natural language (SIGNES), Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Inria Bordeaux - Sud-Ouest, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Sciences et Technologies - Bordeaux 1, Projet ITIPY de la région Aquitaine, Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS), Université Sciences et Technologies - Bordeaux 1 (UB)-Inria Bordeaux - Sud-Ouest, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS), and Université Sciences et Technologies - Bordeaux 1-Inria Bordeaux - Sud-Ouest

Subjects
[INFO]Computer Science [cs], [SHS.LANGUE]Humanities and Social Sciences/Linguistics, Corpus, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], ComputingMilieux_MISCELLANEOUS
Abstract

International audience; This work is part of the automated analysis of travel stories corpus. To do so, we refine Mon- tague semantics, to model the adaptation of word meaning to the context in which they appear. Here we study construction like 'the path goes down for half an hour' in which the path introduces a virtual traveller following it, extending ideas of the last author with Bassac, Mery. The introduction of a traveller relies on type raising sa- tisfies the following requirements : the quantification binding the traveller has the widest scope, and properties of the path do not apply to the traveller, be it virtual. This semantical analysis (actually its translation in λ-DRT) is already implemented for a part of the Grail lexicon.; Ce travail s'inscrit dans l'analyse automatique d'un corpus de récits de voyage. À cette fin,nous raffinons la sémantique de Montague pour rendre compte des phénomènes d'adaptation du sens des mots au contexte dans lequel ils apparaissent. Ici, nous modélisons les constructions de type 'le chemin descend pendant une demi-heure' où ledit chemin introduit un voyageur fictif qui le parcourt, en étendant des idées que le dernier auteur a développé avec Bassac et Mery. Cette introduction du voyageur utilise la montée de type afin que le quantificateur introduisant le voyageur porte sur toute la phrase et que les propriétés du chemin ne deviennent pas des propriétés du voyageur, fût-il fictif. Cette analyse sémantique (ou plutôt sa traduction en lambda-DRT) est d'ores et déjà implantée pour une partie du lexique de Grail.

Published
2011

98. Type-Logical and Hyperedge Replacement Grammars

Author

Moot, Richard, Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), LaBRI, and INRIA

Subjects
TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL]
Abstract

This article gives a much more detailed account of my TAG+ paper. It identifies fragments of the multimodal Lambek calculus and the Lambek-Grishin calculus for which we can have polynomial parsing by giving a hyperedge replacement grammar for proof nets in these fragments.

Published
2008

99. Logical Aspects of Computational Linguistics

Author

Blache, Philippe, Stabler, Edward, Busquets, Joan, Moot, Richard, Laboratoire Parole et Langage (LPL), Aix Marseille Université (AMU)-Centre National de la Recherche Scientifique (CNRS), Department of Linguistics [Los Angeles], University of California [Los Angeles] (UCLA), University of California-University of California, Cognition, Langues, Langage, Ergonomie (CLLE-ERSS), École pratique des hautes études (EPHE), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université Toulouse - Jean Jaurès (UT2J)-Université Bordeaux Montaigne-Centre National de la Recherche Scientifique (CNRS), Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Philippe Blache, Edward Stabler, Joan Busquets, Richard Moot, University of California (UC)-University of California (UC), École Pratique des Hautes Études (EPHE), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Bordeaux Montaigne (UBM)-Centre National de la Recherche Scientifique (CNRS), and Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS)

Subjects
logic, formal methods, categorical grammars, semantics tree, linguistics, logical reasoning, parsing, grammar systems, computational logics, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], computational linguistics, language engineering, categorical semantics, Syntax, [SHS.LANGUE]Humanities and Social Sciences/Linguistics, complexity, adjoining grammars
Abstract

International audience; Edited in collaboration with FoLLI, the Association of Logic, Language and Information, this book inaugurates the new FoLLI LNAI subline. It constitutes the refereed proceedings of the 5th International Conference on Logical Aspects of Computational Linguistics, LACL 2005, held in Bordeaux, France in April 2005.The 25 revised full papers presented were carefully reviewed and selected from over 40 submissions. The papers address a wide range of logical and formal methods in computational linguistics with studies of particular grammar formalisms and their computational properties, language engineering, and traditional topics about the syntax/semantics interface.

Published
2005
Full Text
View/download PDF

100. A Note on the Complexity of Constraint Interaction: Locality Conditions and Minimalist Grammars

Author

Gärtner, Hans-Martin, Michaelis, Jens, Blache, Philippe, Stabler, Edward, Busquets, Joan, Moot, Richard, and ARRAY(0xaacfb50)

Subjects
Discrete mathematics, Categorial grammar, Grammar, Minimalist grammar, business.industry, Computer science, media_common.quotation_subject, Specifier, String (computer science), Locality, Context-sensitive grammar, Syntax, Adjunct, Formal grammar, Rule-based machine translation, Artificial intelligence, Rewriting, Computational linguistics, business, Generative grammar, media_common
Abstract

Locality Conditions (LCs) on (unbounded) dependencies have played a major role in the development of generative syntax ever since the seminal work by Ross [22]. Descriptively, they fall into two groups. On the one hand there are intervention-based LCs (ILCs) often formulated as “minimality constraints” (“minimal link condition,” “minimize chain links”, “shortest move”, “attract closest,” etc.). On the other hand there are containment-based LCs (CLCs) typically de.ned in terms of (generalized) grammatical functions (“adjunct island”, “subject island”, “specifier island”, etc.). Research on LCs has been dominated by two very general trends. First, attempts have been made at unifying ILCs and CLCs on the basis of notions such as “government” and “barrier” (e.g. [4]). Secondly, research has often been guided by the intuition that, beyond empirical coverage, LCs somehow contribute to restricting the formal capacity of grammars (cf. [3–p. 125], [6–p. 14f]). Both these issues, we are going to argue, can be fruitfully studied within the framework of minimalist grammars (MGs) as defined by Stabler [25]. In particular, we are going to demonstrate that there is a specic asymmetry between the in.uence of ILCs and CLCs on complexity. Thus, MGs, including an ILC, namely, the shortest move condition (SMC) have been shown to belong to the mildly context-sensitive grammar formalisms by Michaelis [14]. The same has been shown in [16, 18] for a revised version of MGs introduced in [26], which includes the SMC and an additional CLC, namely, the specifier island condition (SPIC). In particular [14] and [16, 18] show that, in terms of derivable string languages, both the original MG-type and the revised MG-type constitute a subclass of the class of linear context-free rewriting systems (LCFRSs) in the sense of [28, 29], and thus, a series of other formalism classes all generating the same class of string languages as LCFRSs. Here we will demonstrate that removing the SMC from the revised MG-version increases the generative power in such a way that the resulting formalism is not mildly context-sensitive anymore. This suggests that intuitions to the contrary notwithstanding, imposing an LC as such, here the SPIC, does not necessarily reduce formal complexity.

Published
2005
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results