article

Tree adjunct grammars

Authors:

Aravind K. Joshi,

Masako TakahashiAuthors Info & Claims

Journal of Computer and System Sciences, Volume 10, Issue 1

Pages 136 - 163

https://doi.org/10.1016/S0022-0000(75)80019-5

Published: 01 February 1975 Publication History

Abstract

In this paper, a tree generating system called a tree adjunct grammar is described and its formal properties are studied relating them to the tree generating systems of Brainerd (Information and Control14 (1969), 217-231) and Rounds (Mathematical Systems Theory 4 (1970), 257-287) and to the recognizable sets and local sets discussed by Thatcher (Journal of Computer and System Sciences1 (1967), 317-322; 4 (1970), 339-367) and Rounds. Linguistic relevance of these systems has been briefly discussed also.

References

[1]

Indexed grammars: an extension of the context-free grammars. J. Assoc. Comput. Mach. v15. 647-671.

[2]

Measures of syntactic complexity. In: Tech. Report No. 13, Applied Logic Branch, The Hebrew University of Jerusalem, Jerusalem, Israel.

[3]

Tree generating regular systems. Information and Control. v14. 217-231.

[4]

Semi-Thue systems and representations of trees. In: Proceedings Tenth Annual IEEE Symposium on Switching and Automata Theory,

[5]

In: Syntactic Structures, Monton, The Hague, Netherlands.

[6]

Explicit definitions and linguistic dominoes. In: Proceedings of the Systems and Computer Science Conference, pp. 77-115.

[7]

In: Mathematical Structures of Language, Interscience, New York.

[8]

How much hierarchical structures is necessary for sentence description?. In: Plötz, S. (Ed.), Transformationelle Analyse, Athenaum-Verlag, (Harcourt Brace), Frankfurt.

[9]

In: Gross, M., Halle, M., Schützenberger, M.P. (Eds.), A Class of Transformational Grammars, Monton, The Hague, Netherlands.

[10]

A characterization of the derivation trees of a context-free grammar and an intercalation theorem. In: Tech. Report, The Moore School of Electrical Engineering, University of Pennsylvania.

[11]

String adjunct grammars: Parts I and II. Information and Control. v21. 93-116.

[12]

Tree adjunct, parenthesis, and distributed adjunct grammars. In: Proceedings of the International Symposium on Theory of Machines and Computations, Academic Press, New York. pp. 127-143.

[13]

Some results in tree automata. Math. Systems Theory. v6.

[14]

A helpful result for proving inherent ambiguity. Math. Systems Theory. v2. 191-194.

[15]

On context-free languages. J. Assoc. Comput. Mach. v13. 570-581.

[16]

Mappings and grammars on trees. Math. Systems Theory. v4. 257-287.

[17]

Characterizing derivation trees of a context-free grammar through a generalization of finite automata theory. J. Comput. System Sci. v1. 317-322.

[18]

Generalized sequential transducer. J. Comput. System Sci. v4. 339-367.

Cited By

Guillaume MPogodalla STourneur V(2024)ACGtk: A Toolkit for Developing and Running Abstract Categorial GrammarsFunctional and Logic Programming10.1007/978-981-97-2300-3_2(13-30)Online publication date: 15-May-2024
https://dl.acm.org/doi/10.1007/978-981-97-2300-3_2
Wang YWu J(2021)The Code Generation Method Based on Gated Attention and InterAction-LSTMWeb Information Systems and Applications10.1007/978-3-030-87571-8_47(544-555)Online publication date: 24-Sep-2021
https://dl.acm.org/doi/10.1007/978-3-030-87571-8_47
Miyazaki TMinamide Y(2021)Context-Free Grammars with LookaheadLanguage and Automata Theory and Applications10.1007/978-3-030-68195-1_16(213-225)Online publication date: 1-Mar-2021
https://dl.acm.org/doi/10.1007/978-3-030-68195-1_16
Show More Cited By

Tree adjunct grammars
1. Theory of computation
  1. Formal languages and automata theory

Recommendations

An Earley-type parsing algorithm for Tree Adjoining Grammars
ACL '88: Proceedings of the 26th annual meeting on Association for Computational Linguistics

We will describe an Earley-type parser for Tree Adjoining Grammars (TAGs). Although a CKY-type parser for TAGs has been developed earlier (Vijay-Shanker and Joshi, 1985), this is the first practical parser for TAGs because as is well known for CFGs, the ...
Left Corner Parser for Tree Insertion Grammars
AIMSA '02: Proceedings of the 10th International Conference on Artificial Intelligence: Methodology, Systems, and Applications

Tree Adjoining Grammar (TAG) is a grammar formalism that has become very popular for the description of natural languages, however, this context-sensitive formalism entails important computation costs ( O ( n ⁶)-time). Tree Insertion Grammar (TIG) is ...
Mixed Parsing of Tree Insertion and Tree Adjoining Grammars
IBERAMIA 2002: Proceedings of the 8th Ibero-American Conference on AI: Advances in Artificial Intelligence

Adjunction is a powerful operation that makes Tree Adjoining Grammar (TAG) useful for describing the syntactic structure of natural languages. In practice, a large part of wide coverage grammars written following the TAG formalism is formed by trees ...

Comments

Information & Contributors

Information

Published In

cover image Journal of Computer and System Sciences

Journal of Computer and System Sciences Volume 10, Issue 1

February, 1975

164 pages

ISSN:0022-0000

Issue’s Table of Contents

Copyright © Academic Press, Inc. © 1975.

Publisher

Academic Press, Inc.

United States

Publication History

Published: 01 February 1975

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

154
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 08 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Guillaume MPogodalla STourneur V(2024)ACGtk: A Toolkit for Developing and Running Abstract Categorial GrammarsFunctional and Logic Programming10.1007/978-981-97-2300-3_2(13-30)Online publication date: 15-May-2024
https://dl.acm.org/doi/10.1007/978-981-97-2300-3_2
Wang YWu J(2021)The Code Generation Method Based on Gated Attention and InterAction-LSTMWeb Information Systems and Applications10.1007/978-3-030-87571-8_47(544-555)Online publication date: 24-Sep-2021
https://dl.acm.org/doi/10.1007/978-3-030-87571-8_47
Miyazaki TMinamide Y(2021)Context-Free Grammars with LookaheadLanguage and Automata Theory and Applications10.1007/978-3-030-68195-1_16(213-225)Online publication date: 1-Mar-2021
https://dl.acm.org/doi/10.1007/978-3-030-68195-1_16
Jain PBhavsar RShaik KKumar APawar BDarbari HBhavsar V(2020)Virtual reality: an aid as cognitive learning environment—a case study of Hindi languageVirtual Reality10.1007/s10055-020-00426-w24:4(771-781)Online publication date: 1-Dec-2020
https://dl.acm.org/doi/10.1007/s10055-020-00426-w
Maletti AStier K(2020)On Tree Substitution GrammarsDevelopments in Language Theory10.1007/978-3-030-48516-0_18(237-250)Online publication date: 11-May-2020
https://dl.acm.org/doi/10.1007/978-3-030-48516-0_18
Okhotin ASorokin A(2020)Cyclic Shift on Multi-component GrammarsLanguage and Automata Theory and Applications10.1007/978-3-030-40608-0_20(287-299)Online publication date: 4-Mar-2020
https://dl.acm.org/doi/10.1007/978-3-030-40608-0_20
Ben Khelil COthmane Zribi CDuchier DParmentier Y(2018)Parsing Arabic with a Semi-automatically Generated TAG: Dealing with Linguistic PhenomenaComputational Linguistics and Intelligent Text Processing10.1007/978-3-031-23804-8_17(209-220)Online publication date: 18-Mar-2018
https://dl.acm.org/doi/10.1007/978-3-031-23804-8_17
Constant MEryiğit GMonti Jvan der Plas LRamisch CRosner MTodirascu A(2017)Multiword expression processingComputational Linguistics10.1162/COLI_a_0030243:4(837-892)Online publication date: 1-Dec-2017
https://dl.acm.org/doi/10.1162/COLI_a_00302
Zhang QSu Z(2017)Context-sensitive data-dependence analysis via linear conjunctive language reachabilityACM SIGPLAN Notices10.1145/3093333.300984852:1(344-358)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1145/3093333.3009848
Zhang QSu ZCastagna GGordon A(2017)Context-sensitive data-dependence analysis via linear conjunctive language reachabilityProceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages10.1145/3009837.3009848(344-358)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1145/3009837.3009848
Show More Cited By

View Options

View options

Figures

Tables

Media

View Issue’s Table of Contents