Results 51 to 60 of about 311,585 (364)
Algorithms, 2016 LR parsing is a popular parsing strategy for variants of Context-Free Grammar (CFG). It has also been used for mildly context-sensitive formalisms, such as Tree-Adjoining Grammar.
Laura Kallmeyer, Wolfgang Maier
doaj +1 more source
Look into Person: Self-Supervised Structure-Sensitive Learning and a New Benchmark for Human Parsing [PDF]
Computer Vision and Pattern Recognition, 2017 Human parsing has recently attracted a lot of research interests due to its huge application potentials. However existing datasets have limited number of images and annotations, and lack the variety of human appearances and the coverage of challenging ...
Ke Gong +4 more
semanticscholar +1 more source
DEVELOPMENT OF A TOOL FOR MAKING EFFECTIVE DECISIONS IN THE FIELD OF INVESTMENT
International Journal of Advanced Studies, 2022 The article discusses the issues of making effective decisions about investing in commercial accounts and currencies. In order to know how much these solutions will be beneficial in the long term, specialized information is needed: data on the dynamics ...
Roman R. Krapivin +3 more
doaj +1 more source
SmBoP: Semi-autoregressive Bottom-up Semantic Parsing [PDF]
North American Chapter of the Association for Computational Linguistics, 2020 The de-facto standard decoding method for semantic parsing in recent years has been to autoregressively decode the abstract syntax tree of the target program using a top-down depth-first traversal. In this work, we propose an alternative approach: a Semi-
Ohad Rubin, Jonathan Berant
semanticscholar +1 more source
Parsing schemata and correctness of parsing algorithms
Theoretical Computer Science, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +6 more sources
Coarse-to-Fine Decoding for Neural Semantic Parsing [PDF]
Annual Meeting of the Association for Computational Linguistics, 2018 Semantic parsing aims at mapping natural language utterances into structured meaning representations. In this work, we propose a structure-aware neural architecture which decomposes the semantic parsing process into two stages.
Li Dong, Mirella Lapata
semanticscholar +1 more source
Electronic Notes in Theoretical Computer Science, 2010 AbstractRecursive Descent (RD) parsers are popular because their control flow follows the structure of the grammar and hence they are easy to write and to debug. However, the class of grammars which admit RD parsers is very limited. Backtracking techniques may be used to extend this class, but can have explosive runtimes and cannot deal with grammars ...
Elizabeth Scott, Adrian Johnstone
openaire +2 more sources
Simple and Accurate Dependency Parsing Using Bidirectional LSTM Feature Representations [PDF]
Transactions of the Association for Computational Linguistics, 2016 We present a simple and effective scheme for dependency parsing which is based on bidirectional-LSTMs (BiLSTMs). Each sentence token is associated with a BiLSTM vector representing the token in its sentential context, and feature vectors are constructed ...
E. Kiperwasser, Yoav Goldberg
semanticscholar +1 more source
, 2006 It is shown how parsing can be described as a problem in the class ISBES, Intersections of Sets and Bags of Extended Substructures, defined in /pubs/1991/161/, by viewing parsing as a generalization of pattern matching in several ways. The resulting description is shown to be a good starting point for the transformational derivation of the Cocke-Kasami-
openaire +2 more sources