Filters








60,112 Hits in 3.1 sec

Page 269 of Computational Linguistics Vol. 24, Issue 2 [page]

1998 Computational Linguistics  
Contextual grammars with global maximal use of selectors cannot generate all languages based on center-embedded constructions, as Chomsky linear grammars (and TAGs) do.  ...  Contextual grammars with (global or local) maximal use of selectors can generate, in a very easy way, the three basic non-context-free constructions in natural languages: reduplication, crossed dependencies  ... 

Towards Zero-Overhead Disambiguation of Deep Priority Conflicts

Luís Eduardo de Souza Amorim, Michael J. Steindorfer, Eelco Visser
2018 The Art, Science, and Engineering of Programming  
(i.e., disallowing the composition of grammar fragments of potentially different languages).  ...  However, the natural and concise way of writing a context-free grammar is often ambiguous.  ...  of the contextual symbol Exp {Exp.If} in the grammar, the tree is constructed with the sets of leftmost and rightmost tokens containing Exp.If.  ... 
doi:10.22152/programming-journal.org/2018/2/13 fatcat:iilbslbbwjdrhhtqgcagyhifui

Contextual KP System
English

Ajitha P S, Dersanambika K.S
2015 International Journal of Mathematics Trends and Technology  
In this paper, we consider contextual way of handling string objects in KP Systems.We also considered contextual KP System with Depth First Derivation and Contextual KP System with marked dervation  ...  A contextual grammar with marked derivation is a construct G = (V, A, C 1 , C 2 , ψ, Φ) Where (V, A, C 1 , ψ) is a usual contextual grammar,C 2 is a nite set of contexts over V and ψ : V * → 2 c 2 .  ...  In contextual grammars, the string xwy is derived by attaching the context (x,y) to the string w. Denition 2.1. A contextual grammar with choice is a construct.  ... 
doi:10.14445/22315373/ijmtt-v17p509 fatcat:5lpqy37tyngt7myu5qbo3nhuxm

A Best-Fit Approach to Productive Omission of Arguments

Eva H. Mok, John Bryant
2006 Proceedings of the annual meeting of the Berkeley Linguistics Society  
For a theory of grammar to accurately account for such data, the grammar must incorporate construction-specific rates of argument omission.  ...  Unfortunately, specifying such parameters in most theories of construction grammar requires enumeration of all possible argument combinations as separate constructions within the grammar.  ... 
doi:10.3765/bls.v32i1.3462 fatcat:7mk2pn6qo5a5dgqwfqxjicxpba

Contextual Hyperedge Replacement [chapter]

Frank Drewes, Berthold Hoffmann, Mark Minas
2012 Lecture Notes in Computer Science  
Contextual hyperedge-replacement grammars (contextual grammars, for short) are an extension of hyperedge replacement grammars.  ...  In this paper, we study the properties of contextual grammars.  ...  Acknowledgements We wish to thank Annegret Habel for numerous useful comments on the contents of previous versions of this paper, and Mark Minas for extensive discussions on many aspects of this work,  ... 
doi:10.1007/978-3-642-34176-2_16 fatcat:nh2tdnecgbcs7lofjcijwgqy2m

Contextual hyperedge replacement

Frank Drewes, Berthold Hoffmann
2015 Acta Informatica  
Contextual hyperedge-replacement grammars (contextual grammars, for short) are an extension of hyperedge replacement grammars.  ...  In this paper, we study the properties of contextual grammars.  ...  Acknowledgements We wish to thank Annegret Habel for numerous useful comments on the contents of previous versions of this paper, and Mark Minas for extensive discussions on many aspects of this work,  ... 
doi:10.1007/s00236-015-0223-4 fatcat:awnmisgzvfgyrbgdrtp5ae27y4

Page 1160 of Mathematical Reviews Vol. , Issue 80C [page]

1980 Mathematical Reviews  
The author investigates a special type of contextual grammar with choice introduced by the present reviewer, namely, contextual grammars with £-choice [Stud. Cerc.  ...  At the end of the paper some results concerning com textual grammars with S-choice are presented, where 5 is the family of simple contextual languages.  ... 

Page 4575 of Mathematical Reviews Vol. , Issue 98G [page]

1998 Mathematical Reviews  
The size of the constructed grammar is O(|G|*) instead of O(|G!°), which we would obtain if we transformed G into Chomsky normal form and then into Greibach normal form.”  ...  In a sense, the research on contextual grammars is a study of recursion in its pure form.  ... 

P Systems on Hexagonal Picture Languages and Applications

S. James Immanuel, S. Jayasankar, D. Gnanaraj Thomas
2022 International Symposium on Artificial Intelligence and Mathematics  
In [20] , D.G.Thomas et al developed a new method of generating hexagonal arrays based on an extension of contextual grammars called parallel contextual hexagonal array grammars.  ...  Hexagonal Kolam array grammars for generating hexagonal arrays and hexagonal patterns on triangular grids which can be treated as two-dimensional representation of three-dimensional blocks was constructed  ...  array grammar and makes use of parallel contextual double window movement along the arrow heads for generating pictures.  ... 
dblp:conf/isaim/ImmanuelJT22 fatcat:bdtt3t7v6zas7ftinjqu2ttxoa

Activation and the relation between context and grammar

Daniel García Velasco
2014 Pragmatics: Quarterly Publication of the International Pragmatics Association  
Functional Discourse Grammar is characterized as the grammatical component of a wider theory of verbal interaction and is linked to two adjacent components: The Conceptual and the Contextual Components  ...  One general property of these components is that they are not open-ended, but are said to contain only that extra-linguistic information which is relevant for the construction and interpretation of the  ...  The existence of these constructions proves that the grammar of languages provides means to introduce unidentifiable referents.  ... 
doi:10.1075/prag.24.2.06gar fatcat:ssy3mz2xvvfc7n65ieg4r363xu

On computational complexity of contextual languages

Lucian Ilie
1997 Theoretical Computer Science  
We consider the following restriction of internal contextual grammars, called local: in any derivation in a grammar, after applying a context, further contexts can be added only inside of or at most adjacent  ...  We investigate the relevance of the latter type of grammars for natural language study.  ...  An (internal) contextual grammar is a construct C = (z,A, (Sl> CI 1,. . , C&z, G I>, n>l, where C is an alphabet, A C: Z* is a finite set, called the set of axioms, Si C C*, 1 d i d n, are the sets of  ... 
doi:10.1016/s0304-3975(96)00309-x fatcat:gmvaqtv6arfrpnw5dnazph73hm

Concurrency for Graph Grammars in a Petri net shell

P Baldan
2004 Electronical Notes in Theoretical Computer Science  
A basic role is played by the study of contextual and inhibitor nets, two extensions of ordinary nets which can be seen as intermediate models between graph grammars and ordinary Petri nets.  ...  Graph grammars are a powerful model of concurrent and distributed systems which can be seen as a proper extension of Petri nets.  ...  The unfolding construction for inhibitor nets makes an essential use of the construction already developed for contextual nets.  ... 
doi:10.1016/s1571-0661(04)00192-6 fatcat:wrvdeitwenf43ltcatn5oqkp2q

A Structured Context Model for Grammar Learning

N. Chang, E. Mok
2006 The 2006 IEEE International Joint Conference on Neural Network Proceedings  
The resulting model allows existing systems for simulation-based language understanding and comprehension-driven grammar learning to represent, interpret and acquire a variety of contextually grounded  ...  construction.  ...  of contextually grounded constructions (Section VI).  ... 
doi:10.1109/ijcnn.2006.246625 dblp:conf/ijcnn/ChangM06 fatcat:md4s5nclxjhadlnonwj5b6kkwu

Page 7076 of Mathematical Reviews Vol. , Issue 99j [page]

1999 Mathematical Reviews  
In this paper, we intro- duce a generalization of bracketed contextual grammars called multibracketed contextual grammars. The generative capacity of this class is investigated.  ...  The aim of this paper is to show that these syntactical relationships and constructions are compatible with se- mantical models of graph grammars.  ... 

Page 1172 of Mathematical Reviews Vol. , Issue 84c [page]

1984 Mathematical Reviews  
In two other cases, special types of linear grammars are obtained. In this way, the greater part of the theory of contextual grammars becomes a part of the theory of linear grammars.  ...  Since context-free algebras are equivalent to context-free grammars, we obtain the description of various types of contextual grammars in terms of context-free and, particularly, linear grammars.  ... 
« Previous Showing results 1 — 15 out of 60,112 results