The new approach to representation of syntax of formal languages – a formalism of syntax diagrams is offered. Syntax diagrams look a convenient language for the description of syntactic relations in the languages having nonlinear representation of texts, for example, for representation of syntax lows of the language of structural chemical formulas. The formalism of neighbourhood grammar is used...

First we deene a uniication grammar formalism called the Tree Homomorphic Feature Structure Grammar. It is based on Lexical Functional Grammar (LFG), but has a strong restriction on the syntax of the equations. We then show that this grammar formalism deenes a full abstract family of languages, and that it is capable of describing cross-serial dependencies of the type found in Swiss German.

We propose a new language learning model that learns a syntactic-semantic grammar from a small number of natural language strings annotated with their semantics, along with basic assumptions about natural language syntax. We show that the search space for grammar induction is a complete grammar lattice, which guarantees the uniqueness of the learned grammar.

The Japanese language has rather simple morphology and semanticsoriented syntax. It is also heavily context dependent in the sense that many constituents can be omitted. Thus we need to formalize Japanese grammar to take morphology, syntax, semantics and pragmatic factors into account. Based on CUProlog which is a constraint logic programming language, we have developed a grammar formalism for ...

We propose a syntax-semantics interface that realises the mapping between syntax and semantics as a relation and does not make functionality assumptions in either direction. This interface is stated in terms of Extensible Dependency Grammar (XDG), a grammar formalism we newly specify. XDG’s constraint-based parser supports the concurrent flow of information between any two levels of linguistic ...

In this paper, we argue that in it-clefts as in It was Ohno who won, the cleft pronoun (it) and the cleft clause (who won) form a discontinuous syntactic constituent, and a semantic unit as a definite description, presenting arguments from Percus (1997) and Hedberg (2000). We propose a syntax of it-clefts using Tree-Local MultiComponent Tree Adjoining Grammar and a compositional semantics on th...

This paper presents a novel grammar formalism, Synchronous Tree Unification Grammar (STUG), that borrows ideas from two rather distinct exemplars of tree-based grammar formalisms, namely Synchronous Tree Adjoining Grammar and Tree Unification Grammar. At the same time STUG differs considerably from those in that it allows for a clean separation of syntax and valency. Exploiting this potential i...

A foundational assumption of traditional generative grammar is that a grammar is organized in the mind of the speaker as a number of hermetically sealed modules, which in the course of a derivation hand off data one to the other.1 Sign-Based Construction Grammar (SBCG) assumes that the grammar contains no such modules, but rather that grammar is an inventory of signs, complexes of linguistic co...

Graph grammars may be used as natural and powerful syntax-definition formalisms for visual programming languages. Yet most graph-grammar parsing algorithms presented so far are either unable to recognize interesting visual languages or tend to be inefficient (with exponential time complexity) when applied to graphs with a large number of nodes and edges. This paper presents a context-sensitive ...