Word graphs: The third set

This is the third paper in a series of natural language processing in term of knowledge graphs. A word is a basic unit in natural language processing. This is why we study word graphs. Word graphs were already built for prepositions and adwords (including adjectives, adverbs and Chinese quantity words) in two other papers. In this paper, we propose the concept of the logic word and classify logic words into groups in terms of semantics and the way they are used in describing reasoning processes. A start is made with the building of the lexicon of logic words in terms of knowledge graphs

Syntax and semantics: A comparison of the structuralistic language theory of Ebeling with knowledge graph theory

This paper describes a comparison of two structuralistic theories of syntax and semantics of language. Both theories were developed in The Netherlands. One was developed by C.L.Ebeling at the University of Amsterdam about 30 years ago, the other by C.Hoede and students at the University of Twente in the last 20 years

Automatic case acquisition from texts for process-oriented case-based reasoning

This paper introduces a method for the automatic acquisition of a rich case representation from free text for process-oriented case-based reasoning. Case engineering is among the most complicated and costly tasks in implementing a case-based reasoning system. This is especially so for process-oriented case-based reasoning, where more expressive case representations are generally used and, in our opinion, actually required for satisfactory case adaptation. In this context, the ability to acquire cases automatically from procedural texts is a major step forward in order to reason on processes. We therefore detail a methodology that makes case acquisition from processes described as free text possible, with special attention given to assembly instruction texts. This methodology extends the techniques we used to extract actions from cooking recipes. We argue that techniques taken from natural language processing are required for this task, and that they give satisfactory results. An evaluation based on our implemented prototype extracting workflows from recipe texts is provided.Comment: Sous presse, publication pr\'evue en 201

On Deriving Nested Calculi for Intuitionistic Logics from Semantic Systems

This paper shows how to derive nested calculi from labelled calculi for propositional intuitionistic logic and first-order intuitionistic logic with constant domains, thus connecting the general results for labelled calculi with the more refined formalism of nested sequents. The extraction of nested calculi from labelled calculi obtains via considerations pertaining to the elimination of structural rules in labelled derivations. Each aspect of the extraction process is motivated and detailed, showing that each nested calculus inherits favorable proof-theoretic properties from its associated labelled calculus

Graph Theory and Universal Grammar

Tese arquivada ao abrigo da Portaria nº 227/2017 de 25 de Julho-Registo de Grau EstrangeiroIn the last few years, Noam Chomsky (1994; 1995; 2000; 2001) has gone quite far in the direction of simplifying syntax, including eliminating X-bar theory and the levels of D-structure and S-structure entirely, as well as reducing movement rules to a combination of the more primitive operations of Copy and Merge. What remain in the Minimalist Program are the operations Merge and Agree and the levels of LF (Logical Form) and PF (Phonological form). My doctoral thesis attempts to offer an economical theory of syntactic structure from a graph-theoretic point of view (cf. Diestel, 2005), with special emphases on the elimination of category and projection labels and the Inclusiveness Condition (Chomsky 1994). The major influences for the development of such a theory have been Chris Collins’ (2002) seminal paper “Eliminating labels”, John Bowers (2001) unpublished manuscript “Syntactic Relations” and the Cartographic Paradigm (see Belletti, Cinque and Rizzi’s volumes on OUP for a starting point regarding this paradigm). A syntactic structure will be regarded here as a graph consisting of the set of lexical items, the set of relations among them and nothing more

Logics for Unranked Trees: An Overview

Labeled unranked trees are used as a model of XML documents, and logical languages for them have been studied actively over the past several years. Such logics have different purposes: some are better suited for extracting data, some for expressing navigational properties, and some make it easy to relate complex properties of trees to the existence of tree automata for those properties. Furthermore, logics differ significantly in their model-checking properties, their automata models, and their behavior on ordered and unordered trees. In this paper we present a survey of logics for unranked trees