Filters








812 Hits in 3.9 sec

A new top-down parsing algorithm for left-recursive DCGs [chapter]

Mark-Jan Nederhof
1993 Lecture Notes in Computer Science  
Deterministic cancellation parsing with lookahead k can handle the C(k) grammars, which include the LL(k) grammars and are contained in the LC(k) grammars.  ...  This makes cancellation parsing particularly useful for the implementation of definite clause grammars in Prolog environments.  ...  Furthermore, the bottom-up nature of LC parsing complicates early rejection of derivations by means of failed unification.  ... 
doi:10.1007/3-540-57186-8_74 fatcat:ljz2ilgxjjebricbl4i7r7jhdu

A Parsing System Based on Logic Programming

Yuji Matsumoto, Ryôichi Sugimura
1987 International Joint Conference on Artificial Intelligence  
A restricted Definite Clause Grammar is assumed as grammar description and the grammar is translated into a parsing program written in Prolog.  ...  The major advantages of our system are that the system works in a bottom-up manner so that the left-recursive rules do not cause difficulties, the parsing process does not involve backtracking, and there  ...  Our previous bottom-up parsing system, BUP [Matsumoto 83 ], has similar charasteristics and we have almost equal performance from both of them when they are executed by the Prolog interpreter.  ... 
dblp:conf/ijcai/MatsumotoS87 fatcat:7dyfmduqxvdrbbo34gjdck262q

Page 455 of Computational Linguistics Vol. 23, Issue 3 [page]

1997 Computational Linguistics  
Miyoshi, and H. Yasukawa. 1983. BUP: A bottom up parser embedded in Prolog. New Generation Computing, 1(2). Nederhof, Mark-Jan and Giorgio Satta. 1994. An extended theory of head-driven parsing.  ...  The grammar used in the OVIS experiments is written by Gosse Bouma, Rob Koeling and myself. Mark-Jan Nederhof implemented the bottom-up active chart parser and the experimental LR parser.  ... 

Selective Magic HPSG Parsing [article]

Guido Minnen
1999 arXiv   pre-print
The parser allows the user to apply magic compilation to specific constraints in a grammar which as a result can be processed dynamically in a bottom-up and goal-directed fashion.  ...  We propose a parser for constraint-logic grammars implementing HPSG that combines the advantages of dynamic bottom-up and advanced top-down control.  ...  The author wishes to thank Dale Gerdemann and Erhard Hinrichs and the anonymous reviewers for comments and discussion. Of course, the author is responsible for all remaining errors.  ... 
arXiv:cs/9907012v1 fatcat:t4tolmnswve7foxllhesj5zao4

Preference Logic Grammars: Fixed point semantics and application to data standardization

Baoqiu Cui, Terrance Swift
2002 Artificial Intelligence  
This process includes correcting misspellings and truncations that occur in data, extraction of relevant information via parsing, and correcting inconsistencies in the extracted information.  ...  The declarativity of Prolog offers natural advantages for data standardization, and a commercial standardizer has been implemented using Prolog.  ...  Warren a debt of thanks for help in rewriting the Prolog standardizer to use tabling and preferences.  ... 
doi:10.1016/s0004-3702(02)00185-6 fatcat:xwsudyioufci7hncpcfawzevlq

A Prolog Framework for the Rapid Prototyping of Language Processors with Attribute Grammars

José Luis Sierra, Alfredo Fernández-Valmayor
2006 Electronical Notes in Theoretical Computer Science  
grammar notations explained in the course cited, and lets students produce comprehensible prototypes from their specifications in a straightforward way.  ...  In this paper, we describe PAG (Prototyping with Attribute Grammars), a framework for building Prolog prototypes from specifications based on attribute grammars, which we have developed for supporting  ...  and automatically generated predictive-recursive top-down translators, automatically generated table-driven top-down translators, and also automatically generated LR bottom-up translators [2] [8] .  ... 
doi:10.1016/j.entcs.2006.10.002 fatcat:2wsru35cvbfszalhlsad3rq5na

Meta-interpretive learning: application to grammatical inference

Stephen H. Muggleton, Dianhuan Lin, Niels Pahlavi, Alireza Tamaddoni-Nezhad
2013 Machine Learning  
Once again, Metagol RCF runs up to 100 times faster than Metagol CF on grammars chosen randomly from Regular and non-Regular Context-Free grammars.  ...  We show that the representation can be mapped to a fragment of Higher-Order Datalog in which atomic formulae in H are projections of first-order definite clause grammar rules and the existentially quantified  ...  In the case that H B,E is finite up to renaming of Skolem constants there exists ⊥ ∈ H B,E such that for all H ∈ H B,E we have H B,E ⊥ and ⊥ is unique up to renaming of Skolem constants.Proof.  ... 
doi:10.1007/s10994-013-5358-3 fatcat:xokqzageqbfx3g2evyw33lys4m

Declarative programming for verification

Michael Leuschel
2008 Proceedings of the 10th international ACM SIGPLAN symposium on Principles and practice of declarative programming - PPDP '08  
More precisely, we present insights gained and lessons learned while implementing animators and model checkers in Prolog for various specification languages, ranging from process algebras such as CSP to  ...  model-based specifications such as Z and B.  ...  Also, it is difficult for a user to know where to put the cuts and to know if the parsing process will be deterministic.  ... 
doi:10.1145/1389449.1389450 dblp:conf/ppdp/Leuschel08 fatcat:f55xkcbjaral7lytcr6odnmsee

Know when to hold 'em

Robert T. Kasper, Mike Calcagno, Paul C. Davis
1998 Proceedings of the 36th annual meeting on Association for Computational Linguistics -  
The results of our implementation demonstrate that deterministic application of shuffle constraints yields a dramatic improvement in the overall performance of a head-corner parser for German using an  ...  Nonconcatenative constraints, such as the shuffle relation, are frequently employed in grammatical analyses of languages that have more flexible ordering of constituents than English.  ...  If we parse in a bottom-up fashion, and the order domains of two daughter constituents are combined as the first two arguments of shuffle, multiple solutions will be possible for the mother domain (the  ... 
doi:10.3115/980845.980956 dblp:conf/acl/KasperCD98 fatcat:itn3iuyngjca5cd2eabg6s222q

Page 96 of Journal of Research and Practice in Information Technology Vol. 17, Issue 2 [page]

1985 Journal of Research and Practice in Information Technology  
Bottom-up parsing: simple precedence grammars; LR(0) grammars; LR(1) grammars; theoretical considerations. The author has substantially achieved his goals.  ...  Pushdown automata: nondeterministic pushdown automata; NPDAs as acceptors for CFLs; deterministic PDAs. Top-down parsing: LL(k) grammars; recursive descent.  ... 

Logical Grammars Based on Constraint Handling Rules [chapter]

Henning Christiansen
2002 Lecture Notes in Computer Science  
A CHRG executes as a robust bottom-up parser with an inherent treatment of ambiguity.  ...  show disambiguation of simple and ambiguous context-free rules and a handling of coordination in natural language.  ...  Being of special interest to language processing, [2] has shown that CHR adds bottom-up evaluation to Prolog and a flexibility to combine top-down and bottom-up; [1] has taken this a step further showing  ... 
doi:10.1007/3-540-45619-8_43 fatcat:iuw2ddoi7fcuzpwl3htq5ulalm

Application of Methods for Syntax Analysis of Context-Free Languages to Query Evaluation of Logic Programs [article]

Heike Stephan
2014 arXiv   pre-print
My research goal is to employ a parser generation algorithm based on the Earley parsing algorithm to the evaluation and compilation of queries to logic programs, especially to deductive databases.  ...  This automaton can be compiled to executable code; thus we expect a speedup in runtime of query evaluation.  ...  A bottom-up evaluation of this generated program corresponds to the execution of the parameterized automaton.  ... 
arXiv:1405.3826v1 fatcat:45s7ighu4natvdnptoof5gg6ry

A web system for reasoning with probabilistic OWL

Elena Bellodi, Evelina Lamma, Fabrizio Riguzzi, Riccardo Zese, Giuseppe Cota
2016 Software, Practice & Experience  
However, some tableau expansion rules are non-deterministic, forcing the implementation of a search strategy in an or-branching search space.  ...  Both the web server and the inference back-end are run entirely within SWI-Prolog. Reasoning in TRILL on SWISH is accomplished by a version of TRILL ported to SWI-Prolog.  ...  ACKNOWLEDGEMENT We would like to thank Jan Wielemaker for his very useful comments on how to set up the system. This work was supported by the "GNCS-INdAM".  ... 
doi:10.1002/spe.2410 fatcat:gpfouup76nhhdcv47bju4prbne

A Tribute to Alain Colmerauer [article]

Jacques Cohen
2004 arXiv   pre-print
The paper describes the contributions of Alain Colmerauer to the areas of logic programs (LP) and constraint logic programs (CLP).  ...  Acknowledgements I wish to thank Colette Colmerauer and Krzysztof Apt for the thoughtful comments they made on the original manuscript.  ...  It involved the design of a two-stack Turing Machine (TM) to estimate the efficiency of various context-free parsing methods, in particular the approaches known as top-down and bottom-up.  ... 
arXiv:cs/0402058v1 fatcat:cvvtxztqkjcxrm53uwnivq77nq
« Previous Showing results 1 — 15 out of 812 results