Context free grammars and languages
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
Context-Free Grammars and Translation of Human Languages
... “Automatically Improved Category Labels for SCFG-Based Statistical?. Machine Translation”..[r] ...
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
On Müller context-free grammars
... 9. Conclusion, open questions We have defined Müller context-free grammars (MCFGs) generating languages of countable words, called MCFLs. The class of MCFLs is clearly closed under ...
16
Binarization of Synchronous Context Free Grammars
... 10 68 156 9 101 307 8 157,042 156,747 two languages, which we call CKY-min, with the optimal strategy. For synchronous parsing, for 99.77% of the rules, the CKY-min method found an optimal strategy. When ...
38
Probabilistic Context Free Grammars for Phonology
... Evaluation on a syllabification task shows a small improvement in word accuracy rate compared to other state-of-the-art systems for German. Addi- tionally, we presented an extensive qualitative eval- uation of German and ...
11
Synchronous Context Free Tree Grammars
... to context-free grammars, and weaker models of finite-state ...a context-free gram- mar inducing the intersection of two languages, one induced by a given ...
9
Synchronous Context-Free Tree Grammars
... to context-free grammars, and weaker models of finite-state ...a context-free gram- mar inducing the intersection of two languages, one induced by a given ...
9
Conservative Ambiguity Detection in Context-Free Grammars
... formal languages, ambiguity detection in context-free grammars did not receive much practical ...where context-free grammars are ...
24
Static Watson-Crick Context-Free Grammars
... Watson-Crick grammars which are classified into three classes: Wat- son-Crick regular grammars, Watson-Crick linear grammars and Watson-Crick context-free ...Watson-Crick ...
12
Restrictions on Monadic Context Free Tree Grammars
... The context-free tree grammars (CFTGs) were in- troduced by ...of context-free grammars (CFGs) from strings to rooted, ordered, labeled ...natural languages, many kinds of ...
7
Are Very Large Context Free Grammars Tractable?
... {Pierre.Boullier,Benoit.Sagot}@inria.fr Abstract In this paper, we present a method which, in practice, allows to use parsers for languages defined by very large context-free grammars (over a ...
12
Dynamic Compilation of Weighted Context Free Grammars
... ciently an interesting class of grammars repre- senting weighted regular languages and allows for dynamic modifications that are crucial in many speech recognition app[r] ...
7
Splittability of bilexical context free grammars is undecidable
... Grammar G (A[a]) might contain useless rules, that is, rules that never appear in a deriva- tion of a string of the generated language, but this is irrelevant to the development of the results in this article. We now ...
13
Parsing Beyond Context-Free Grammars: Introduction
... There are constructions in natural languages that cannot be adequately described with a context-free grammar.. Example: cross-serial dependencies in Dutch and in Swiss German.[r] ...
28
Push-down Automata and Context-free Grammars
... This chapter details the design of push-down automata (PDA) for vari- ous languages, the conversion of CFGs to PDAs, and vice versa. In par- ticular, after formally introducing push-down automata in Section 14.1, ...
26
Search-Based Ambiguity Detection in Context-Free Grammars
... Context Free Grammars (CFGs) are widely used for describing formal languages, including programming ...ambiguous grammars—those which can parse inputs in more than one ...
7
Tracking Down the Origins of Ambiguity in Context-Free Grammars
... Introduction Context-free grammars (CFGs) are widely used in various fields, like for instance programming language development, natural language processing, or bioinfor- ...of languages, but ...
15
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
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