Generalized chart algorithm: an efficient procedure for cost-based abduction

Authors:
Yasuharu Den
Affiliations:
ATR Interpreting Telecommunications Research Laboratories, Hikaridai, Seika-cho, Soraku-gun, Kyoto, Japan
Venue:
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Year:
1994

Citing 5
Cited 3

An overview of head-driven bottom-up generation

Current research in natural language generation
Parsing as deduction

ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
Head corner parsing for discontinuous constituency

ACL '91 Proceedings of the 29th 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
Interpretation as abduction

ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics

Reversible delayed lexical choice in a bidirectional framework

COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
Approximating cost-based abduction is NP-hard

Artificial Intelligence
Explaining genetic knock-out effects using cost-based abduction

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an efficient procedure for cost-based abduction, which is based on the idea of using chart parsers as proof procedures. We discuss in detail three features of our algorithm --- goal-driven bottom-up derivation, tabulation of the partial results, and agenda control mechanism --- and report the results of the preliminary experiments, which show how these features improve the computational efficiency of cost-based abduction.