Results 11 to 20 of about 75,315 (101)

Efficient probabilistic top-down and left-corner parsing [PDF]

open access: bronzeProceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics -, 1999
8 pages, 3 tables, 3 ...
Brian Roark, Mark Johnson
openalex   +5 more sources

Top-down parsing in Coco-2 [PDF]

open access: bronzeACM SIGPLAN Notices, 1991
Coco-2 [Dobler90] is a new compiler compiler with two interesting features: It allows the specification of the lexical structure, syntax and semantics of a source language within a single document and it implements a new top-down parsing method.
Heinz Dobler
openalex   +3 more sources

Modular and efficient top-down parsing for ambiguous left-recursive grammars [PDF]

open access: bronzeProceedings of the 10th International Conference on Parsing Technologies - IWPT '07, 2007
In functional and logic programming, parsers can be built as modular executable specifications of grammars, using parser combinators and definite clause grammars respectively. These techniques are based on top-down backtracking search. Commonly used implementations are inefficient for ambiguous languages, cannot accommodate left-recursive grammars, and
Richard Frost   +2 more
openalex   +4 more sources

A hybrid top-down parsing technique [PDF]

open access: bronze, 1991
0 Recursive descent parsing allows local semantic objects within each grammar rule. These semantic objects are automatically stacked upon recognition of recursive nonterminals. Parsing speed is maximal, as the recognition of a terminal defaults to a simple comparison instruction. The drawbacks are a grammar-dependent static parser size as well as a lot
Heinz Dobler
openalex   +4 more sources

Efficient Top-Down BTG Parsing for Machine Translation Preordering [PDF]

open access: hybridProceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (Volume 1: Long Papers), 2015
We present an efficient incremental topdown parsing method for preordering based on Bracketing Transduction Grammar (BTG). The BTG-based preordering framework (Neubig et al., 2012) can be applied to any language using only parallel text, but has the problem of computational efficiency.
Tetsuji Nakagawa
openalex   +3 more sources

STUDI ANALISIS METODE-METODE PARSING DAN INTERPRETASI SEMANTIK PADA NATURAL LANGUAGE PROCESSING [PDF]

open access: yesJurnal Informatika, 2001
Three main processes in Natural Language Processing are syntax analysis or parsing, semantic interpretation and contextual interpretation. This paper discuss about the first and the second of these processes.
James Suciadi
doaj   +3 more sources

A New Top-Down Context-Free Parsing for Syntactic Pattern Recognition

open access: bronzeInternational Journal of Computer Applications, 2013
The numerous different mathematical methods used to solve pattern recognition snags may be assembled into two universal approaches:the decision-theoretic approach and the syntactic (structural) approach. In this paper,at first syntactic pattern recognition method and formal grammars are described and then has been investigated one of the techniques in ...
Mehrnoosh Bazrafkan, Ali Broumandnia
  +5 more sources

Memoization of Top Down Parsing

open access: green, 1995
uuencoded, compressed postscript ...
Mark Johnson
openalex   +4 more sources

Bottom-up/top-down image parsing by attribute graph grammar [PDF]

open access: greenTenth 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

Attribute-directed top-down parsing [PDF]

open access: closed, 1992
This paper deals with a method how an effective attribute-directed top-down parser and attribute evaluator can be constructed from a conditional L-attributed grammar (CLAG). The method is based on exploitation of an attribute stack in attribute evaluation and on definition of a translation scheme for CLAG.
Karel Müller
openalex   +3 more sources

Home - About - Disclaimer - Privacy