Results 181 to 190 of about 182,970 (219)

Finding a vine's structure by bottom-up parsing of cane edges

2013 28th International Conference on Image and Vision Computing New Zealand (IVCNZ 2013), 2013
A vine pruning robot uses stereo cameras to build a 3D model of vines. The robot's 3D reconstruction scheme requires the 2D structure of the vine to be extracted from each image. This paper describes how the 2D structure is extracted. We propose an image grammar-based model for how a vine generates an image.
T. Botterill, R. Green, S. Mills
semanticscholar   +3 more sources

Producing a Top-Down Parse Order with Bottom-up Parsing

Information Processing Letters, 1995
An adaptation of the standard LR(1) and LALR(1) parsing algorithm is described such that a top-down parse order is produced rather than the standard bottom-up order.
James P. Schmeiser, D. T. Barnard
semanticscholar   +3 more sources

Canonical Bottom-up-Parsing

GI Jahrestagung, 1976
A general theory of canonical bottom-up analysis is presented; it includes the familiar types of deterministic bottom-up parsing methods (e.g. precedence, bounded right context, LR, and LR-regular) as special cases. Among the results obtained are sufficient conditions on the means of construction to guarantee the resulting bottom-up-parsing method ...
O. Mayer
semanticscholar   +3 more sources

Bottom Up Parsing

, 1989
The declarative reading of a logic grammar specifies the strings that are in the language generated by the grammar; the procedural reading of a logic grammar specifies how strings of the language are generated or analyzed. Up until now we have used a top-down (with respect to the parse tree) procedural reading for our logic grammars: grammar rules are ...
H. Abramson, V. Dahl
semanticscholar   +3 more sources

Toward a Bottom-Up Parsing Virtual Machine

2010 Second International Conference on Computer Engineering and Applications, 2010
This paper proposes a virtual machine specialized for bottom-up parsing. All existing parser generators are tightly coupled to their target programming languages. In this paper’s approach, generated parsers are written in machine code for a virtual machine. They are loosely coupled to any programming languages.
K. Maeda
semanticscholar   +3 more sources

A Bottom-Up Approach applied to Dependency Parsing in Malayalam Language

2021 IEEE 8th Uttar Pradesh Section International Conference on Electrical, Electronics and Computer Engineering (UPCON), 2021
Malayalam is the official language of Kerala and Lakshadweep islands which falls in Dravidian languages. Malayalam is where all the words cannot be freely moved and is known as a less word order language.
Sumayya Suhail, Saranya M Nambiar, Sneha S Nambiar, Simon Saju, Sindhya K. Nambiar   +4 more
semanticscholar   +2 more sources

A Survey on Top Down and Bottom Up Parsing

SSRN Electronic Journal
N. Reddy, Sai Teja P, Meena Belwal
semanticscholar   +3 more sources

Language modeling using efficient best-first bottom-up parsing

2003 IEEE Workshop on Automatic Speech Recognition and Understanding (IEEE Cat. No.03EX721), 2003
In this paper we present a two-stage best-first bottom-up word-lattice parser which we use as a language model for speech recognition. The parser works by using a "figure of merit" that selects lattice paths while simultaneously selecting syntactic category edges for parsing. Additionally, we introduce a modified version of the inside-outside algorithm
Keith B. Hall, Mark Johnson
semanticscholar   +3 more sources

Accurate 3D bone segmentation in challenging CT images: Bottom-up parsing and contextualized optimization

2016 IEEE Winter Conference on Applications of Computer Vision (WACV), 2016
In full or arbitrary field-of-view (FOV) 3D CT imaging, obtaining an accurate per-voxel segmentation for complete large and small bones remains an unsolved and challenging problem. The difficulty lies in the notable variation in appearance and position observed among cortical bones, marrow and pathologies. To approach this problem, several studies have
Le Lu, Dijia Wu, Nathan S. Lay, David Liu, Isabella Nogues, R. Summers   +5 more
semanticscholar   +3 more sources

Incremental learning of context free grammars based on bottom-up parsing and search

Pattern Recognition, 2005
This paper describes approaches for machine learning of context free grammars (CFGs) from positive and negative sample strings, which are implemented in Synapse system. The grammatical inference consists of a rule generation by ''inductive CYK algorithm,'' mechanisms for incremental learning, and search.
Katsuhiko Nakamura, Masashi Matsumoto
semanticscholar   +2 more sources