Results 161 to 170 of about 298,732 (229)
Some of the next articles are maybe not open access.

Structural Parallelism in Surah 'Abasa: A Study in Grammatical and Semantic Balances

Journal of Science and Knowledge Horizons
This research presents an analytical study of syntactic parallelism in Surah 'Abasa, focusing on the grammatical and semantic balances that enhance meaning and reveal the Qur'an's rhetorical miracle.
Zakaria Tounani
semanticscholar   +1 more source

Recognition of Parallelism Sentence Based on Recurrent Neural Network

2018 IEEE 9th International Conference on Software Engineering and Service Science (ICSESS), 2018
Parallelism sentence is a group of sentence pairs with similar structure, same tone and similar semantics. Generally speaking, it consists of two or more sentences.
Yange Dai   +4 more
semanticscholar   +1 more source

Enhancing job application writing: A comparative case study of AI and human feedback on grammar and mechanics

Journal of English Language Teaching Innovations and Materials (Jeltim)
Submission of well-structured job application letters is an essential aspect of business and government recruitment processes. However, due to difficulties with grammar and mechanics, many students, fresh graduates included, fail to produce high-quality ...
Lutfi Arief Noerjaman   +2 more
semanticscholar   +1 more source

Parallel ordered attribute grammars

Proceedings of the 1992 International Conference on Computer Languages, 2003
Ordered attributed grammars (OAGs) are extended for use on parallel computers. A partition of the attributes of a tree leads to parallel evaluation if each partition is taken care of by a separate process. Visit sequences for parallel ordered attribute grammars (POAGs) are constructed, and it is shown that the POAG class is of the same power as the OAG
openaire   +2 more sources

The Grammar of Poetry: Analyzing the Language of Literature

International journal of research and innovation in social science
Poetry is a literary genre that uses a unique way of writing an expressive composition and manipulating language structure by applying various stylistic features to evoke readers' emotions and feelings.
Godwin Q. Sacayan   +5 more
semanticscholar   +1 more source

Parallel Composition of Graph Grammars

Applied Categorical Structures, 1999
The specification of complex systems is usually done by the ‘divide and conquer’ idea: the system is divided into smaller, less complex components that are developed separately and then merged in some way to form the specification of the whole system.
openaire   +2 more sources

Parallel communicating grammar systems with negotiation

Fundamenta Informaticae, 1996
In a parallel communicating grammar system, several grammars work together, synchronously, on their own sentential forms, and communicate on request. No restriction is imposed usually about the communicated strings. We consider here two types of restrictions, as models of the negotiation process in multi-agent systems: (1) conditions formulated on the ...
Lech Polkowski   +2 more
openaire   +2 more sources

ON METALINEAR PARALLEL COMMUNICATING GRAMMAR SYSTEMS

International Journal of Foundations of Computer Science, 2007
A generalization of centralized and returning parallel communicating grammar systems with linear components (linear CPC grammar systems) is studied. It is known that linear CPC grammar systems are more powerful than regular CPC grammar systems and that CPC grammar systems with context-free components are more powerful than linear CPC grammar systems ...
Bettina Sunckel, Andreas Malcher
openaire   +2 more sources

On parallel evaluation of ordered attribute grammars

Journal of Computer Science and Technology, 1991
In this paper, a parallel algorithm is presented for the evaluation of ordered attribute grammars. The parallelism is achieved by constructing the so-called parallel visit sequences and accordingly augmenting the ordinary evaluation driver as well.
Daxing Ye, Shunqian Wang
openaire   +2 more sources

Parallel stochastic grammar induction

Proceedings of International Conference on Neural Networks (ICNN'97), 2002
This paper examines the problem of stochastic grammar induction and gives a formal analysis of observed limitations of a classical algorithm. It then describes a parallel approach to the problem which avoids these limitations. Finally, a proof is presented which shows that a popular training algorithm already in use for recurrent connectionist networks
openaire   +2 more sources

Home - About - Disclaimer - Privacy