Journal Article10.1137/0206020
Constraints on Structural Descriptions: Local Transformations
Aravind K. Joshi,Leon S. Levy +1 more
26
TL;DR: It is shown that the Peters-Ritchie result can be generalized to local transformations and these rules, called "local transformations" not only make precise an informal and briefly discussed notion of Chomsky, but also, generalize it in an appropriate manner.
read more
Abstract: It is very often more convenient and more meaningful to specify a set of structural descriptions analytically rather than generatively, i.e., by specifying a set of constraints each structured description in the set has to satisfy. Peters and Ritchie [7] have shown that if context-sensitive rules are used only for “analysis” then the string language of the set of trees is still context-free. In this paper, we have generalized this result by considering context-free rules constrained by Boolean combinations of proper analysis predicates and domination predicates. These rules, called "local transformations" not only make precise an informal and briefly discussed notion of Chomsky [2], but also, generalize it in an appropriate manner. It is shown that the Peters-Ritchie result can be generalized to local transformations. Linguistic relevance of this result has been also briefly discussed. Results in this paper are relevant to the following situation: Patterns of a class, say A, may be difficult to characteri...
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Phrase Structure Grammar
Gerald Gazdar
- 01 Jan 1982
TL;DR: Transformational grammars for natural languages, as currently envisaged, deploy a large number of devices: complex symbols, base rules, rule schemata, lexical insertion rules, Lexical redundancy rules, movement rules, coindexing procedures, binding conventions, local and nonlocal filters, case marking conventions, feature percolation, constraints on movement, and so on.
290
•Book
A descriptive approach to language-theoretic complexity
Philip H. Miller,Geoffrey K. Pullum +1 more
- 01 Jan 1998
TL;DR: This book presents a natural and quite general means of expressing constraints on the structure of trees and shows that the languages that can be specified by systems of such constraints are exactly those computable by a particular standard class of abstract machines.
139
Some computational properties of tree adjoining grammers
K. Vijay-Shankar,Aravind K. Jushi +1 more
- 08 Jul 1985
TL;DR: Some new results for TAG's are described, especially in the following areas: parsing complexity of TAG's, some closure results forTAG's, and the relationship to Head grammars.
Talking about trees
Patrick Blackburn,Claire Gardent,Wilfried Meyer-Viol +2 more
- 21 Apr 1993
TL;DR: The motivation for introducing these languages is to provide tools for formalising grammatical frameworks perspicuously, and the paper illustrates this by showing how the leading ideas of GPSG can be captured in LT (LF).
74
Skeletal structural descriptions
Leon S. Levy,Aravind K. Joshi +1 more
TL;DR: Besides clarifying the role of skeletons in mathematical linguistics, it is shown that skeletal automata provide a characterization of local sets, remedying a “defect” in the usual tree automata theory.
63
References
Generalized finite automata theory with an application to a decision problem of second-order logic
TL;DR: The standard closure theorems are proved for the class of sets “recognizable” by finite algebras, and a generalization of Kleene's regularity theory is presented.
841
Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
TL;DR: The recognizable sets of value trees (pseudoterms) are shown to be exactly projections of sets of derivation trees of (extended) context-free grammars.
308
•Book
Currents in the theory of computing
Alfred V. Aho,Ronald V. Book +1 more
- 01 Jan 1973
TL;DR: Reading is a need and a hobby at once and this condition is the on that will make you feel that you must read.
173
Related Papers (5)
james w.thatcher
- 01 Jan 1974