Results 191 to 200 of about 6,910 (242)
Enhanced semantic classification of microbiome sample origins using Large Language Models (LLMs)
Gaio D +6 more
europepmc +1 more source
, 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 ...
Otto Mayer
openalex +2 more sources
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.
Tom Botterill +2 more
openalex +2 more sources
An integrated bottom-up and top-down computing process for car parsing
SPIE Proceedings, 2009 This paper presents an integrated bottom-up and top-down computing process for parsing cars. By parsing, it means detecting all instances in an input image, and aligning their constituent parts, if appeared. The output of parsing is to construct configurations of car instances.
Xiong Yang, Tianfu Wu, Nong Sang
openalex +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Proceedings of the workshop on Speech and Natural Language - HLT '91, 1991
This paper describes a series of experiments aimed at producing a bottom-up parser that will produce partial parses suitable for use in robust interpretation and still be reasonably efficient. In the course of these experiments, we improved parse times by a factor of 18 over our first attempt, ending with a system that was twice as fast as our previous
Robert Moore, John Dowding
openaire +1 more source
This paper describes a series of experiments aimed at producing a bottom-up parser that will produce partial parses suitable for use in robust interpretation and still be reasonably efficient. In the course of these experiments, we improved parse times by a factor of 18 over our first attempt, ending with a system that was twice as fast as our previous
Robert Moore, John Dowding
openaire +1 more source
Producing the left parse during bottom-up parsing
Information Processing Letters, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Slivnik, Boštjan, Vilfan, Boštjan
openaire +2 more sources
1984
In trying to parse a string with a grammar, if one starts with the string and tries to fit it to the grammar, this is bottom-up or data-driven parsing. For instance with a context-free grammar , one starts with a token in the string and works up from there on the basis of rules in the grammar which have that token on their right hand side, trying to ...
Alan Bundy, Lincoln Wallen
openaire +1 more source
In trying to parse a string with a grammar, if one starts with the string and tries to fit it to the grammar, this is bottom-up or data-driven parsing. For instance with a context-free grammar , one starts with a token in the string and works up from there on the basis of rules in the grammar which have that token on their right hand side, trying to ...
Alan Bundy, Lincoln Wallen
openaire +1 more source
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 ...
Harvey Abramson, Veronica Dahl
openaire +1 more source
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 ...
Harvey Abramson, Veronica Dahl
openaire +1 more source
1994
Wir werden zunachst die Grundkonzepte des Bottom-up-Parsings anhand eines Algorithmus fur einen einfachen deterministischen Shift-reduce-Recognizer erlautern. Auf der Grundlage dieses Algorithmus entwickeln wir anschliesend einen Shift-reduce-Parser mit Depth-first-Suche und Backtracking und einen breadth-first operierenden Shift-reduce-Parser.
Sven Naumann, Hagen Langer
openaire +1 more source
Wir werden zunachst die Grundkonzepte des Bottom-up-Parsings anhand eines Algorithmus fur einen einfachen deterministischen Shift-reduce-Recognizer erlautern. Auf der Grundlage dieses Algorithmus entwickeln wir anschliesend einen Shift-reduce-Parser mit Depth-first-Suche und Backtracking und einen breadth-first operierenden Shift-reduce-Parser.
Sven Naumann, Hagen Langer
openaire +1 more source