{"type":"ScholarlyArticle","title":"Factored A* Search for Models over Sequences and Trees","authors":[{"name":"Dan Klein","slug":"dan-klein","given":"Dan","family":"Klein","affiliation":""},{"name":"Christopher D. Manning","slug":"christopher-d-manning","given":"Christopher D.","family":"Manning","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/2003/177","pdf":"https://ijcai.org/proceedings/2003/0177.pdf","markdown":"https://ijcai.org/proceedings/2003/177.md","bibtex":"https://ijcai.org/proceedings/2003/bibtex/177","volume":{"slug":"2003","title":"Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2003","url":"https://ijcai.org/proceedings/2003/","year":2003,"location":"Acapulco, Mexico","dates":"","editors":"Georg Gottlob","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":177,"pages":{"first":1246,"last":1250},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}