Vers une analyse logico-linguistique des structures de comparaison

Dans cet article, nous nous intéressons à la syntaxe des comparatives, et plus particulièrement à l’analyse sémantique des structures phrastiques exprimant la comparaison. Toutefois les comparatives semblent être un domaine de recherche très délicat en analyse syntaxique, le cadre minimaliste de la grammaire générative a proposé une analyse des traits morphologiques propres aux catégories et à leurs réalisations lexicales, ce qui permet de contrôler l’acceptabilité des configurations structurelles en syntaxe en se référant à leurs structures sémantiques ; l’objectif de cette étude est de fournir une telle analyse et de permettre une meilleure compréhension de la formation des structures comparatives. Par la modélisation des comparaisons sous forme de paires prédicat-argument reliées par des rôles sémantiques, nous allons essayer de présenter un autre cadre sémantique permettant de représenter le sens de diverses constructions de comparaison en langage naturel.In this paper, we are interested in the syntax of comparatives, and more particularly in the semantic analysis of sentence structures expressing the comparison. Comparatives, however, seem to be a very delicate field of research in syntactic analysis. The minimalist framework of generative grammar has proposed an analysis of the morphological traits specific to categories and their lexical realizations, which makes it possible to control the acceptability of structural configurations by syntax by referring to their semantic structures ; the objective of this study is to provide such an analysis and to allow a better understanding of the formation of comparative structures. By modeling comparisons in the form of predicate-argument pairs linked by semantic roles, we will try to present another semantic framework for representing the meaning of various natural language comparison constructs

Semantic-driven matchmaking of web services using case-based reasoning

With the rapid proliferation of Web services as the medium of choice to securely publish application services beyond the firewall, the importance of accurate, yet flexible matchmaking of similar services gains importance both for the human user and for dynamic composition engines. In this paper, we present a novel approach that utilizes the case based reasoning methodology for modelling dynamic Web service discovery and matchmaking. Our framework considers Web services execution experiences in the decision making process and is highly adaptable to the service requester constraints. The framework also utilises OWL semantic descriptions extensively for implementing both the components of the CBR engine and the matchmaking profile of the Web services

Message-Passing Protocols for Real-World Parsing -- An Object-Oriented Model and its Preliminary Evaluation

We argue for a performance-based design of natural language grammars and their associated parsers in order to meet the constraints imposed by real-world NLP. Our approach incorporates declarative and procedural knowledge about language and language use within an object-oriented specification framework. We discuss several message-passing protocols for parsing and provide reasons for sacrificing completeness of the parse in favor of efficiency based on a preliminary empirical evaluation.Comment: 12 pages, uses epsfig.st

CNM: An Interpretable Complex-valued Network for Matching

This paper seeks to model human language by the mathematical framework of quantum physics. With the well-designed mathematical formulations in quantum physics, this framework unifies different linguistic units in a single complex-valued vector space, e.g. words as particles in quantum states and sentences as mixed systems. A complex-valued network is built to implement this framework for semantic matching. With well-constrained complex-valued components, the network admits interpretations to explicit physical meanings. The proposed complex-valued network for matching (CNM) achieves comparable performances to strong CNN and RNN baselines on two benchmarking question answering (QA) datasets

Graphene: Semantically-Linked Propositions in Open Information Extraction

We present an Open Information Extraction (IE) approach that uses a two-layered transformation stage consisting of a clausal disembedding layer and a phrasal disembedding layer, together with rhetorical relation identification. In that way, we convert sentences that present a complex linguistic structure into simplified, syntactically sound sentences, from which we can extract propositions that are represented in a two-layered hierarchy in the form of core relational tuples and accompanying contextual information which are semantically linked via rhetorical relations. In a comparative evaluation, we demonstrate that our reference implementation Graphene outperforms state-of-the-art Open IE systems in the construction of correct n-ary predicate-argument structures. Moreover, we show that existing Open IE approaches can benefit from the transformation process of our framework.Comment: 27th International Conference on Computational Linguistics (COLING 2018

Discourse Structure in Machine Translation Evaluation

In this article, we explore the potential of using sentence-level discourse structure for machine translation evaluation. We first design discourse-aware similarity measures, which use all-subtree kernels to compare discourse parse trees in accordance with the Rhetorical Structure Theory (RST). Then, we show that a simple linear combination with these measures can help improve various existing machine translation evaluation metrics regarding correlation with human judgments both at the segment- and at the system-level. This suggests that discourse information is complementary to the information used by many of the existing evaluation metrics, and thus it could be taken into account when developing richer evaluation metrics, such as the WMT-14 winning combined metric DiscoTKparty. We also provide a detailed analysis of the relevance of various discourse elements and relations from the RST parse trees for machine translation evaluation. In particular we show that: (i) all aspects of the RST tree are relevant, (ii) nuclearity is more useful than relation type, and (iii) the similarity of the translation RST tree to the reference tree is positively correlated with translation quality.Comment: machine translation, machine translation evaluation, discourse analysis. Computational Linguistics, 201