Results 201 to 210 of about 65,747 (262)

GNOme, an ontology for glycan naming and subsumption. [PDF]

Anal Bioanal Chem
Zhang W, Vesser M, Edwards N.
europepmc   +1 more source

First-Generation and Low-Income Students in the National Medical Student Body.

JAMA Netw Open
Kamran SC, Pompa IR, Nguyen HB, Cha J, Salinas KE, Niemierko A, Vapiwala N.   +6 more
europepmc   +1 more source

Efficient bottom-up parsing

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 T. Moore, John Dowding
openalex   +3 more sources

Bottom-up-Parsing

, 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
openalex   +3 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   +3 more sources

Bottom-Up and General Parsing

, 2009
Stefano Crespi Reghizzi
openalex   +3 more sources

Bottom-Up Parsing [PDF]

, 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 ...
Lincoln Wallen, Alan Bundy
openaire   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Producing a top-down parse order with bottom-up parsing

Information Processing Letters, 1995
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
James P. Schmeiser, David T. Barnard
openaire   +2 more sources

Processing Left Extraposition in a Bottom-Up Parsing System

, 1991
Satoshi Kinoshita, Hozumi Tanaka
openalex   +2 more sources