Factored A* Search for Models over Sequences and Trees
Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence. Pages 1246-1250.
Abstract
We investigate the calculation of A* bounds for sequence and tree models which are the explicit intersection of a set of simpler models or can be bounded by such an intersection. We provide a natural viewpoint which unifies various instances of factored A* models for trees and sequences, some previously known and others novel, including multiple sequence alignment, weighted finitestate transducer composition, and lexicalized statistical parsing. The specific case of parsing with a product of syntactic (PCFG) and semantic (lexical dependency) components is then considered in detail. We show that this factorization gives a modular lexicalized parser which is simpler than comparably accurate non-factored models, and which allows efficient exact inference with large treebank grammars.
@inproceedings{ijcai2003p177,
title = {Factored A* Search for Models over Sequences and Trees},
author = {Klein, Dan and Manning, Christopher D.},
booktitle = {Proceedings of the Eighteenth International Joint Conference on
Artificial Intelligence, {IJCAI-03}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Georg Gottlob},
pages = {1246--1250},
year = {2003},
url = {https://ijcai.org/proceedings/2003/177},
}
TY - CPAPER TI - Factored A* Search for Models over Sequences and Trees AU - Klein, Dan AU - Manning, Christopher D. T2 - Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, IJCAI-03 PB - International Joint Conferences on Artificial Intelligence PY - 2003 SP - 1246 EP - 1250 UR - https://ijcai.org/proceedings/2003/177 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
