scispace - formally typeset
Search or ask a question
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
More filters
Journal ArticleDOI
TL;DR: A correct and complete recognition and parsing algorithm is defined and sufficient conditions for the algorithm to run in linear time are given and these conditions are satisfied by a large class of pregroup grammars, including Grammars that handle coordinate structures and distant constituents.
Abstract: Pregroup grammars have a cubic recognition algorithm. Here, we define a correct and complete recognition and parsing algorithm and give sufficient conditions for the algorithm to run in linear time. These conditions are satisfied by a large class of pregroup grammars, including grammars that handle coordinate structures and distant constituents.

15 citations

Journal ArticleDOI
TL;DR: It is shown that a hierarchy of non-context-free languages, called control language hierarchy (CLH), generated by control grammars can be recognized in polynomial time.

15 citations

Proceedings ArticleDOI
26 Oct 2012
TL;DR: A Watson-Crick regular grammar that has rules as in a regular grammar but involves double stranded strings is introduced and some properties of these grammars are obtained and an application is indicated to generation of chain code pictures.
Abstract: Motivated by Watson-Crick automata, we introduce here a grammar counterpart called a Watson-Crick regular grammar that has rules as in a regular grammar but involves double stranded strings. The language generated by this grammar consists of strings in the upper strands of the double stranded strings related by a complementarity relation. We obtain some properties of these grammars and also indicate an application to generation of chain code pictures.

15 citations

Journal ArticleDOI
Fumiya Okubo1
TL;DR: In formal language theory, it is of interest to study semi-conditional grammars from the point of view of descriptional complexity regarding the number of nonterminals and theNumber of non-context-free productions.

14 citations


Network Information
Related Topics (5)
Graph (abstract data type)
69.9K papers, 1.2M citations
85% related
Parsing
21.5K papers, 545.4K citations
85% related
Time complexity
36K papers, 879.5K citations
84% related
Semantics
24.9K papers, 653K citations
82% related
Tree (data structure)
44.9K papers, 749.6K citations
81% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202315
202225
20217
20205
20196
201811