Results 31 to 40 of about 176,605 (340)
On the Order Type of Scattered Context-Free Orderings [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 We show that if a context-free grammar generates a language whose lexicographic ordering is well-ordered of type less than ω^2, then its order type is effectively computable.
Kitti Gelle, Szabolcs Iván
doaj +1 more source
The Triple-Pair Construction for Weighted ω-Pushdown Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 Let S be a complete star-omega semiring and Sigma be an alphabet. For a weighted omega-pushdown automaton P with stateset 1...n, n greater or equal to 1, we show that there exists a mixed algebraic system over a complete semiring-semimodule pair ((S ...
Manfred Droste +2 more
doaj +1 more source
Fast context-free grammar parsing requires fast boolean matrix multiplication [PDF]
JACM, 2001 In 1975, Valiant showed that Boolean matrix multiplication can be used for parsing context-free grammars (CFGs), yielding the asympotically fastest (although not practical) CFG parsing algorithm known.
Lillian Lee
semanticscholar +1 more source
Superregular grammars do not provide additional explanatory power but allow for a compact analysis of animal song [PDF]
Royal Society Open Science, 2019 A pervasive belief with regard to the differences between human language and animal vocal sequences (song) is that they belong to different classes of computational complexity, with animal song belonging to regular languages, whereas human language is ...
T. Morita, H. Koda
doaj +1 more source
An Online Algorithm for Lightweight Grammar-Based Compression
Algorithms, 2012 Grammar-based compression is a well-studied technique to construct a context-free grammar (CFG) deriving a given text uniquely. In this work, we propose an online algorithm for grammar-based compression.
Masayuki Takeda +2 more
doaj +1 more source
Inductive Synthesis of Cover-Grammars with the Help of Ant Colony Optimization
Foundations of Computing and Decision Sciences, 2016 A cover-grammar of a finite language is a context-free grammar that accepts all words in the language and possibly other words that are longer than any word in the language.
Wieczorek Wojciech
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
Parsing Bangla Grammar Using Context Free Grammar
, 2014 Parsing plays a very prominent role in computational linguistics. Parsing a Bangla sentence is a primary need in Bangla language processing. This chapter describes the Context Free Grammar (CFG) for parsing Bangla language, and hence, a Bangla parser is ...
Al-Mahmud, B. Sarker, K. Hasan
semanticscholar +1 more source
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
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