Results 31 to 40 of about 859,079 (303)
On the Order Type of Scattered Context-Free Orderings [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 We show that if a context-free grammar generates a language whose lexicographic ordering is well-ordered of type less than ω^2, then its order type is effectively computable.
Kitti Gelle, Szabolcs Iván
doaj +1 more source
Algorithms, 2016 LR parsing is a popular parsing strategy for variants of Context-Free Grammar (CFG). It has also been used for mildly context-sensitive formalisms, such as Tree-Adjoining Grammar.
Laura Kallmeyer, Wolfgang Maier
doaj +1 more source
Do Changes in Language Context Affect Visual Memory in Bilinguals?
Frontiers in Human Neuroscience, 2019 Language is often present when people are encoding visual memories. For bilinguals, this language context can have different forms (i.e., Language A, Language B, or both Language A and B), and can change over the course of events.
Scott R. Schroeder
doaj +1 more source
Fuzzy Testing of Language Interpreter Based on Improved PCFG [PDF]
Jisuanji gongcheng, 2019 In order to construct samples that conform to language norms in fuzzy testing of language interpreter,and get abnormal test results as far as possible to find vulnerabilities,the improved Probabilistic Context Free Grammar(PCFG) model is used to control ...
LIU Zhihao, SUN Xiaoshan, ZHANG Yang
doaj +1 more source
On commutative context-free languages
Journal of Computer and System Sciences, 1987 Let \(\Sigma =\{a_ 1,a_ 2,...,a_ n\}\) be an alphabet and let \(L\subset \Sigma^*\) be the commutative image of \(FP^*\) where F and P are finite subsets of \(\Sigma^*\). If, for any permutation \(\sigma\) of \(\{\) 1,2,...,n\(\}\), \(L\cap a^*_{\sigma (1)}...a^*_{\sigma (n)}\) is context-free, then L is context-free.
Joffroy Beauquier +2 more
openaire +2 more sources
Learning Context-free Languages with Nondeterministic Stack RNNs [PDF]
Conference on Computational Natural Language Learning, 2020 We present a differentiable stack data structure that simultaneously and tractably encodes an exponential number of stack configurations, based on Lang’s algorithm for simulating nondeterministic pushdown automata.
Brian DuSell, David Chiang
semanticscholar +1 more source
Building Greibach Normal Form Grammars Using Genetic Algorithms
Signals, 2022 Grammatical inference of context-free grammars using positive and negative language examples is among the most challenging task in modern artificial and natural language technology.
Nikolaos Anastasopoulos +1 more
doaj +1 more source
Bracketed context-free languages
Journal of Computer and System Sciences, 1967 AbstractA bracketed grammar is a context-free grammar in which indexed brackets are inserted around the right-hand sides of the rules. The language generated by a bracketed grammar is a bracketed language. An algebraic condition is given for one bracketed language to be a subset of another. The intersection and the difference of two bracketed languages
Seymour Ginsburg, Michael A. Harrison
openaire +1 more source
A Quasi-Polynomial-Time Algorithm for Sampling Words from a Context-Free Language
Information and Computation, 1997 A quasi-polynomial-time algorithm is presented for sampling almost uniformly at random from then-slice of the languageL(G) generated by an arbitrary context-free grammarG.
Vivek Gore +4 more
semanticscholar +1 more source
On the Size Complexity of Non-Returning Context-Free PC Grammar Systems [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 Improving the previously known best bound, we show that any recursively enumerable language can be generated with a non-returning parallel communicating (PC) grammar system having six context-free components.
Erzsébet Csuhaj-Varjú, György Vaszil
doaj +1 more source