Search

Your search keyword '"ANR-12-CORD-0004,Polymnie,Analyse et synthèse dans les grammaires catégorielles abstraites : du lexique au discours(2012)"' showing total 10 results
Start Over Author "ANR-12-CORD-0004,Polymnie,Analyse et synthèse dans les grammaires catégorielles abstraites : du lexique au discours(2012)" Topic computer
10 results on '"ANR-12-CORD-0004,Polymnie,Analyse et synthèse dans les grammaires catégorielles abstraites : du lexique au discours(2012)"'

1. A syntax-semantics interface for Tree-Adjoining Grammars through Abstract Categorial Grammars

Author

Sylvain Pogodalla, Semantic Analysis of Natural Language (SEMAGRAMME), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Natural Language Processing & Knowledge Discovery (LORIA - NLPKD), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), ANR-12-CORD-0004,Polymnie,Analyse et synthèse dans les grammaires catégorielles abstraites : du lexique au discours(2012), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), and Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)

Subjects
Linguistics and Language, Computer science, Semantic interpretation, 02 engineering and technology, Semantics, computer.software_genre, Syntax-semantics interface, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], lcsh:P1-1091, Rule-based machine translation, abstract categorial grammars, Categorial, 0202 electrical engineering, electronic engineering, information engineering, Control (linguistics), Tree-adjoining grammars, syntax-semantics, Abstract, 060201 languages & linguistics, Parsing, Syntax (programming languages), business.industry, Substitution (logic), 06 humanities and the arts, Adjunction, Computer Science Applications, lcsh:Philology. Linguistics, Grammars, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, Modeling and Simulation, Tree-Adjoining, 0602 languages and literature, interface, 020201 artificial intelligence & image processing, Artificial intelligence, business, computer, Natural language processing
Abstract

International audience; We present a model of the syntax-semantics interface for Tree-Adjoining Grammars (TAGs). It is based on the encoding of TAGs within the framework of Abstract Categorial Grammars (ACGs). This encoding relies on a functional interpretation of the substitution and adjunction operations of TAGs. In ACGs, the abstract terms representing derivation trees are full-fledged objects of the grammar. These terms are mapped onto logical formulas representing the semantic interpretation of natural expressions that TAGs can analyze. Because of the reversibility properties of ACGs, this provides a way to parse and generate with the same TAG encoded grammar. We propose several analyses, including long distance dependencies, quantification, control and raising verbs, and subordinate clauses. We also show how this encoding easily extends to other phenomena such as idioms or scope ambiguities. All the lexical data for theses modellings are provided and can be run with the ACG toolkit, a software package dedicated to the development of ACGs that can use these grammars both for parsing and generation.

Published
2017

2. Modal Subordination in Type Theoretic Dynamic Logic

Author

Sai Qian, Maxime Amblard, Philippe de Groote, Institute of Energy, Jiangxi Academy of Sciences, Université Paris Diderot - Paris 7 (UPD7), Semantic Analysis of Natural Language (SEMAGRAMME), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Natural Language Processing & Knowledge Discovery (LORIA - NLPKD), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL), ANR-12-CORD-0004,Polymnie,Analyse et synthèse dans les grammaires catégorielles abstraites : du lexique au discours(2012), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), and Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)

Subjects
Subordination (linguistics), Predicate logic, Discourse representation theory, Interpretation (logic), Computer science, business.industry, Anaphora (linguistics), computer.software_genre, Noun phrase, Modal, Dynamic logic (modal logic), [INFO]Computer Science [cs], Artificial intelligence, business, computer, Natural language processing
Abstract

Classical theories of discourse semantics, such as Discourse Representation Theory (DRT), Dynamic Predicate Logic (DPL), predict that an indefinite noun phrase cannot serve as antecedent for an anaphor if the noun phrase is, but the anaphor is not, in the scope of a modal expression. However, this prediction meets with counterexamples. The phenomenon modal subordination is one of them. In general, modal subordination is concerned with more than two modalities, where the modality in subsequent sentences is interpreted in a context ‘subordinate’ to the one created by the first modal expression. In other words, subsequent sentences are interpreted as being conditional on the scenario introduced in the first sentence. One consequence is that the anaphoric potential of indefinites may extend beyond the standard limits of accessibility constraints. This paper aims to give a formal interpretation on modal subordination. The theoretical backbone of the current work is Type Theoretic Dynamic Logic (TTDL), which is a Montagovian account of discourse semantics. Different from other dynamic theories, TTDL was built on classical mathematical and logical tools, such as λ-calculus and Church’s theory of types. Hence it is completely compositional and does not suffer from the destructive assignment problem. We will review the basic set-up of TTDL and then present Kratzer’s theory on natural language modality. After that, by integrating the notion of conversation background, in particular, the modal base usage, we offer an extension of TTDL (called Modal-TTDL, or M-TTDL in short) which properly deals with anaphora across modality. The formal relation between Modal-TTDL and TTDL will be discussed as well. We uncover the difficulty of specific sense distinctions by investigating distributional bias and reducing the sparsity of existing small-scale corpora used in prior work. We build a semantically enriched model for modal sense classification by designing novel features related to lexical, proposition-level and discourse-level semantic factors. Besides improved classification performance, closer examination of interpretable feature sets unveils relevant semantic and contextual factors in modal sense classification. Finally, we investigate genre effects on modal sense distribution and how they affect classification performance. Our investigations uncover the difficulty of specific sense distinctions and how they are affected by training set size and distributional bias. Our large-scale experiments confirm that semantically enriched models outperform models built on shallow feature sets. Cross-genre experiments shed light on differences in sense distributions across genres and confirm that semantically enriched models have high generalization capacity, especially in unstable distributional settings.

Published
2016

3. Non-linear Second order Abstract Categorial Grammars and deletion

Author

Sylvain Salvati, 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), Models for a Structured Programming of Space and Time (PoSET), Inria Bordeaux - Sud-Ouest, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Studio de Création et de Recherche en Informatique et Musique Électroacoustique (SCRIME), Université Sciences et Technologies - Bordeaux 1-Université Sciences et Technologies - Bordeaux 1-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)-Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Makoto Kanazawa, ANR-12-CORD-0004,Polymnie,Analyse et synthèse dans les grammaires catégorielles abstraites : du lexique au discours(2012), Université de Bordeaux (UB)-É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)-Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS)-Studio de Création et de Recherche en Informatique et Musique Électroacoustique (SCRIME), Université Sciences et Technologies - Bordeaux 1 (UB)-Université Sciences et Technologies - Bordeaux 1 (UB)-Inria Bordeaux - Sud-Ouest, and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], Rule-based machine translation, abstract categorial grammars, [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], linear logic, 0202 electrical engineering, electronic engineering, information engineering, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.1: Denotational semantics, Mathematics, computer.programming_language, Discrete mathematics, Categorial grammar, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], Combinatory categorial grammar, lambda-calculus, 16. Peace & justice, Linear logic, Tree-adjoining grammar, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.2: Lambda calculus and related systems, 010201 computation theory & mathematics, 020201 artificial intelligence & image processing, L-attributed grammar, Lambda calculus, computer, Coherence (linguistics), ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.3: Formal Languages/F.4.3.4: Operations on languages
Abstract

International audience; We prove that non-linear second order Abstract Categorial Grammars (2ACGs) are equivalent to non-deleting 2ACGs. We prove this result first by using the intersection types discipline. Then we explain how coherence spaces can yield the same result. This result shows that restricting the Montagovian approach to natural language semantics to use only ΛI-terms has no impact in terms of the definable syn-tax/semantics relations. Moreover from the ACG perspective this result is a generalization of a result by Yoshinaka: it shows that deletion add no expressive power to second order ACGs.

Published
2015

4. A logical approach to grammar description

Author

Jérôme Kirman, Sylvain Salvati, Lionel Clément, 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), Models for a Structured Programming of Space and Time (PoSET), Inria Bordeaux - Sud-Ouest, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Studio de Création et de Recherche en Informatique et Musique Électroacoustique (SCRIME), Université Sciences et Technologies - Bordeaux 1-Université Sciences et Technologies - Bordeaux 1-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)-Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), ANR-12-CORD-0004,Polymnie,Analyse et synthèse dans les grammaires catégorielles abstraites : du lexique au discours(2012), Université de Bordeaux (UB)-É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)-Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS)-Studio de Création et de Recherche en Informatique et Musique Électroacoustique (SCRIME), Université Sciences et Technologies - Bordeaux 1 (UB)-Université Sciences et Technologies - Bordeaux 1 (UB)-Inria Bordeaux - Sud-Ouest, and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
Linguistics and Language, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.7: Natural Language Processing/I.2.7.2: Language models, Abstract Categorial Grammars, logical transduction, lambda calculus, 0102 computer and information sciences, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.7: Natural Language Processing/I.2.7.3: Language parsing and understanding, computer.software_genre, 01 natural sciences, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], grammar description, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.7: Natural Language Processing, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], lcsh:P1-1091, Computer Science::Logic in Computer Science, Finite State Automata, computer.programming_language, Mathematics, 060201 languages & linguistics, logic, Natural deduction, Syntax (programming languages), Categorial grammar, Programming language, business.industry, Computer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing), 06 humanities and the arts, Combinatory categorial grammar, [SCCO.LING]Cognitive science/Linguistics, Computer Science Applications, Tree-adjoining grammar, lcsh:Philology. Linguistics, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, 010201 computation theory & mathematics, Modeling and Simulation, 0602 languages and literature, Artificial intelligence, L-attributed grammar, Lambda calculus, business, computer, Typed lambda calculus, Natural language processing
Abstract

International audience; In the tradition of Model Theoretic Syntax, we propose a logical approach to the description of grammars. We combine in one formalism several tools that are used throughout computer science for their power of abstraction: logic and lambda calculus. We propose then a high-level formalism for describing mildly context sensitive grammars and their semantic interpretation. As we rely on the correspondence between logic and finite state automata, our method combines con-ciseness with effectivity. We illustrate our approach with a simple linguistic model of several interleaved linguistic phenomena involving extraction. The level of abstraction provided by logic and lambda calculus allows us not only to use this linguistic model for several languages, namely English, German, and Dutch, but also for semantic interpretation.

Published
2015

5. A Type-Logical Account of Quantification in Event Semantics

Author

de Groote, Philippe, Winter, Yoad, Murata, Tsuyoshi, Mineshima, Koji, Bekki, Daisuke, LS Comp.semantiek en kunstm.intelligent., LS Linguistiek de taalinformatica, ILS LLI, Semantic Analysis of Natural Language (SEMAGRAMME), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Natural Language Processing & Knowledge Discovery (LORIA - NLPKD), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL), Utrecht University [Utrecht], ANR-12-CORD-0004,Polymnie,Analyse et synthèse dans les grammaires catégorielles abstraites : du lexique au discours(2012), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), and Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)

Subjects
business.industry, Principle of compositionality, Semantics (computer science), Event (relativity), [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], 16. Peace & justice, computer.software_genre, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], Conjunction (grammar), Closure (mathematics), Negation, Taverne, Artificial intelligence, business, computer, Natural language processing, Adverbial, Mathematics
Abstract

International audience; It has been argued that Davidson's event semantics does not combine smoothly with Montague's compositional semantics. The difficulty, which we call the event quantification problem, comes from a possibly bad interaction between event existential closure, on the one hand, and quantification, negation, or conjunction, on the other hand. The re-cent literature provides two solutions to this problem. The first one is due to Champollion, and the second one to Winter and Zwarts. The present paper elaborates on this second solution. In particular, it provides a treatment of quantified adverbial modifiers, which was absent from Winter and Zwarts.

Published
2015

6. Computing the Semantics of Plurals and Massive Entities Using Many-Sorted Types

Author

Bruno Mery, Christian Retoré, Richard Moot, 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), PEPS CoLAN - CNRS, JSAI / isAI, Koji Mineshima, and ANR-12-CORD-0004,Polymnie,Analyse et synthèse dans les grammaires catégorielles abstraites : du lexique au discours(2012)

Subjects
Lexical semantics, Computer science, Principle of compositionality, business.industry, Higher-Order Logic, Syntax and Semantics Analysis, Class (philosophy), Semantics, computer.software_genre, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], Syntax (logic), Plural Nouns, Lexical Semantics, New Type Theories, Mass Nouns, Artificial intelligence, business, computer, Sentence, Natural language processing, Plural, Mereology
Abstract

International audience; We demonstrate how the specifics of the semantics for mass nouns can be integrated in a recent type-theoretical framework with rich lexical semantics, similarly to collective plural readings. We also explore the significance of an higher-order type system for gradable predicates and other complex predications, as well as the relevance of a multi-sorted approach to such phenomena. All the while, we will detail the process of analysis from syntax to semantics and ensure that compositionality and computability are kept. The distinction between massive and countable entities is similar to a clas-sical type/token distinction — as an example of the type/token distinction, "the bike" can refer both to a single physical bicycle (as in the sentence "the bike is in the garage") but also the the class of all bicycles (as in the sentence "the bike is a common mode of transport in Amsterdam"). However, linguists such as Brendan Gillon warn against such a generalisation (long made in the literature) and remark that, as far as the language is concerned, mass nouns are more alike to the collective readings of pluralised count nouns. Among the many similarities is, for instance, the identical behaviour of plurals and mass nouns with cumulat-ive readings: "Both the pens on the desk and the pens in storage use black ink, so I only have black pens" and "There is red wine on display and red wine in the back, so we only have red" are logically similar (see [5] for discussion). Several different approaches have been proposed to account for the specific semantic issues of mass nouns, from Godehard Link's augmented mereological approach in [12] to David Nicolas' revision of plural logic in [25], all remarking upon this similarity. Many different formalisms, using advanced type theories for the purpose of modelling semantics, have been recently proposed, see e. g. [1,3]. Among those, we proposed a semantic framework based on a multi-sorted logic with higher-order types in order to account for notoriously difficult phenomena pertaining (among many others) for many helpful discussions.

Published
2014

7. An ACG View on G-TAG and Its g-Derivation

Author

Laurence Danlos, Aleksandre Maskharashvili, Sylvain Pogodalla, Analyse Linguistique Profonde à Grande Echelle, Large-scale deep linguistic processing (ALPAGE), Inria Paris-Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Paris Diderot - Paris 7 (UPD7), Semantic Analysis of Natural Language (SEMAGRAMME), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Natural Language Processing & Knowledge Discovery (LORIA - NLPKD), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Nicholas Asher and Sergei Soloviev, and ANR-12-CORD-0004,Polymnie,Analyse et synthèse dans les grammaires catégorielles abstraites : du lexique au discours(2012)

Subjects
Parsing, Computer science, Formalism (philosophy), business.industry, 0102 computer and information sciences, 02 engineering and technology, computer.software_genre, Adjunction, 01 natural sciences, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.7: Natural Language Processing, Tree-adjoining grammar, Inversion (linguistics), Morphism, Rule-based machine translation, 010201 computation theory & mathematics, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Artificial intelligence, Predicative expression, business, computer, Natural language processing
Abstract

International audience; G-TAG is a Tree Adjoining Grammar (TAG) based formalism which was specifically designed for the task of text generation. Contrary to TAG, the derivation structure becomes primary, as pivot between the conceptual representation and the surface form. This is a shared feature with the encoding of TAG into Abstract Categorial Grammars. This paper propose to study G-TAG from an ACG perspective. We rely on the reversibility property of ACG that makes both parsing and generation fall within a common morphism inversion process. Doing so, we show how to overcome some limitations of G-TAG regarding predicative adjunction and how to propose alternative approaches to some phenomena.

Published
2014

8. An ACG Analysis of the G-TAG Generation Process

Author

Sylvain Pogodalla, Aleksandre Maskharashvili, Laurence Danlos, Analyse Linguistique Profonde à Grande Echelle, Large-scale deep linguistic processing (ALPAGE), Inria Paris-Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Paris Diderot - Paris 7 (UPD7), Semantic Analysis of Natural Language (SEMAGRAMME), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Natural Language Processing & Knowledge Discovery (LORIA - NLPKD), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Margaret Mitchell and Kathleen McCoy and David McDonald and Aoife Cahill, and ANR-12-CORD-0004,Polymnie,Analyse et synthèse dans les grammaires catégorielles abstraites : du lexique au discours(2012)

Subjects
Generation process, Theoretical computer science, Property (philosophy), Interpretation (logic), Computer science, business.industry, 0102 computer and information sciences, 02 engineering and technology, computer.software_genre, 01 natural sciences, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], Rule-based machine translation, 010201 computation theory & mathematics, Encoding (memory), 0202 electrical engineering, electronic engineering, information engineering, Text generation, Key (cryptography), 020201 artificial intelligence & image processing, Artificial intelligence, business, computer, Natural language processing
Abstract

International audience; This paper presents an encoding of Generation-TAG (G-TAG) within Abstract Categorial Grammars (ACG). We show how the key notions of G-TAG have a natural interpretation in ACG, allowing us to use its reversibility property for text generation. It also offers solutions to several limitations of G-TAG.

Published
2014

9. A Type-Theoretic Account of Neg-Raising Predicates in Tree Adjoining Grammars

Author

Philippe de Groote, Laurence Danlos, Sylvain Pogodalla, Analyse Linguistique Profonde à Grande Echelle, Large-scale deep linguistic processing (ALPAGE), Université Paris Diderot - Paris 7 (UPD7)-Inria Paris-Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Semantic Analysis of Natural Language (SEMAGRAMME), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Natural Language Processing & Knowledge Discovery (LORIA - NLPKD), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Yukiko Nakano and Ken Satoh and Daisuke Bekki, ANR-12-CORD-0004,Polymnie,Analyse et synthèse dans les grammaires catégorielles abstraites : du lexique au discours(2012), Inria Paris-Rocquencourt, and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Paris Diderot - Paris 7 (UPD7)

Subjects
Semantic interpretation, 02 engineering and technology, computer.software_genre, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], Rule-based machine translation, Negation, 0202 electrical engineering, electronic engineering, information engineering, semantics, neg-raising, Mathematics, computer.programming_language, 060201 languages & linguistics, Programming language, business.industry, 06 humanities and the arts, Tree Adjoining Grammar, Predicate (grammar), Tree-adjoining grammar, type the- ory, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, Type theory, TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS, 0602 languages and literature, እ -calculus, 020201 artificial intelligence & image processing, Artificial intelligence, business, Lambda calculus, computer, Natural language processing
Abstract

International audience; Neg-Raising (NR) verbs form a class of verbs with a clausal complement that show the following behavior: when a negation syntactically attaches to the matrix predicate, it can semantically attach to the embedded predicate. This paper presents an account of NR predicates within Tree Adjoining Grammar (TAG). We propose a lexical semantic interpretation that heavily relies on a Montague-like semantics for TAG and on higher-order types.

Published
2014

10. Type Theories and Lexical Networks: Using Serious Games as the Basis for Multi-Sorted Typed Systems

Author

Lionel Ramadier, Manel Zarrouk, Stergios Chatzikyriakidis, Mathieu Lafourcade, University of Gothenburg (GU), 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é de Montpellier (UM), Laboratoire d'Informatique pour la Mécanique et les Sciences de l'Ingénieur (LIMSI), Université Paris Saclay (COmUE)-Centre National de la Recherche Scientifique (CNRS)-Sorbonne Université - UFR d'Ingénierie (UFR 919), Sorbonne Université (SU)-Sorbonne Université (SU)-Université Paris-Saclay-Université Paris-Sud - Paris 11 (UP11), ANR-12-CORD-0004,Polymnie,Analyse et synthèse dans les grammaires catégorielles abstraites : du lexique au discours(2012), Université Paris-Sud - Paris 11 (UP11)-Sorbonne Université - UFR d'Ingénierie (UFR 919), and Sorbonne Université (SU)-Sorbonne Université (SU)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Université Paris Saclay (COmUE)

Subjects
Linguistics and Language, Natural Language Inference, Principle of compositionality, Formal semantics (linguistics), P1-1091, 02 engineering and technology, Homophony, Ontology (information science), computer.software_genre, 01 natural sciences, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], Natural language inference, 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, [INFO]Computer Science [cs], 0101 mathematics, Polysemy, Philology. Linguistics, Mathematics, Discrete mathematics, Type Ontologies, business.industry, Type Theory, 010102 general mathematics, JeuxdeMots, Computer Science Applications, Type theory, Modeling and Simulation, Artificial intelligence, Lexical Networks, business, computer, Natural language processing, Formal Semantics
Abstract

International audience; In this paper, we show how a rich lexico-semantic network which has been built using serious games, JeuxDeMots, can help us in grounding our semantic ontologies as well as different sorts of information in doing formal semantics using rich or modern type theories (type theories within the tradition of Martin Löf). We discuss the domain of base types, adjectival and verbal types, hyperonymy/hyponymy relations as well as more advanced issues like homophony and polysemy. We show how one can take advantage of this wealth in a formal compositional semantics framework. This is a way to sidestep the problem of deciding how your type ontology should look like once you have made a move to a many sorted type system. Furthermore, we show how this kind of information can be extracted from JeuxdeMots and inserted into a proof-assistant like Coq in order to perform reasoning tasks using modern type theoretic semantics.

Catalog

Books, media, physical & digital resources
See catalog results