A* search via approximate factoring

Authors:
Aria Haghighi;John DeNero;Dan Klein
Affiliations:
Computer Science Division, University of California, Berkeley;Computer Science Division, University of California, Berkeley;Computer Science Division, University of California, Berkeley
Venue:
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Year:
2007

Citing 6
Cited 0

Stochastic inversion transduction grammars and bilingual parsing of parallel corpora

Computational Linguistics
Convex Optimization

Convex Optimization
Improved statistical alignment models

ACL '00 Proceedings of the 38th Annual Meeting on Association for Computational Linguistics
Generalized multitext grammars

ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Efficient search for Inversion Transduction Grammar

EMNLP '06 Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing
Factored A* search for models over sequences and trees

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a novel method for creating A* estimates for structured search problems originally described in Haghighi, DeNero, & Klein (2007). In our approach, we project a complex model onto multiple simpler models for which exact inference is efficient. We use an optimization framework to estimate parameters for these projections in a way which bounds the true costs. Similar to Klein & Manning (2003), we then combine completion estimates from the simpler models to guide search in the original complex model. We apply our approach to bitext parsing and demonstrate its effectiveness.