Results 11 to 20 of about 17,181 (262)

Towards a Context-Free Machine Universal Grammar (CF-MUG) in Natural Language Processing

IEEE Access, 2020
In natural language processing, semantic document exchange ensures unambiguity and shares the same meaning for documents sender and receiver cross different natural languages (e.g., English to Chinese), this difference makes the translation between ...
Quanyi Hu, Jie Yang, Peng Qin, Simon Fong   +3 more
doaj   +3 more sources

RNGSGLR: Generalization of the Context-Aware Scanning Architecture for All Character-Level Context-Free Languages

Mathematics, 2022
The limitations of traditional parsing architecture are well known. Even when paired with parsing methods that accept all context-free grammars (CFGs), the resulting combination for any given CFG accepts only a limited subset of corresponding character ...
Žiga Leber, Matej Črepinšek, Marjan Mernik, Tomaž Kosar   +3 more
doaj   +1 more source

LR Parsing for LCFRS

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

A Context-Free Grammar of One Rhythmic Model of Russian Verse

Моделирование и анализ информационных систем, 2012
A formal model of the Russian verse based on the accentual segmentation of its structure is offered and considered. A context-free grammar (in N. Chomsky’s sense) which generates correct rhythmic forms of the presented model is constructed.
V. N. Boykov
doaj   +3 more sources

Context-free grammar forms

Journal of Computer and System Sciences, 1974
In an attempt to provide a unified theory of grammars, a model is introduced which has two components. The first is a ''grammar form,'' which provides the general structure of the productions in the grammars to be defined. The second is an ''interpretation'', which yields a specific grammar.
Cremers, Armin, Ginsburg, Seymour
openaire   +1 more source

Synthesis of nested loop exercises for practice in introductory programming

Egyptian Informatics Journal, 2023
Novice programmers struggle to comprehend specific programming constructs such as arrays, recursion, and loops. One way to address this challenge is to provide practice problems for students in these topics that are considered difficult to comprehend ...
Chinedu Wilfred Okonkwo, Abejide Ade-Ibijola   +1 more
doaj   +1 more source

Spurious Ambiguity and Focalization [PDF]

Computational Linguistics, 2018
Spurious ambiguity is the phenomenon whereby distinct derivations in grammar may assign the same structural reading, resulting in redundancy in the parse search space and inefficiency in parsing.
Glyn Morrill, Oriol Valentín
doaj   +1 more source

Absence of phase transition in random language model

Physical Review Research, 2022
The random language model, proposed as a simple model of human languages, is defined by the averaged model of a probabilistic context-free grammar. This grammar expresses the process of sentence generation as a tree graph with nodes having symbols as ...
Kai Nakaishi, Koji Hukushima
doaj   +1 more source

Binary Context-Free Grammars [PDF]

Symmetry, 2020
A binary grammar is a relational grammar with two nonterminal alphabets, two terminal alphabets, a set of pairs of productions and the pair of the initial nonterminals that generates the binary relation, i.e., the set of pairs of strings over the terminal alphabets.
Sherzod Turaev, Rawad Abdulghafor, Ali Amer Alwan, Ali Abd Almisreb, Yonis Gulzar   +4 more
openaire   +1 more source

Equivalent Transformations and Regularization in Context-Free Grammars

Cybernetics and Information Technologies, 2015
Regularization of translational context-free grammar via equivalent transformations is a mandatory step in developing a reliable processor of a formal language defined by this grammar.
Fedorchenko Ludmila, Baranov Sergey
doaj   +1 more source