English
Related papers

Related papers: A specification language for Lexical Functional Gr…

200 papers

Gene Ontology (GO) is the most important resource for gene function annotation. It provides a way to unify biological knowledge across different species via a dynamic and controlled vocabulary. GO is now widely represented in the Semantic…

Genomics · Quantitative Biology 2019-09-26 Yanying Wu

We present a formal semantics and proof of soundness for shapes schemas, an expressive schema language for RDF graphs that is the foundation of Shape Expressions Language 2.0. It can be used to describe the vocabulary and the structure of…

Databases · Computer Science 2017-09-20 Iovka Boneva , Jose Emilio Labra Gayo , Eric G. Prud'hommeau

This paper presents a multidimensional Dependency Grammar (DG), which decouples the dependency tree from word order, such that surface ordering is not determined by traversing the dependency tree. We develop the notion of a \emph{word order…

cmp-lg · Computer Science 2009-09-25 Norbert Broeker

We tackle the task of enriching ontologies by automatically translating natural language sentences into Description Logic. Since Large Language Models (LLMs) are the best tools for translations, we fine-tuned a GPT-3 model to convert…

Artificial Intelligence · Computer Science 2023-08-01 Patricia Mateiu , Adrian Groza

We consider grammar-restricted exact learning of formulas and terms in finite variable logics. We propose a novel and versatile automata-theoretic technique for solving such problems. We first show results for learning formulas that…

Logic in Computer Science · Computer Science 2021-11-15 Paul Krogmeier , P. Madhusudan

This paper compares the consistency-based account of agreement phenomena in `unification-based' grammars with an implication-based account based on a simple feature extension to Lambek Categorial Grammar (LCG). We show that the LCG…

cmp-lg · Computer Science 2008-02-03 Sam Bayer , Mark Johnson

Techniques for runtime verification often utilise specification languages that are (i) reasonably expressive, and (ii) relatively abstract (i.e. they operate on a level of abstraction that separates them from the system being monitored).…

Logic in Computer Science · Computer Science 2018-06-11 Joshua Heneage Dawes , Giles Reger

A natural next step in the evolution of constraint-based grammar formalisms from rewriting formalisms is to abstract fully away from the details of the grammar mechanism---to express syntactic theories purely in terms of the properties of…

cmp-lg · Computer Science 2008-02-03 James Rogers

We define the notion of linguistic structure on a small category, in order to provide a more formal description of ontology logs, also known as ologs, introduced by R. E. Kent and D. I. Spivak in their paper "Ologs: A categorical framework…

Category Theory · Mathematics 2015-06-23 Marco A. Pérez , David I. Spivak

We study the generalization abilities of language models when translating natural language into formal specifications with complex semantics. In particular, we fine-tune language models on three datasets consisting of English sentences and…

Software Engineering · Computer Science 2022-10-21 Christopher Hahn , Frederik Schmitt , Julia J. Tillman , Niklas Metzger , Julian Siber , Bernd Finkbeiner

This paper is a reflexion on the computability of natural language semantics. It does not contain a new model or new results in the formal semantics of natural language: it is rather a computational analysis of the logical models and…

Computation and Language · Computer Science 2016-05-16 Richard Moot , Christian Retoré

Regular cost functions have been introduced recently as an extension to the notion of regular languages with counting capabilities, which retains strong closure, equivalence, and decidability properties. The specificity of cost functions is…

Logic in Computer Science · Computer Science 2017-02-09 Denis Kuperberg

Lexical selection in Machine Translation consists of several related components. Two that have received a lot of attention are lexical mapping from an underlying concept or lexical item, and choosing the correct subcategorization frame…

cmp-lg · Computer Science 2008-02-03 Dania Egedi , Martha Palmer

Results of computational complexity exist for a wide range of phrase structure-based grammar formalisms, while there is an apparent lack of such results for dependency-based formalisms. We here adapt a result on the complexity of…

cmp-lg · Computer Science 2008-02-03 Peter Neuhaus , Norbert Broeker

We propose a new task-specification language for Markov decision processes that is designed to be an improvement over reward functions by being environment independent. The language is a variant of Linear Temporal Logic (LTL) that is…

Artificial Intelligence · Computer Science 2017-04-17 Michael L. Littman , Ufuk Topcu , Jie Fu , Charles Isbell , Min Wen , James MacGlashan

This paper defines unification based ID/LP grammars based on typed feature structures as nonterminals and proposes a variant of Earley's algorithm to decide whether a given input sentence is a member of the language generated by a…

cmp-lg · Computer Science 2016-08-31 Frank Morawietz

This paper provides a geometric characterization of subclasses of the regular languages. We use finite model theory to characterize objects like strings and trees as relational structures. Logical statements meeting certain criteria over…

Formal Languages and Automata Theory · Computer Science 2019-08-23 Jonathan Rawski

This paper describes the Linguistic Annotation Framework under development within ISO TC37 SC4 WG1. The Linguistic Annotation Framework is intended to serve as a basis for harmonizing existing language resources as well as developing new…

Computation and Language · Computer Science 2007-07-24 Laurent Romary , Nancy Ide

Phrase-structure grammars are effective models for important syntactic and semantic aspects of natural languages, but can be computationally too demanding for use as language models in real-time speech recognition. Therefore, finite-state…

cmp-lg · Computer Science 2008-02-03 Fernando C. N. Pereira , Rebecca N. Wright

The approach to reasoning about structural operational semantics style specifications supported by the Abella system is discussed. This approach uses lambda tree syntax to treat object language binding and encodes binding related properties…

Logic in Computer Science · Computer Science 2008-12-18 Andrew Gacek , Dale Miller , Gopalan Nadathur