Results 31 to 40 of about 17,181 (262)
Data-oriented parsing with discontinuous constituents and function tags
Journal of Language Modelling, 2016 Statistical parsers are e ective but are typically limited to producing projective dependencies or constituents. On the other hand, linguisti- cally rich parsers recognize non-local relations and analyze both form and function phenomena but rely on ...
Andreas van Cranenburgh +2 more
doaj +1 more source
On Restricted Context-Free Grammars
Journal of Computer and System Sciences, 2010 The contribution investigates the generative power of several derivation-restricted context-free grammars. Many derivation restriction mechanisms for context-free grammars have already been studied in the literature, and the current contribution investigates a restriction on the non-terminals that allows/disallows the application of a production ...
Dassow, J., Masopust, T. (Tomáš)
openaire +4 more sources
Weighted omega-Restricted One Counter Automata [PDF]
Logical Methods in Computer Science, 2018 Let $S$ be a complete star-omega semiring and $\Sigma$ be an alphabet. For a weighted $\omega$-restricted one-counter automaton $\mathcal{C}$ with set of states $\{1, \dots, n\}$, $n \geq 1$, we show that there exists a mixed algebraic system over a ...
Manfred Droste, Werner Kuich
doaj +1 more source
Lexicalized context-free grammars [PDF]
Proceedings of the 31st annual meeting on Association for Computational Linguistics -, 1993 Lexicalized context-free grammar(LCFG) is an attractive compromise between the parsing efficiency of context-free grammar (CFG) and the elegance and lexical sensitivity of lexicalized tree adjoining grammar (LTAG). LCFG is a restricted form of LTAG that can only generate context-free languages and can be parsed in cubic time.
Yves Schabes, Richard C. Waters
openaire +1 more source
Multiplicative-Additive Focusing for Parsing as Deduction [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 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
Computer-assisted i‘raab of Arabic sentences for teaching grammar to students
Journal of King Saud University: Computer and Information Sciences, 2022 The end-case analysis of Arabic sentences is one of the keys to their meaning. This process is called i‘raab, a daunting task for the students. The outcome of the analysis is twofold: (a) placing a proper diacritical marking on the end-cases of ...
Zarah M. Mannaa +2 more
doaj +1 more source
A Password Cracking Method Based on Name Initials Shorthand Structure [PDF]
Jisuanji gongcheng, 2017 User password guess research is one of the important parts of password security research.According to the relationship between user’s personal information and user password,analyzes the structural characteristics of the user’s personal information ...
LUO Min,ZHANG Yang
doaj +1 more source
Syntactic Pattern Recognition for the Prediction of L-Type Pseudoknots in RNA
Applied Sciences, 2023 The observation and analysis of RNA molecules have proved crucial for the understanding of various processes in nature. Scientists have mined knowledge and drawn conclusions using experimental methods for decades.
Christos Koroulis +4 more
doaj +1 more source
Molecular Oncology, EarlyView.Glioma cells mainly express the endothelin receptor EDNRB, while EDNRA is restricted to a perivascular tumor subpopulation. Endothelin signaling reduces glioma cell proliferation while promoting migration and a proneural‐to‐mesenchymal transition associated with poor prognosis. This pathway activates Ca2+, K+, ERK, and STAT3 signalings and is regulated
Donovan Pineau +36 more
wiley +1 more source
MINIMIZATION OF CONTEXT-FREE GRAMMARS
Prikladnaya Diskretnaya Matematika, 2019 Summary: This paper solves the problem of transforming the initial context-free grammar (CF-grammar) without excess characters into equivalent CF-grammar with less complexity. To solve this problem, the following relation on the set of a CF-grammar non-terminals is introduced: \(E = \{(X,Y): (X=Y) \vee (X\to \alpha\Leftrightarrow Y\to \beta \wedge\vert
Ryazanov, Yu. D., Nazina, S. V.
openaire +2 more sources