Results 11 to 20 of about 2,336,780 (253)
Research on the Top-Down Parsing Method for Context-Sensitive Graph Grammars. [PDF]
PLoS ONE, 2015 The parsing problem is one of the key problems of graph grammars. The typical parsing algorithm uses the bottom-up method. The time-complexity of this method is high, and it is difficult to apply.
Yi Wang, XiaoQin Zeng, Han Ding
doaj +3 more sources
Parsing macro grammars top down [PDF]
Information and Control, 1979 A top-down parsing scheme for macro grammars is proposed. It extends the recursive descent method frequently used in context-free parsing. It is shown to be decidable if a macro grammar is top-down parsable. Nearly matching lower and upper bounds for the complexity of the decision procedure are derived.
Mehlhorn, Kurt, Mehlhorn, K.
exaly +6 more sources
Probabilistic Top-Down Parsing and Language Modeling [PDF]
Computational Linguistics, 2021 This paper describes the functioning of a broad-coverage probabilistic top-down parser, and its application to the problem of language modeling for speech recognition. The paper first introduces key notions in language modeling and probabilistic parsing, and briefly reviews some previous approaches to using syntactic structure for language modeling. A
Brian Roark
doaj +4 more sources
Top-down Discourse Parsing via Sequence Labelling [PDF]
Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume, 2021 We introduce a top-down approach to discourse parsing that is conceptually simpler than its predecessors (Kobayashi et al., 2020; Zhang et al., 2020). By framing the task as a sequence labelling problem where the goal is to iteratively segment a document into individual discourse units, we are able to eliminate the decoder and reduce the search space ...
Fajri Koto, Jey Han Lau, Timothy Baldwin
openaire +5 more sources
PatCluster: A Top-Down Log Parsing Method Based on Frequent Words
IEEE Access, 2023 Logs are a combination of static message type fields and dynamic variable fields, and the accuracy of log parsing affects the result of subsequent log analysis tasks.
Yu Bai, Yongwei Chi, Dan Zhao
doaj +2 more sources
Bottom-Up/Top-Down Image Parsing with Attribute Grammar [PDF]
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2009 This paper presents a simple attribute graph grammar as a generative representation for made-made scenes, such as buildings, hallways, kitchens, and living rooms, and studies an effective top-down/bottom-up inference algorithm for parsing images in the process of maximizing a Bayesian posterior probability or equivalently minimizing a description ...
Song-Chun Zhu
exaly +6 more sources
Top-Down RST Parsing Utilizing Granularity Levels in Documents
Proceedings of the AAAI Conference on Artificial Intelligence, 2020 Some downstream NLP tasks exploit discourse dependency trees converted from RST trees. To obtain better discourse dependency trees, we need to improve the accuracy of RST trees at the upper parts of the structures. Thus, we propose a novel neural top-down RST parsing method.
Naoki Kobayashi +4 more
openaire +4 more sources
Frontiers in Systems Neuroscience, 2021 Recent neurocognitive models commonly consider speech perception as a hierarchy of processes, each corresponding to specific temporal scales of collective oscillatory processes in the cortex: 30–80 Hz gamma oscillations in charge of phonetic analysis, 4 ...
Mamady Nabé +3 more
doaj +1 more source
On Parsing Programming Languages with Turing-Complete Parser
Mathematics, 2023 A new parsing method based on the semi-Thue system is described. Similar to, but with more efficient implementation than Markov normal algorithms, it can be used for parsing any recursively enumerable language.
Boštjan Slivnik, Marjan Mernik
doaj +1 more source
Parameters of Cross-linguistic Variation in Expectation-based Minimalist Grammars (e-MGs)
IJCoL, 2023 The fact that Parsing and Generation share the same grammatical knowledge is often considered the null hypothesis (Momma and Phillips 2018) but very few algorithms can take advantage of a cognitively plausible incremental procedure that operates roughly ...
Cristiano Chesi
doaj +1 more source