Results 1 to 10 of about 67,464 (283)
Faster shift-reduce constituent parsing with a non-binary, bottom-up strategy [PDF]
Artificial Intelligence, 2019 Final peer-reviewed manuscript accepted for ...
Fernández-González, Daniel +1 more
core +8 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 ...
Ok, David +3 more
core +10 more sources
SmBoP: Semi-autoregressive Bottom-up Semantic Parsing [PDF]
Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, 2021 The de-facto standard decoding method for semantic parsing in recent years has been to autoregressively decode the abstract syntax tree of the target program using a top-down depth-first traversal. In this work, we propose an alternative approach: a Semi-autoregressive Bottom-up Parser (SmBoP) that constructs at decoding step $t$ the top-$K$ sub-trees ...
Rubin, Ohad, Berant, Jonathan
+10 more sources
Bottom-Up Constituency Parsing and Nested Named Entity Recognition with Pointer Networks [PDF]
Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), 2022 Constituency parsing and nested named entity recognition (NER) are similar tasks since they both aim to predict a collection of nested and non-crossing spans. In this work, we cast nested NER to constituency parsing and propose a novel pointing mechanism for bottom-up parsing to tackle both tasks.
Yang, Songlin, Tu, Kewei
+6 more sources
Dependency parsing with bottom-up Hierarchical Pointer Networks
Information Fusion, 2023 Dependency parsing is a crucial step towards deep language understanding and, therefore, widely demanded by numerous Natural Language Processing applications. In particular, left-to-right and top-down transition-based algorithms that rely on Pointer Networks are among the most accurate approaches for performing dependency parsing.
Daniel Fernández-González +1 more
+7 more sources
symbolic lookaheads for bottom up parsing [PDF]
, 2016 We present algorithms for the construction of LALR(1) parsing tables, and of LR(1) parsing tables of reduced size. We first define specialized characteristic automata whose states are parametric w.r.t. variables symbolically representing lookahead-sets.
Quaglia, Paola
openaire +7 more sources
A pipeline model for bottom-up dependency parsing [PDF]
Proceedings of the Tenth Conference on Computational Natural Language Learning - CoNLL-X '06, 2006 We present a new machine learning framework for multi-lingual dependency parsing. The framework uses a linear, pipeline based, bottom-up parsing algorithm, with a look ahead local search that serves to make the local predictions more robust. As shown, the performance of the first generation of this algorithm is promising.
Dan Roth, Ming-Wei Chang, Quang Do
openaire +3 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 ...
Feng Han, Song-Chun Zhu
openaire +7 more sources
Parallel non-deterministic bottom-up parsing [PDF]
Proceedings of the international symposium on Extensible languages -, 1971 The development of translator writing systems and extensible languages has led to a simultaneous development of more efficient and general syntax analyzers, usually for context-free (CF) syntax. Our paper describes a type of parser that can be used with reasonable efficiency for any CF grammar, even one which is ambiguous.
Bernard Lang
openaire +4 more sources
Noncanonical Extensions of Bottom-Up Parsing Techniques [PDF]
SIAM Journal on Computing, 1976 A bottom-up parsing technique which can make non-leftmost possible reductions in sentential forms is said to be non-canonical. Nearly every existing parsing technique can be extended to a non-canonical method which operates on larger classes of grammars and languages than the original technique.
John H. Williams, Thomas G. Szymanski
openaire +4 more sources