Results 11 to 20 of about 226,863 (285)
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 +8 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 +7 more sources
High-Level Bottom-Up Cues for Top-Down Parsing of Facade Images [PDF]
2012 Second International Conference on 3D Imaging, Modeling, Processing, Visualization & Transmission, 2012 We address the problem of parsing images of building facades. The goal is to segment images, assigning to the resulting regions semantic labels that correspond to the basic architectural elements. We assume a top-down parsing framework is developed beforehand, based on a 2D shape grammar that encodes a prior knowledge on the possible composition of ...
David Ok +3 more
semanticscholar +10 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
semanticscholar +10 more sources
PatCluster: A Top-Down Log Parsing Method Based on Frequent Words [PDF]
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 +3 more sources
Core Semantic First: A Top-down Approach for AMR Parsing [PDF]
Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP), 2019 We introduce a novel scheme for parsing a piece of text into its Abstract Meaning Representation (AMR): Graph Spanning based Parsing (GSP). One novel characteristic of GSP is that it constructs a parse graph incrementally in a top-down fashion. Starting from the root, at each step, a new node and its connections to existing nodes will be jointly ...
Deng Cai, Wai Lam
semanticscholar +6 more sources
A Top-down Neural Architecture towards Text-level Parsing of Discourse Rhetorical Structure [PDF]
Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics, 2020 Accepted by ...
Longyin Zhang +4 more
semanticscholar +8 more sources
Dynamic Oracles for Top-Down and In-Order Shift-Reduce Constituent Parsing [PDF]
Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing, 2018 We introduce novel dynamic oracles for training two of the most accurate known shift-reduce algorithms for constituent parsing: the top-down and in-order transition-based parsers. In both cases, the dynamic oracles manage to notably increase their accuracy, in comparison to that obtained by performing classic static training.
Daniel Fernández‐González +1 more
semanticscholar +8 more sources
Rekayasa, 2016 Penelitian ini merupakan lanjutan penelitian sebelumnya (Syarief, 2014), yaitu dengan menambahkan fitur pengenalan kalimat tanya konfirmasi, yaitu kalimat tanya yang hanya membutuhkan jawaban ya atau tidak.
Mohammad Syarief
doaj +4 more sources
Modular and efficient top-down parsing for ambiguous left-recursive grammars [PDF]
Proceedings of the 10th International Conference on Parsing Technologies - IWPT '07, 2007 In functional and logic programming, parsers can be built as modular executable specifications of grammars, using parser combinators and definite clause grammars respectively. These techniques are based on top-down backtracking search. Commonly used implementations are inefficient for ambiguous languages, cannot accommodate left-recursive grammars, and
Richard Frost +2 more
semanticscholar +5 more sources