Topic
Tree-adjoining grammar
About: Tree-adjoining grammar is a research topic. Over the lifetime, 2491 publications have been published within this topic receiving 57813 citations.
Papers published on a yearly basis
Papers
More filters
01 Jan 2004
TL;DR: This work defines some types of grammars where context-free rules are used and restriction imposed on the derivations and compares the generative power and decidability properties and basic facts on syntactic complexity.
Abstract: Context-free grammars are not able to cover all linguistic phenomena. Thus we define some types of grammars where context-free rules are used and restriction imposed on the derivations. We illustrate the concepts by examples, compare the generative power, give some closure and decidability properties and basic facts on syntactic complexity.
32 citations
01 Sep 2000
TL;DR: A formal approach for the specification of mobile code systems based on graph grammars, that is a formal description technique suitable for the description of highly parallel systems, and is intuitive even for non-theoreticians is introduced.
Abstract: In this paper we introduce a formal approach for the specification of mobile code systems. This approach is based on graph grammars, that is a formal description technique that is suitable for the description of highly parallel systems, and is intuitive even for non-theoreticians We define a special class of graph grammars using the concepts of object-based systems and include location information explicitly. Aspects of modularity and execution in an open environment are discussed.
32 citations
TL;DR: Relation grammars as mentioned in this paper are a powerful formalism for specifying the syntax of visual languages and, more generally, of multi-dimensional languages and allow the introduction of any number of relations.
Abstract: Relation grammars are introduced as a powerful formalism for specifying the syntax of visual languages and, more generally, of multi-dimensional languages. Textual languages use only the implicit relation of sequential concatenation of symbols. The proposed extension relax this limitation and allows the introduction of any number of relations. By analogy with textual grammars, relation grammars make it easier to recognize the purpose of the lexical analysis phase and that of the syntactic one for parsing multi-dimensional structures.
32 citations
32 citations
23 Sep 2002
TL;DR: In inductive inference for synthesizing context free grammars from positive and negative sample strings, implemented in Synapse system, is described.
Abstract: This paper describes inductive inference for synthesizing context free grammars from positive and negative sample strings, implemented in Synapse system. For effective inference of grammars, Synapse employs the following mechanisms. 1. A rule generating method called "inductive CYK algorithm," which generates minimum production rules required for parsing positive samples. 2. Incremental learning for adding newly generated rules to previously obtained rules.Synapse can synthesize both ambiguous grammars and unambiguous grammars. Experimental results show recent improvement of Synapse system to synthesize context free grammars.
32 citations