TAILIEUCHUNG - Báo cáo khoa học: "Hierarchical A∗ Parsing with Bridge Outside Scores"

Hierarchical A∗ (HA∗ ) uses of a hierarchy of coarse grammars to speed up parsing without sacrificing optimality. HA∗ prioritizes search in refined grammars using Viterbi outside costs computed in coarser grammars. We present Bridge Hierarchical A∗ (BHA∗ ), a modified Hierarchial A∗ algorithm which computes a novel outside cost called a bridge outside cost. | Hierarchical A Parsing with Bridge Outside Scores Adam Pauls and Dan Klein Computer Science Division University of California at Berkeley adpauls klein @ Abstract Hierarchical A HA uses of a hierarchy of coarse grammars to speed up parsing without sacrificing optimality. HA prioritizes search in refined grammars using Viterbi outside costs computed in coarser grammars. We present Bridge Hierarchical A BHA a modified Hierarchial A algorithm which computes a novel outside cost called a bridge outside cost. These bridge costs mix finer outside scores with coarser inside scores and thus constitute tighter heuristics than entirely coarse scores. We show that BHA substantially outperforms HA when the hierarchy contains only very coarse grammars while achieving comparable performance on more refined hierarchies. 1 Introduction The Hierarchical A HA algorithm of Felzen-szwalb and McAllester 2007 allows the use of a hierarchy of coarse grammars to speed up parsing without sacrificing optimality. Pauls and Klein 2009 showed that a hierarchy of coarse grammars outperforms standard A parsing for a range of grammars. HA operates by computing Viterbi inside and outside scores in an agendabased way using outside scores computed under coarse grammars as heuristics which guide the search in finer grammars. The outside scores computed by HA are auxiliary quantities useful only because they form admissible heuristics for search in finer grammars. We show that a modification of the HA algorithm can compute modified bridge outside scores which are tighter bounds on the true outside costs in finer grammars. These bridge outside scores mix inside and outside costs from finer grammars with inside costs from coarser grammars. Because the bridge costs represent tighter estimates of the true outside costs we expect them to reduce the work of computing inside costs in finer grammars. At the same time because bridge costs mix computation from coarser and finer levels of the .

TỪ KHÓA LIÊN QUAN
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.