Tree Valence Controlled Grammars (original) (raw)

Structurally and Arithmetically Controlled Grammars

ABDURAHIM OKHUNOV

International Journal on Perceptive and Cognitive Computing, 2016

View PDFchevron_right

Context-Free Tree Grammars are as Powerful as Context-Free Jungle Grammars

Joost Engelfriet

Acta Cybernetica, 2015

View PDFchevron_right

Language classes generated by tree controlled grammars with bounded nonterminal complexity

SHERZOD TURAEV

Theoretical Computer Science, 2012

View PDFchevron_right

Multiple context-free tree grammars: Lexicalization and characterization

Joost Engelfriet

Theoretical Computer Science, 2018

View PDFchevron_right

The linguistic relevance of tree adjoining grammar

Anthony Kroch

1985

View PDFchevron_right

BIDIRECTIONAL AUTOMATA FOR TREE ADJOINING GRAMMARS

Miguel Angel Alonso Pardo

View PDFchevron_right

Construction of Derivation Trees of Plus Weighted Context Free Grammars

IJRASET Publication

International Journal for Research in Applied Science & Engineering Technology (IJRASET), 2023

View PDFchevron_right

On differentiation functions, structure functions, and related languages of context-free grammars

Victor Mitrana

RAIRO - Theoretical Informatics and Applications, 2004

View PDFchevron_right

Binary Context-Free Grammars

Ali Almisreb

Symmetry

View PDFchevron_right

A class of grammar generating non-counting languages

Dino Mandrioli

Information Processing Letters, 1978

View PDFchevron_right

Associative grammar combination operators for tree-based grammars

Shuly Wintner

Journal of Logic, Language and Information, 2009

View PDFchevron_right

Sequential grammars and automata with valences

Henning Fernau

Theoretical Computer Science, 2002

View PDFchevron_right

Proceedings of the 9th International Workshop on Tree Adjoining Grammars and Related Formalisms

Trọng Đỗ

2008

View PDFchevron_right

(2019) On trans-derivational operations: generative semantics and tree adjoining grammar

Diego Gabriel Krivochen

Language Sciences, 2019

View PDFchevron_right

Tree Adjoining Grammars in a fragment of the Lambek calculus

Vito Michele Abrusci

Computational Linguistics

View PDFchevron_right

Lambek grammars, tree adjoining grammars and hyperedge replacement grammars

Richard Moot

2008

View PDFchevron_right

Defining families of trees with E0L grammars

Thomas Ottmann

Discrete Applied Mathematics, 1991

View PDFchevron_right

Algebraic properties of structured context-free languages: old approaches and novel developments

Dino Mandrioli

Eprint Arxiv 0907 2130, 2009

View PDFchevron_right

The Convergence of Mildly Context-Sensitive Grammar Formalisms

Vijay Shanker

1989

View PDFchevron_right

C-grammars and tree-codifications

Adrian Atanasiu

Journal of Computer and System Sciences, 1977

View PDFchevron_right

Minimalist Grammars and Minimalist Categorial Grammars, definitions toward inclusion of generated languages

maxime amblard

2011

View PDFchevron_right

On the Mildly Context-Sensitive Characterization of Minimalist Grammars

Tahir Butt

View PDFchevron_right

Formal Grammars and Languages

Kenneth Regan

Oxford Handbooks Online, 2005

View PDFchevron_right

Consistent grammar development using partial tree-descriptions for lexicalized tree-adjoining grammars

jiawen liu

1998

View PDFchevron_right

The relationship between Tree Adjoining Grammars and Head Grammars

Vijay Aravind

1986

View PDFchevron_right

Developing Tree-Adjoining Grammars with Lexical Descriptions

Vijay Shanker, jiawen liu

View PDFchevron_right

Modular context-free grammars

Shuly Wintner

Grammars, 2002

View PDFchevron_right

Constraining Tree Adjoining Grammars by Unification

Karin Harbusch

1990

View PDFchevron_right

A Lexicalized Tree Adjoining Grammar for English

Sharon Cote

1990

View PDFchevron_right

On the structural grammatical inference problem for some classes of context-free grammars

Erkki Makinen

Information Processing Letters, 1992

View PDFchevron_right

Capturing CFLs with Tree Adjoining Grammars

James Rogers

Proceedings of the 32nd annual meeting on Association for Computational Linguistics -, 1994

View PDFchevron_right

String-tree correspondence grammar

Zaharin Yusoff

1987

View PDFchevron_right

Languages generated by context-free grammars extended by type AB → BA rules

Benedek Nagy

2009

View PDFchevron_right

n-Reconstructability of context-free grammars

Dino Mandrioli

Information Processing Letters, 1976

View PDFchevron_right

A note on pure grammars

Erkki Makinen

Information Processing Letters, 1986

View PDFchevron_right