Results 11 to 20 of about 182,970 (219)
SmBoP: Semi-autoregressive Bottom-up Semantic Parsing [PDF]
North American Chapter of the Association for Computational Linguistics, 2020 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-
Ohad Rubin, Jonathan Berant
semanticscholar +3 more sources
Bottom-Up/Top-Down Image Parsing with Attribute Grammar [PDF]
IEEE 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
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.
Ming‐Wei Chang, Quang Do, Dan Roth
openalex +3 more sources
Faster shift-reduce constituent parsing with a non-binary, bottom-up strategy [PDF]
Artificial Intelligence, 2019 Final peer-reviewed manuscript accepted for ...
Daniel Fernández‐González +1 more
openalex +5 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
openalex +5 more sources
Bottom-up/top-down image parsing by attribute graph grammar [PDF]
Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1, 2005 In this paper, we present an attribute graph grammar for image parsing on scenes with man-made objects, such as buildings, hallways, kitchens, and living moms. We choose one class of primitives - 3D planar rectangles projected on images and six graph grammar production rules.
Feng Han, Song‐Chun Zhu
openalex +3 more sources
Symbolic Lookaheads for Bottom-up Parsing
International Symposium on Mathematical Foundations of Computer Science, 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.
P. Quaglia
semanticscholar +6 more sources
Bottom-up Recognition and Parsing of the Human Body
2007 IEEE Conference on Computer Vision and Pattern Recognition, 2007 Recognizing humans, estimating their pose and segmenting their body parts are key to high-level image understanding. Because humans are highly articulated, the range of deformations they undergo makes this task extremely challenging. Previous methods have focused largely on heuristics or pairwise part models in approaching this problem.
P. Srinivasan, Jianbo Shi
openalex +5 more sources
Generation of Syntax Parser on South Indian Language using Bottom-Up Parsing Technique and PCFG [PDF]
Journal of Information Technology Management, 2023 In our research, we provide a statistical syntax parsing method experimented on Kannada texts, which is an official language of Karnataka, India. The dataset is downloaded from TDIL website.
M. Rajani Shree, Shambhavi B. R.
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