functional dependency structures Franti sek Mat u s Institute of Information Theory and Automation Czechoslovak Academy of Sciences Pod vodd arenskou v e z 4, 182 08 Prague Czechoslovakia Abstract The functional dependency (FD) structures known mainly from the database relationships theory are appeared to comprehend other kinds of dependencies among objects like functions, boolean or random var...

The thesis presents the analysis of dependency parsing systems that are used for parsing German. We restrict ourselves to four parsers operated on the same input data: two of the parsing systems are data-driven; other two are grammar-driven parsers. The main similarity of these parsers is that all of them are based on the same linguistic framework – the dependency theory described in the second...

Functional dependencies [4] and multivalued dependencies [5,11] are important, widely-studied constraints on databases. A fundamental issue in database theory is the question of determining whether or not a given set of dependencies (in our case, functional and multivalued dependencies) logically implies another given dependency. We provide a simple and elegant set-theoretic characterization fo...

When software designers refer to the relational calculus, what they usually mean is the set-theoretic kernel of relational database design “à la Codd” and not the calculus of binary relations which was initiated by De Morgan in the 1860s an eventually became the core of the algebra of programming. Contrary to the intuition that a binary relation is just a particular case of -ary relation, this ...

Normal forms play a central role in the design of relational databases. Several normal forms for temporal relational databases have been proposed. These definitions are particular to specific temporal data models, which are numerous and incompatible. This paper attempts to rectify this situation. We define a consistent framework of temporal equivalents of the important conventional database des...

This paper contributes to the formal theory of dependency grammar. We apply the classical concept of algebraic recognizability to characterize regular sets of dependency structures, and show how in this framework, two empirically relevant structural restrictions on dependency analyses yield infinite hierarchies of ever more expressive string languages.

The paper investigates the problem of representing coordination constructs in a formal system for the dependency approach to syntax. The distinctive aspect of the formalism is the presence of non-lexical (trace ~) nodes in the representation. We illustrate the basic mechanisms, and how they can account for syntactic phenomena involving long-distance dependencies. Then, we see how the same mecha...

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 address the question what it takes to define a correct probabilistic model for syntactic natural language processing. We focus on one particular theory of syntax, called dependency syntax, and develop a framework for developing probabilistic model for that linguistic theory. Subsequently, we review existing models of probabilistic dependency syntax and show some problematic aspects of these ...