A generative statistical model of dependency syntax is proposed based on Tesni ere's classical theory. It provides a stochastic formalization of the original model of syntactic structure and augments it with a model of the string realization process, the latter which is lacking in Tesni ere's original work. The resulting theory models crossing dependency links, discontinuous nuclei and string m...

We introduce a framework for lightweight dependency syntax annotation. Our formalism builds upon the typical representation for unlabeled dependencies, permitting a simple notation and annotation workflow. Moreover, the formalism encourages annotators to underspecify parts of the syntax if doing so would streamline the annotation process. We demonstrate the efficacy of this annotation on three ...

This paper shows how to introduce predicative adjunction in a dependency grammar inspired from TAG, MTT and RG. The addition of predicative adjunction allows us to obtain a modular surface syntactic grammar, the derivation structures of which can be interpreted as semantic representations.

In this talk, we contend that, for NLs, the divide between model-theoretic semantics and proof-theoretic semantics has not been well-understood. In particular, the formal semantics based on modern type theories (MTTs) may be seen as both model-theoretic and prooftheoretic. To be more precise, it may be seen both ways in the sense that the NL semantics can first be represented in an MTT in a mod...

This paper presents the latest developments in the “Formal Methods in Conformance Testing” (FMCT) project of ISO and ITU–T. The project has been initiated to study the role of formal description techniques in the conformance testing process. The goal is to develop a standard that defines the meaning of conformance in the context of formal description techniques. We give an account of the curren...

Formal methods and formal models are important tools in software engineering. Formal methods provide unambiguous meaning of programs written in some language or constructed from modules. Moreover, they provide the basic mathematical techniques necessary for those who are working with theoretical background in computer science. Categories are interesting mathematical structures which have become...

Formal methods are gaining prominence in software engineering as a way to insure that a specification is consistent with its intended meaning, and that two formally-rendered artifacts (e.g., a specification and an implementation) are consistent with each other in some precise way. Formal methods in the arena of software architecture tend to manifest themselves in representation technology, prin...

This paper describes a class of formal analysis called consistency checking that mechanically checks requirements speci cations, expressed in the SCR tabular notation, for application-independent properties. Properties include domain coverage, type correctness, and determinism. As background, the SCR notation for specifying requirements is reviewed. A formal requirements model describing the me...

The paper presents the Meaning-Text linguistic theory, a theoretical framework for the construction of models of natural languages, called Meaning-Text Models. Since its beginnings, in the 1960’s, the Meaning-Text theory has placed strong emphasis on semantics and considered natural language primarily as a tool for expressing meaning. This basic insight underlies its interest in linguistic synt...

The purpose of formal and so called semi-formal approaches to business process modeling is to provide a general technique for the development of workflow based information systems. For this, a concise and repeatable transformation of initial requirements into the final system must be achieved. Moreover, there is also a need for complex models to include justifications that explain the meaning a...