A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
An Improved Context-Free Recognizer
ACM Transactions on Programming Languages and Systems (TOPLAS)
An efficient context-free parsing algorithm
Communications of the ACM
Logic for Problem Solving
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
Natural Language Communication with Computers
Computational Linguistics
Computational Linguistics
An efficient easily adaptable system for interpreting natural language queries
Computational Linguistics
Chart parsing and rule schemata in PSG
ACL '81 Proceedings of the 19th annual meeting on Association for Computational Linguistics
Magic sets and other strange ways to implement logic programs (extended abstract)
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Parsing and compiling using Prolog
ACM Transactions on Programming Languages and Systems (TOPLAS)
A view of the origins and development of Prolog
Communications of the ACM
Bottom-up beats top-down for datalog
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Knowledge and natural language processing
Communications of the ACM
Semantic-head-driven generation
Computational Linguistics
Chart parsing of stochastic spoken language models
HLT '89 Proceedings of the workshop on Speech and Natural Language
Communications of the ACM
Memoization in top-down parsing
Computational Linguistics
Recursive query processing using graph traversal techniques
CIKM '96 Proceedings of the fifth international conference on Information and knowledge management
Experiments in inductive chart parsing
Learning language in logic
Preference logic grammars: fixed point semantics and application to data standardization
Artificial Intelligence
On the complexity analysis of static analyses
Journal of the ACM (JACM)
Off-Line Parsability and the Well-Foundedness of Subsumption
Journal of Logic, Language and Information
Tabular parsing and algebraic transformations
Theoretical Computer Science - Algebraic methods in language processing
An Opterational Model for Parsing Definite Clause Grammars with Infinite Terms
LACL '97 Selected papers from the Second International Conference on Logical Aspects of Computational Linguistics
Compiler Construction in Higher Order Logic Programming
PADL '02 Proceedings of the 4th International Symposium on Practical Aspects of Declarative Languages
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
A Deterministic Shift-Reduce Parser Generator for a Logic Programming Language
CL '00 Proceedings of the First International Conference on Computational Logic
Formal Specification of Intrusion Signatures and Detection Rules
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
An alternative conception of tree-adjoining derivation
Computational Linguistics
Computational Linguistics
An algorithm for generation in Unification Categorial Grammar
EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
Multiple interpreters in a principle-based model of sentence processing
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Computational aspects of M-grammars
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
A bidirectional model for natural language processing
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
An extension of earley's algorithm for S-attributed grammars
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Semantic interpretation using KL-ONE
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
The semantics of grammar formalisms seen as computer languages
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
Using focus to generate complex and simple sentences
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
The design of a computer language for linguistic information
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
Incorporating inheritance and feature structures into a Logic Grammar formalism
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
Parsing with discontinuous constituents
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
A structure-sharing representation for unification-based grammar formalisms
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Using restriction to extend parsing algorithms for complex-feature-based formalisms
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
A semantic-head-driven generation algorithm for unification-based formalisms
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
A generalization of the offline parsable grammars
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Memoization of coroutined constraints
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
The intersection of finite state automata and definite clause grammars
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Generalized chart algorithm: an efficient procedure for cost-based abduction
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics
Deductive parsing with multiple levels of representation
ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics
Chart parsing and constraint programming
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Japanese sentence analysis as argumentation
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
A simple transformation for offline-parsable grammars and its termination properties
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
Discourse, anaphora and parsing
COLING '86 Proceedings of the 11th coference on Computational linguistics
A uniform architecture for parsing and generation
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
A modular architecture for constraint-based parsing
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
Emergent parsing and generation with generalized chart
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
Using active constraints to parse GPSGs
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
A generalized Greibach Normal Form for definite clause grammars
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
Parsing schemata for grammars with variable number and order of constituents
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 2
Reversible unification based machine translation
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
Unification Grammars and Off-Line Parsability
Journal of Logic, Language and Information
Processing optimality-theoretic syntax by interleaved chart parsing and generation
ACL '00 Proceedings of the 38th Annual Meeting on Association for Computational Linguistics
New developments in parsing technology
Compiling Comp Ling: practical weighted dynamic programming and the Dyna language
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
Control strategies for parsing with freer word-order languages
CSLP '06 Proceedings of the Third Workshop on Constraints and Language Processing
Translation as weighted deduction
EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics
Charts, interaction-free grammars, and the compact representation of ambiguity
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
A formalism and environment for the development of a large grammar of English
IJCAI'87 Proceedings of the 10th international joint conference on Artificial intelligence - Volume 2
EMNLP '09 Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: Volume 1 - Volume 1
A tabular method for island-driven context-free grammar parsing
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 1
Towards general algorithms for grammatical inference
ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
Sense and deduction: the power of peewees applied to the Senseval-2 Swedish lexical sample task
SENSEVAL '01 The Proceedings of the Second International Workshop on Evaluating Word Sense Disambiguation Systems
Data-driven parsing using probabilistic linear context-free rewriting systems
Computational Linguistics
A variant of earley deduction with partial evaluation
RR'13 Proceedings of the 7th international conference on Web Reasoning and Rule Systems
| Hi-index | 0.05 |
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. The efficiency of this approach for an interesting class of grammars is discussed.