Languages and Grammars
5 Context-Free Languages and Grammars
... regular languages; these are precisely the languages that can be constructed from individual strings by union, concatenation, and unbounded ...context-free grammars are recursive generalizations of ...
21
Indexed Languages and Unification Grammars
... ences. We here define a class of unification grammars that exactly describe the class of indexed languages. 1 Introduction T h e o c c u r r e n c e o f p u re ly s y n ta c tic a l cro s s-se ria l d e p e ...
16
Pragmatic Languages with Universal Grammars
... When considering real life time-constraints, a language with structure based on different orderings of the enumerations turns out to be more useful for learn- ing purposes rather than for meaning inference. Nevertheless, ...
38
A Note on Hack s Conjecture, Parikh Images of Matrix Languages and Multiset Grammars
... Abstract It is shown that Hack’s Conjecture on Petri nets implies that for every language generated by a matrix grammar (without appearance checking), there is a non-erasing matrix grammar generating a lan- guage of the ...
6
Automata for DNA Splicing Languages with Palindromic and Non-Palindromic Restriction Enzymes using Grammars
... splicing languages from DNA splicing systems with palindromic and non-palindromic restriction enzymes have been done ...and grammars are applied in DNA splicing systems to simplify the assembly in ...
14
The emptiness of intersection problem for languages of k-valued categorial grammars (classical and Lambek) is undecidable
... k-valued grammars, for any k 1 in particular when re- stricted to rigid grammars, that is for k = 1 ...context-free languages [4]; it relies on a specific class introduced here as ...
13
Automata, languages, and grammars
... Giving a Turing machine multiple heads, multiple tapes, a two-dimensional tape, a random-access memory, and so on doesn’t increase its computational power. Each of these new machines can be simulated by a Turing machine, ...
29
Parsing Minimalist Languages with Interpreted Regular Tree Grammars
... Figure 7 shows the grammars described above. 4 We don’t have a linguistic characterization of the “?”-node, which stands for the intersection be- tween the two higher nodes. These would be well- nested MCFGs that ...
10
Copying in Natural Languages, Context Freeness, and Queue Grammars
... To allow such finite copying constructions to be taken into account in formal modeling, it is necessary to recognize t h a t natural languages cannot be realistically r[r] ...
5
Modeling Graph Languages with Grammars Extracted via Tree Decompositions
... We are primarily interested in languages of simple directed graphs, hypergraphs where each edge is either binary or, for vertex la- bels, unary. In this case, we can indicate vi- sually the ordering on a binary ...
9
Modeling Graph Languages with Grammars Extracted via Tree Decompositions
... for representing natural language semantics, but there is little work in actually defining grammars for doing so. We have introduced a simple framework for automatically extract- ing HRGs, based upon first ...
9
Modeling Graph Languages with Grammars Extracted via Tree Decompositions
... Graph grammars are an appealing formalism for modeling the kinds of structures required for representing natural language semantics, but there is little work in actually defining grammars for doing ...
10
Adaptive star grammars and their languages
... star grammars, and study their basic ...graph languages of this type cannot be specified by graph schemas or similar mechanisms [ 14 ...graph languages is the natural realm of graph ...graph ...
20
Practical Dynamic Grammars for Dynamic Languages
... While the parse is always unambiguous (because of the or- dered choice), the result of the above expression depends on the order in which the two languages have been composed. In previous work [13] we argued that ...
5
Pure 2D picture grammars and languages
... Pure grammars; Two-dimensional grammars; Picture languages; Rectangular arrays; Hexagonal arrays 1 Introduction Syntactic techniques of generation of digital picture arrays have become es- tablished ...
21
Reference grammars for speakers of minority languages
... minority languages, as well as linguists – and how it is possible to meet such di fferent users’ needs, our key proposition being to produce a multilevel grammar, with the first and basic level aimed at ...
24
1 Grammars and Context-Free Languages
... regular languages, we introduced the notion of a regular ...of grammars, which essentially provide a set of rules that we can follow to produce words that belong to a certain ...use grammars to ...
11
Epsilon Free Grammars and Lexicalized Grammars that Generate the Class of the Mildly Context Sensitive Languages
... spine grammars are tree gen- erating formalisms, they are closely ...spine grammars are weakly equivalent, the tree languages generated by TAGs are properly included in those by spine ...spine ...
8
Polynomial Pregroup Grammars parse Context Sensitive Languages
... free languages or the standard formal mildly context sensitive languages it is of degree 1, for Dutch or Swiss-German subordinate clauses it is of degree ...
34
Self Training PCFG Grammars with Latent Annotations Across Languages
... The second question is important because la- beled training data is often quite limited, espe- cially for less well investigated languages, while unlabeled data is ubiquitous. Early investigations on self-training ...
10