Reduplication and the grammars of Australian languages
A comparative survey of reduplication in Australian languages
... nominal reduplication (note that some languages exhibit patterns with only one or two occurrences overall, not included ...Nominal reduplication is overwhelmingly either initial or ...Within ...
244
Regular languages extended with reduplication: formal models, proofs and illustrations
... any languages recognized by a 2-way finite state automaton are in the regular ...copy languages, there is no direct help from looking at the closely related 2-way finite state ...aggressive ...
83
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
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
... grammar of our Language ensures the successful transmission 7 of language it- self and universality guarantees the language implementation in very different contexts. Thus, our work stresses that of Nowak and Krakauer ...
38
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
CiteSeerX — Context-Free Grammars and Languages
... A grammar is unambiguous if, at each leftmost-derivation step, there is only one rule that can lead to a derivation of the desired string... 3.5 Leftmost Derivations and Ambiguity[r] ...
23
Practical Dynamic Grammars for Dynamic Languages
... formal grammars using a dedicated specification language which is then transformed into executable form by code ...Free Grammars (CFGs), such as LL(k), LR(k), or ...
5
Pure 2D picture grammars and languages
... array grammars (SAG), has been made in [6] to overcome such a disadvantage of not main- taining proportion but again this model SAG has two phases of derivation with the first phase involving both column and row ...
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
5 Context-Free Languages and Grammars
... 〈 adjective 〉 → friendly | furious | moist | green | severed | timey-wimey | little | · · · 〈 verb 〉 → ate | found | wrote | killed | mangled | saved | invented | broke | · · · 〈 adverb 〉 → squarely | incompetently | ...
21
1 Grammars and Context-Free Languages
... most grammars we deal with, there exists exactly one way to generate any given word in the language of the ...some grammars wherein the same word can be generated in more than one ...
11
Machine Learning Comprehension Grammars for Ten Languages
... In contrast, and somewhat para- doxically, even for a corpus of only 400 sentences, the standard mean learning curves, theoretically based on random sampling of sentences are comp[r] ...
22
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
Introduction Pak-Pak Boang is one of the languages which consist of variety reduplication
... the reduplication of Pak–Pak Boang language which consists of many reduplication, the speakers of the language are situated in the Rundeng, Subulussalam, Aceh ...of reduplication and the forms ...
13
Polynomial Pregroup Grammars parse Context Sensitive Languages
... to grammars for language fragments involving relative pronouns and coordination, subject and object control, agreement of features among ...these grammars have been designed for a complete linear de- ...
34
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
Morphological Doubling theory to two Bantu Languages Reduplication: A comparative perspective of Kinyarwanda and Swahili
... Bantu languages [without excluding ...African languages, Bantu languages in ...four languages of administration, the main language for this purpose being French; and (4) Uganda, where the main ...
10
Self Training PCFG Grammars with Latent Annotations Across Languages
... +R+U N/A 84.15 Table 2: Effects of rare word handling (+R) and Chinese unknown handling (+U) on the test set. sufficient amount of labeled training data. Shar- ing statistics of the rare words during training re- sults ...
10
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