Results 11 to 20 of about 67,464 (283)
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.
Song-Chun Zhu, Feng Han
openaire +3 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.
Jianbo Shi, Praveen Srinivasan
openaire +5 more sources
STUDI ANALISIS METODE-METODE PARSING DAN INTERPRETASI SEMANTIK PADA NATURAL LANGUAGE PROCESSING [PDF]
Jurnal 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
Efficient disjunctive unification for bottom-up parsing [PDF]
Proceedings of the 13th conference on Computational linguistics -, 1990 This paper describes two novel techniques which, when applied together, in practice significantly reduce the time required for unifying disjunctive feature structures. The first is a safe but fast method for discarding irrelevant disjunctions from newly-created structures.
David Carter
openaire +4 more sources
Bottom-up parsing extending context-freeness in a Process Grammar processor [PDF]
Proceedings of the 28th annual meeting on Association for Computational Linguistics -, 1990 A new approach to bottom-up parsing that extends Augmented Context-Free Grammar to a Process Grammar is formally presented. A Processor Grammar (PG) defines a set of rules suited for bottom-up parsing and conceived as processes that are applied by a PG Processor.
Massimo Marino
openaire +4 more sources
A new design of prolog-based bottom-up parsing system with Government-Binding theory [PDF]
Proceedings of the 12th conference on Computational linguistics -, 1988 This paper addresses the problems of movement transformation in Prolog-based bottom-up parsing system. Three principles of Government-Binding theory are employed to deal with these problems. They are Empty Category Principle, C-command Principle, and Subjacency Principle. A formalism based upon them is proposed.
I. Peng Lin +2 more
openaire +4 more sources
On deterministic canonical bottom-up-parsing
Information and Control, 1979 A general framework for producing deterministic canonical bottom-up parsers which contains all these parsers as special cases is described. Then general conditions on the means of construction which guarantee that the obtained parsing methods work correctly are presented.
Otto Mayer
openaire +3 more sources
Penentuan Pola Kalimat Bahasa Inggris Pada Simple Present Tense Menggunakan Metode Bottom Up Parsing
INTEGER: Journal of Information Technology, 2016 English is a language widely used by many countries in the world. It has many grammar rules in which each has structural pattern regulating composition of clause, phrase, and words in natural language. Simple Present Tense is one of 16 tenses in English Grammar. It is the first and basic tense which used to express regular and habitual action.
Muhamad Nasir, Budanis Dwi Meilani
openaire +4 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