A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Natural language parsing has to be accurate and quick. Explanation-based Learning (EBL) is a technique to speed-up parsing. The accuracy however often declines with EBL. ... The paper shows that this accuracy loss is not due to the EBL framework as such, but to deductive parsing. Abductive EBL allows extending the deductive closure of the parser. ... Both techniques may be computationally demanding, their effect on parsing however is quite different, c.f. (Streiter, 2002a) . ...doi:10.3115/1119250.1119265 dblp:conf/acl-sighan/Streiter03 fatcat:h2rwnrukobeu7kcy7cigi2frjy
By exploring the relationship between parsing and deduction, a new and more general view of chart parsing is obtained, which encompasses parsing for grammar formalisms based on unification, and is the ... basis of the Earley Deduction proof procedure for definite clauses. ... Acknowledgments We would like to thank Barbara Grosz and Stan Rosenschein for their comments on earlier versions of this paper. ...doi:10.3115/981311.981338 dblp:conf/acl/PereiraW83 fatcat:uzof2cpr3nfvllhgzzrvvjz2wu
“Principles and implementation of deductive parsing.” ... “Techniques for Memoization in Top-Down Parsing automatic memoization with applications to context-free parsing.” Computational Linguistics, 17(1), 91-98. Pereira, Fernando, and Warren, David H. ...
Deterministic techniques for efficient non-deterministic parsers. In Automata, Languages and Programming, 2nd Colloquium, volume 14 of Lecture Notes in Computer Science, pages 255-269, Saarbriicken. ... Principles and implementation of deductive parsing. Journal of Logic Programming, 24:3-36. Sikkel, Klaas. 1997. Parsing Schemata. Springer-Verlag, Berlin. Stolcke, Andreas. 1995. ...
We see parsing from the more general viewpoint of weighted deduction allowing for arbitrary weighted finite-state input and provide implementations of both bottom-up (CKY-inspired) and top-down (Earley-inspired ... We envision applications such as monolingual constituency parsing, synchronous parsing, context-free models of reordering for machine translation, and machine translation decoding. ... Conclusion We have given a quick overview of semiring parsing and discussed a novel sampling technique for inference over complex structured spaces which is compatible with this general framework. ...doi:10.1515/pralin-2015-0013 fatcat:cl7iyu6vunghbjv3zutigijr3u
This paper discusses a sequence of deductive parsers, called PAD1 -PAD5, that utilize an axiomatization of the principles and parameters of GB theory, including a restricted transformational component ... based on the "freeze" predicate of Prolog-II, while PAD3 -5 utilize the Unfold-Fold transformation to transform the original axiomatization into a form that functions as a recursive descent Prolog parser for ... Johnson (1988a) motivates the Parsing as Deduction approach in more detail than is possible here, and Johnson (1988b) extends the techniques presented in this paper to deal with a more complex fragment ...doi:10.3115/982023.982053 dblp:conf/acl/Johnson88 fatcat:acyb77z6cbhxjcps6cro5wdkki
Stolcke (1993) showed how to use the same techniques to compute inside probabili- ties for Earley parsing, dealing with the difficult problems of unary transitions, and the more difficult problems of epsilon ... Previous Work 7.1 Historical Work The previous work in this area is extensive, including work in deductive parsing, work in statistical parsing, and work in the combination of formal language theory and ...
There exist many techniques for imprecise manipulation of source code (robust parsing, error repair, lexical analysis, etc), mostly relying on heuristic-based tolerance. ... Such techniques are rarely fully formalised and quite often idiosyncratic, which makes them very hard to compare with respect to their applicability, tolerance level and general usefulness. ... deduction steps. ...doi:10.1109/csmr-wcre.2014.6747184 dblp:conf/csmr/Zaytsev14 fatcat:ynyggy46c5e2pogabh2rnfstbu
Our approaches show improvements over the best previously published system for solving geometry problems. ... Acknowledgments We thank the anonymous reviewers for their valuable comments and suggestions. ... However, we provide a technique to learn from demonstrations by learning a joint semantic parsing and deduction model. ...doi:10.18653/v1/s17-1029 dblp:conf/starsem/SachanX17 fatcat:aek3opasevhztaxcebbmz2ksoa
The approach is explained via a series of model deductive parsers for Government and Binding Theory, all of which use the same knowledge of language (i.e., underlying axiom system) but differ as to how ... Hypothesising that the human parser is a specialized deductive device in which Universal Grammar and parameter settings are represented as axioms provides a model of how knowledge of language can be put ... This is not implied by the Parsing as Deduction hypothesis. ...doi:10.1007/bf01069050 fatcat:jofg6fco3vdxjgx3gemvy3ow7u
Part I ends with an introduction to employing logic techniques for parsing fragments of English. ... With the foundation developed to this point, a discussion of recognizing and parsing context-free languages follows, including a presentation of LR parsing and deduction. ...
We present a system for generating parsers based directly on the metaphor of parsing as deduction. ... Parsing algorithms can be represented directly as deduction systems, and a single deduction engine can interpret such deduction systems so as to implement the corresponding parser. ... The authors would like to thank the anonymous reviewers for their helpful comments on an earlier draft. ...arXiv:cmp-lg/9404008v1 fatcat:ca6kzfys6vegvf356wrne46iba
We examine the complexity of applying this method to parsing algorithms for general Linear Context-Free Rewriting Systems. ... We describe the application of the graph-theoretic property known as treewidth to the problem of finding efficient parsing algorithms. ... We are grateful to Giorgio Satta for extensive discussions on grammar factorization, as well as for feedback on earlier drafts from Mehdi Hafezi Manshadi, Matt Post, and four anonymous reviewers. ...doi:10.1162/coli_a_00040 fatcat:obraf7ug3ncgtbmq34trlrtpeq
Several logic programmed systems for translating language into logic or other forms soon followed. The "parsing as deduction" paradigm--an expression coined by Femando Pereira--had been born. ... Its theoretical aspects include the study of syntax (what constructions are acceptable), semantics (how to describe meaning), pragmatics (what world knowledge is needed for understanding or producing language ... a variety of parsing algorithms for different grammatical formalisms, through a uniform deduction engine parameterized by inference rules in specialized logics. ...doi:10.1016/0743-1066(95)00039-m fatcat:kafnigi4lzdgxopt37hu25bhsy
Summary: “We present a system for generating parsers based directly on the metaphor of parsing as deduction. ... ISBN 2-7261-0768-0 Summary: “An incremental parsing algorithm based on dynamic programming techniques is described. ...
« Previous Showing results 1 — 15 out of 8,484 results