Journal ArticleDOI
Constraints on Structural Descriptions: Local Transformations
Aravind K. Joshi,Leon S. Levy +1 more
Reads0
Chats0
TLDR
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.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
Citations
More filters
Book
Tree automata
TL;DR: A context-free grammar over the terminal alphabet generating the Dyck language of well-bracketed strings and a product construction for nondeterministic bu-ta A 1 and A 2, to discuss whether there are simpler means of specifying them formally.
Book ChapterDOI
Phrase Structure Grammar
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.
Proceedings ArticleDOI
Some computational properties of tree adjoining grammers
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.
Proceedings ArticleDOI
Some computational properties of tree adjoining grammars
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.
References
More filters
Journal ArticleDOI
Tree acceptors and some of their applications
TL;DR: It is shown here that the weak secondorder theory of two successors is decidable, thus settling a problem of Buchi, and this result is applied to obtain positive solutions to the decision problems for various other theories, e.g., the weaksecond-order theories of order types built up from the finite types.
Proceedings ArticleDOI
Tree-oriented proofs of some theorems on context-free and indexed languages
TL;DR: The yield theorem is studied: the yield of a recognizable set of trees (dendrolanguage) is an indexed language and some closure properties of CF sets of trees are proved.