Results 11 to 20 of about 1,304 (204)
m-Linear Context-Free Rewriting Systems as Abstract Categorial Grammars
, 2003 This paper presents a coding of m-linear context-free rewriting systems (m-LCFRS) into abstract categorial grammars (ACG). Thus, it shows the latter formalism, which offers a powerful grammatical framework based on a small set of computational primitives, is able to reach some interesting classes of languages w.r.t. natural language modeling.
de Groote, Philippe, Pogodalla, Sylvain
openaire +2 more sources
Business Rules Definition for Decision Support System Using Matrix Grammar [PDF]
Acta Informatica Pragensia, 2016 This paper deals with formalization of business rules by formal grammars. In our work we focus on methods for high frequency data processing. We process data by using complex event platforms (CEP) which allow to process high volume of data in nearly real
Eva Zámečníková, Jitka Kreslíková
doaj +1 more source
A New Class of Graph Grammars and Modelling of Certain Biological Structures
Symmetry, 2023 Graph grammars can be used to model the development of diverse graph families. Since their creation in the late 1960s, graph grammars have found usage in a variety of fields, such as the design of sophisticated computer systems and electronic circuits ...
Jayakrishna Vijayakumar +2 more
semanticscholar +1 more source
Lexicalization of Probabilistic Linear Context-free Rewriting Systems
International Workshop/Conference on Parsing Technologies, 2020 In the field of constituent parsing, probabilistic grammar formalisms have been studied to model the syntactic structure of natural language. More recently, approaches utilizing neural models gained lots of traction in this field, as they achieved ...
Richard Mörbitz, Thomas Ruprecht
semanticscholar +1 more source
Tractable Lexical-Functional Grammar
Computational Linguistics, 2020 The formalism for Lexical-Functional Grammar (LFG) was introduced in the 1980s as one of the first constraint-based grammatical formalisms for natural language.
Jürgen Wedekind, Ronald M. Kaplan
doaj +1 more source
Parsing Linear Context-Free Rewriting Systems with Fast Matrix Multiplication [PDF]
International Conference on Computational Logic, 2015 We describe a recognition algorithm for a subset of binary linear context-free rewriting systems (LCFRS) with running time O(nωd) where M(m) = O(mω) is the running time for m × m matrix multiplication and d is the “contact rank” of the LCFRS—the maximal ...
Shay B. Cohen, D. Gildea
semanticscholar +1 more source
Finite State Methods in Morphological Analysis of Runyakitara Verbs
Nordic Journal of African Studies, 2010 Previously, there has been a lack for an automatic analyser and generator for the word forms of Runyakitara. In this paper, we present a computational model for grammatical Runyakitara verbs.
Fridah Katushemererwe, Thomas Hanneforth
doaj +1 more source
Reorganization in Multi-Agent Architectures: An Active Graph Grammar Approach
Business Systems Research, 2013 Background: Organizational architecture is a holistic approach to design of humane organizations and studies an organization from five perspectives: structure, culture, processes, strategy and individuals.
Schatten Markus
doaj +1 more source
Arthritis Care &Research, Accepted Article.Objective Lupus nephritis (LN) management remains challenging, and novel noninvasive biomarkers are needed. This study quantified serum soluble mediators in the Accelerating Medicines Partnership (AMP) LN cohort to identify biomarkers of histological features and treatment response.
Andrea Fava +26 more
wiley +1 more source
Antipode, EarlyView., 2023 Abstract The perceptions and representations of whiteness around motherhood, family, and black sexuality reproduce the logic of what Hortense Spillers calls “captive flesh”, controlling understandings about femininity, motherhood, and gender. This debate is guided by the politics of the racial neoliberal agenda that works to control the urban ...
Danielle Pereira de Araújo
wiley +1 more source