Results 171 to 180 of about 169,488 (224)
Some of the next articles are maybe not open access.
A Generalized Earley Parser for Human Activity Parsing and Prediction
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2020Detection, parsing, and future predictions on sequence data (e.g., videos) require the algorithms to capture non-Markovian and compositional properties of high-level semantics.
Siyuan Qi +4 more
semanticscholar +1 more source
Acta Informatica, 1973
Knuth'sLR(1) parsing algorithm is sufficiently general to handle the parsing of most programming languages with the additional benefit of earlier detection of syntax errors than in other formal methods used in compilers. The major obstacle impeding the use of this algorithm is the large space requirement for parsing tables.
Anderson T, Eve J, Horning JJ
openaire +2 more sources
Knuth'sLR(1) parsing algorithm is sufficiently general to handle the parsing of most programming languages with the additional benefit of earlier detection of syntax errors than in other formal methods used in compilers. The major obstacle impeding the use of this algorithm is the large space requirement for parsing tables.
Anderson T, Eve J, Horning JJ
openaire +2 more sources
Mison: A Fast JSON Parser for Data Analytics
Proceedings of the VLDB Endowment, 2017The growing popularity of the JSON format has fueled increased interest in loading and processing JSON data within analytical data processing systems. However, in many applications, JSON parsing dominates performance and cost. In this paper, we present a
Yinan Li +4 more
semanticscholar +1 more source
Acta Informatica, 1978
The concept of incremental parsing is briefly introduced. An algorithm which augments an LR parser with the capability of reanalyzing a limited part of a modified program is illustrated. The algorithm operates on a sequence of configurations representing the parse of the old input and finds the smallest part of the sequence which must be recomputed to ...
openaire +3 more sources
The concept of incremental parsing is briefly introduced. An algorithm which augments an LR parser with the capability of reanalyzing a limited part of a modified program is illustrated. The algorithm operates on a sequence of configurations representing the parse of the old input and finds the smallest part of the sequence which must be recomputed to ...
openaire +3 more sources
Multibox parsers: no more handwritten lexical parsers
IEEE Software, 1995Most parser generators do not work with lexically complex languages like Fortran. Compiler writers end up writing lexers by hand. To deal with this complexity, the author suggests generating a parser that uses a series of boxes-like a mechanical caterpillar-instead of just two. >
openaire +1 more source
Proceedings of the 2019 3rd International Symposium on Computer Science and Intelligent Control, 2019
Dependency parsing is one of the basic research of natural language processing. In recent years, transition-based and graph-based methods have been used widely, but there are still some problems such as feature limitation and high time complexity. In this paper, we proposed a new method named Leaf Detection based Dependency Parsing (LD-Parser), which ...
Weidong Wen +4 more
openaire +1 more source
Dependency parsing is one of the basic research of natural language processing. In recent years, transition-based and graph-based methods have been used widely, but there are still some problems such as feature limitation and high time complexity. In this paper, we proposed a new method named Leaf Detection based Dependency Parsing (LD-Parser), which ...
Weidong Wen +4 more
openaire +1 more source
Building a Semantic Parser Overnight
Annual Meeting of the Association for Computational Linguistics, 2015How do we build a semantic parser in a new domain starting with zero training examples? We introduce a new methodology for this setting: First, we use a simple grammar to generate logical forms paired with canonical utterances.
Yushi Wang, Jonathan Berant, Percy Liang
semanticscholar +1 more source
Parser Possibilities: Why Write A Markup Parser
Balisage Series on Markup Technologies, 2009In the early days of XML, there seemed to be a new XML parser just about every week. This was in stark contrast to SGML where there might be half a dozen working parsers ever written. As XML matured and SAX became the first defacto XML parser API, the new parser stream pretty much slowed to a trickle.
openaire +1 more source
Reusing batch parsers as incremental parsers
1995A simple solution to the incremental parsing problem is found by mapping sentential forms of a context-free grammar G over terminal strings of the placeholder language and then subtree forests, i.e. sequences of syntax sub-trees, over sequences of pairs (placeholdertoken, subtree-pointer).
openaire +1 more source
ACM SIGSOFT Software Engineering Notes, 1994
Traditional compiler front end generating tools such as Lex/Yacc assume a front end consisting of two boxes: a lexical box and a syntax box. Lex produces a lexical analyzer using regular expressions as a token description. Yacc generates a syntax analyzer from the LALR grammar for the parsed language.
openaire +1 more source
Traditional compiler front end generating tools such as Lex/Yacc assume a front end consisting of two boxes: a lexical box and a syntax box. Lex produces a lexical analyzer using regular expressions as a token description. Yacc generates a syntax analyzer from the LALR grammar for the parsed language.
openaire +1 more source