Results 11 to 20 of about 15,427 (266)
Using LFG a-structure to determine the subcategorization frames of Setswana verbs
The verb lexicon, and more specifically verb subcategorization frames, forms an integral part of any computational grammar. In building a Lexical Functional Grammar (LFG) computational grammar for Setswana, it is therefore necessary to determine, in a ...
Ansu Berg +2 more
doaj +1 more source
French de and en as expressions of the genitive case: a unified analysis within LFG and computational implementation in XLE [PDF]
The French clitic pro-form en represents a wide range of heterogeneous constituents: de-PP complements and adjuncts, partitive objects, and prepositionless objects of cardinals.
Leonel Figueiredo de Alencar +1 more
doaj +1 more source
Clause structure, pro-drop and control in Wolof
This paper provides a formal description of the syntactic analysis of core constructions of Wolof clausal/verbal morphosyntax within the Lexical-Functional Grammar formalism. This includes the basic phrase structure, pro-drop, and control relations. The
Cheikh Bamba Dione
doaj +1 more source
Computing Convolution on Grammar-Compressed Text [PDF]
The convolution between a text string $S$ of length $N$ and a pattern string $P$ of length $m$ can be computed in $O(N \log m)$ time by FFT. It is known that various types of approximate string matching problems are reducible to convolution. In this paper, we assume that the input text string is given in a compressed form, as a \emph{straight-line ...
Toshiya Tanaka +4 more
openaire +2 more sources
Applications of A Hyper–Graph Grammar System in Adaptive Finite–Element Computations
This paper describes application of a hyper-graph grammar system for modeling a three-dimensional adaptive finite element method. The hyper-graph grammar approach allows obtaining a linear computational cost of adaptive mesh transformations and ...
Gurgul Piotr +3 more
doaj +1 more source
Graph Grammar Based Petri Net Controlled Direct Solver Algorithm
In this paper we present the Petri net setting the optimal order of elimination for directsolver working with hp refined finite finite element meshes. The computational mesh is representedby a graph, with graph vertices corresponding to finite element ...
Arkadiusz Szymczak +2 more
doaj +1 more source
Computation graphs for actor grammars
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dirk Janssens +2 more
openaire +1 more source
Computational aspects of M-grammars [PDF]
In this paper M-grammars that are used in the Rosetta translation system will be looked at as the specification of attribute grammars. We will show that the attribute evaluation order is such that instead of the special-purpose parsing and generation algorithms introduced for M-grammars in Appelo et al.(1987), also Earley-like context-free parsing and ...
openaire +2 more sources
On the Distributional Representation of Ragas: Experiments with Allied Raga Pairs
Raga grammar provides a theoretical framework that supports creativity and flexibility in improvisation while carefully maintaining the distinctiveness of each raga in the ears of a listener. A computational model for raga grammar can serve as a powerful
Kaustuv Kanti Ganguli, Preeti Rao
doaj +1 more source
Parsing Chinese with Combinatory Categorial Grammar: A Linguistic and Computational Study
Parsing Chinese language with CCG is very difficult because the architecture and assumptions of CCG do not fit well with facts from Chinese. Based on the concept of “realization” proposed by Zhu Dexi (1920–1992), this study sheds light on the discrepancy
Haixia Man +3 more
doaj +1 more source

