Results 1 to 10 of about 153,694 (263)

Research on the Top-Down Parsing Method for Context-Sensitive Graph Grammars. [PDF]

open access: goldPLoS 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]

open access: greenComputational 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,
Brian Roark
doaj   +9 more sources

Top-down Discourse Parsing via Sequence Labelling [PDF]

open access: greenProceedings 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
Fajri Koto, Jey Han Lau, Timothy Baldwin
semanticscholar   +10 more sources

Core Semantic First: A Top-down Approach for AMR Parsing [PDF]

open access: greenProceedings 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.
Deng Cai, W. Lam
semanticscholar   +6 more sources

PatCluster: A Top-Down Log Parsing Method Based on Frequent Words [PDF]

open access: goldIEEE 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

Parsing dan Konversi Kalimat Tanya Konfirmatif Menjadi Query Sparql Menggunakan Pendekatan Top-Down Parsing

open access: diamondRekayasa, 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]

open access: bronzeProceedings 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.
R. Frost, R. Hafiz, P. Callaghan
semanticscholar   +5 more sources

High-Level Bottom-Up Cues for Top-Down Parsing of Facade Images [PDF]

open access: green2012 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   +6 more sources

Top-Down RST Parsing Utilizing Granularity Levels in Documents

open access: goldProceedings 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.
Naoki Kobayashi   +4 more
semanticscholar   +4 more sources

Top-Down Parsing with Parsing Contexts A Simple Approach to Context-Sensitive Parsing

open access: yes, 2014
The domain of context-free languages has been extensively explored and there exist numerous techniques for parsing (all or a subset of) context-free languages. Unfortunately, some programming languages are not context-free.
Jan Kurs, M. Lungu, Oscar Nierstrasz
semanticscholar   +5 more sources

Home - About - Disclaimer - Privacy