79,982 research outputs found
Forms of Semantic Specification
The way to specify a programming language has been a topic of heated debate for some decades and at present there is no consensus on how this is best done. Real languages are almost always specified informally; nevertheless, precision is often enough lacking that more formal approaches could benefit both programmers and language implementors. My purpose is to look at a few of these formal approaches in hope of establishing some distinctions or at least stirring some discussion
Lexical relatedness and the lexical entry - a formal unification
Based on the notion of a lexicon with default inheritance, I address the problem of how to provide a template for lexical representations that allows us to capture the relatedness between inflected word forms and canonically derived lexemes within a broadly realizational-inferential model of morphology. To achieve this we need to be able to represent a whole host of intermediate types of lexical relatedness that are much less frequently discussed in the literature. These include transpositions such as deverbal participles, in which a word's morphosyntactic class changes (e.g. verb ⇒ adjective) but no semantic predicate is added to the semantic representation and the derived word remains, in an important sense, a "form" of the base lexeme (e.g. the 'present participle form of the verb'). I propose a model in which morphological properties are inherited by default from syntactic properties and syntactic properties are inherited from semantic properties, such as ontological category (the Default Cascade). Relatedness is defined in terms of a Generalized Paradigm Function (perhaps in reality a relation), a generalization of the Paradigm Function of Paradigm Function Morphology (Stump 2001). The GPF has four components which deliver respectively specifications of a morphological form, syntactic properties, semantic representation and a lexemic index (LI) unique to each individuated lexeme in the lexicon. In principle, therefore, the same function delivers derived lexemes as inflected forms. In order to ensure that a newly derived lexeme of a distinct word class can be inflected I assume two additional principles. First, I assume an Inflectional Specifiability Principle, which states that the form component of the GPF (which defines inflected word forms of a lexeme) is dependent on the specification of the lexeme's morpholexical signature, a declaration of the properties that the lexeme is obliged to inflect for (defined by default on the basis of morpholexical class). I then propose a Category Erasure Principle, which states that 'lower' attributes are erased when the GPF introduces a non-trivial change to a 'higher' attribute (e.g. a change to the semantic representation entails erasure of syntactic and morphological information). The required information is then provided by the Default Cascade, unless overridden by specific declarations in the GPF. I show how this model can account for a variety of intermediate types of relatedness which cannot easily be treated as either inflection or derivation, and conclude with a detailed illustration of how the system applies to a particularly interesting type of transposition in the Samoyedic language Sel'kup, in which a noun is transposed to a similitudinal adjective whose form is in paradigmatic opposition to case-marked noun forms, and which is therefore a kind of inflection
THE DRAG LANGUAGE
This thesis describes the Drag language. Drag is a general purpose, gradually typed, lexically scoped, and multi-paradigm pro- gramming language. The essence of Drag is to build the abstract syntax trees of the programs directly and interactively. Our work includes the language specification and a prototype program. The language specification focuses on the syntax, the semantic model, and the type system. The prototype consists of an interactive editor and a compiler that targets several plat- forms, among which we focus on the LLVM platform in this thesis
Semantic Component Composition
Building complex software systems necessitates the use of component-based
architectures. In theory, of the set of components needed for a design, only
some small portion of them are "custom"; the rest are reused or refactored
existing pieces of software. Unfortunately, this is an idealized situation.
Just because two components should work together does not mean that they will
work together.
The "glue" that holds components together is not just technology. The
contracts that bind complex systems together implicitly define more than their
explicit type. These "conceptual contracts" describe essential aspects of
extra-system semantics: e.g., object models, type systems, data representation,
interface action semantics, legal and contractual obligations, and more.
Designers and developers spend inordinate amounts of time technologically
duct-taping systems to fulfill these conceptual contracts because system-wide
semantics have not been rigorously characterized or codified. This paper
describes a formal characterization of the problem and discusses an initial
implementation of the resulting theoretical system.Comment: 9 pages, submitted to GCSE/SAIG '0
Attempto Controlled English (ACE)
Attempto Controlled English (ACE) allows domain specialists to interactively
formulate requirements specifications in domain concepts. ACE can be accurately
and efficiently processed by a computer, but is expressive enough to allow
natural usage. The Attempto system translates specification texts in ACE into
discourse representation structures and optionally into Prolog. Translated
specification texts are incrementally added to a knowledge base. This knowledge
base can be queried in ACE for verification, and it can be executed for
simulation, prototyping and validation of the specification.Comment: 13 pages, compressed, uuencoded Postscript, to be presented at CLAW
96, The First International Workshop on Controlled Language Applications,
Katholieke Universiteit Leuven, 26-27 March 199
NITELIGHT: A Graphical Tool for Semantic Query Construction
Query formulation is a key aspect of information retrieval, contributing to both the efficiency and usability of many semantic applications. A number of query languages, such as SPARQL, have been developed for the Semantic Web; however, there are, as yet, few tools to support end users with respect to the creation and editing of semantic queries. In this paper we introduce a graphical tool for semantic query construction (NITELIGHT) that is based on the SPARQL query language specification. The tool supports end users by providing a set of graphical notations that represent semantic query language constructs. This language provides a visual query language counterpart to SPARQL that we call vSPARQL. NITELIGHT also provides an interactive graphical editing environment that combines ontology navigation capabilities with graphical query visualization techniques. This paper describes the functionality and user interaction features of the NITELIGHT tool based on our work to date. We also present details of the vSPARQL constructs used to support the graphical representation of SPARQL queries
A Bi-Polar Theory of Nominal and Clause Structure and Function
It is taken as axiomatic that grammar encodes meaning. Two key dimensions of meaning that get grammatically encoded are referential meaning and relational meaning. The key claim is that, in English, these two dimensions of meaning are typically encoded in distinct grammatical poles—a referential pole and a relational pole—with a specifier functioning as the locus of the referential pole and a head functioning as the locus of the relational pole. Specifiers and heads combine to form referring expressions corresponding to the syntactic notion of a maximal projection. Lexical items and expressions functioning as modifiers are preferentially attracted to one pole or the other. If the head of an expression describes a relation, one or more complements may be associated with the head. The four grammatical functions specifier, head, modifier and complement are generally adequate to represent much of the basic structure and function of nominals and clauses. These terms are borrowed from X-Bar Theory, but they are motivated on semantic grounds having to do with their grammatical function to encode referential and relational meaning
The Unbearable Lightness of Being a Copula in Latin: on a Textual Problem in Cicero's Oration in Defence of Publius Sestius
A textual problem from Cicero's oration In defence of Publius Sestius is discussed in order to determine syntactic and semantic consequences of editorial choices. The discussion involves semantic and syntactic properties of Latin past participles within a minimalist setting. A detailed investigation of the passage indicates that a textual variant not accepted by most editors is to be preferred
- …