Results 1 to 10 of about 75,315 (101)

Probabilistic Top-Down Parsing and Language Modeling [PDF]

open access: hybridComputational 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   +5 more sources

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   +6 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
International audienceWe 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.
Koziński, Mateusz   +3 more
core   +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 into individual discourse units, we are able to eliminate the decoder and reduce the search space ...
Fajri Koto, Jey Han Lau, Timothy Baldwin
  +9 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. Starting from the root, at each step, a new node and its connections to existing nodes will be jointly ...
Deng Cai, Wai Lam
  +5 more sources

Dynamic Oracles for Top-Down and In-Order Shift-Reduce Constituent Parsing [PDF]

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

Parsing macro grammars top down

open access: bronzeInformation 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.
Kurt Mehlhorn
openalex   +4 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   +2 more sources

Bottom-Up/Top-Down Image Parsing with Attribute Grammar [PDF]

open access: greenIEEE Transactions on Pattern Analysis and Machine Intelligence, 2008
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 ...
Feng Han, Song-Chun Zhu
openalex   +7 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   +3 more sources

Home - About - Disclaimer - Privacy