Báo cáo khoa học: Quadratic-Time Dependency Parsing for Machine Translation

Efficiency is a prime concern in syntactic MT decoding, yet significant developments in statistical parsing with respect to asymptotic efficiency haven’t yet been explored in MT. Recently, McDonald et al. (2005b) formalized dependency parsing as a maximum spanning tree (MST) problem, which can be solved in quadratic time relative to the length of the sentence. They show that MST parsing is almost as accurate as cubic-time dependency parsing in the case of English, and that it is more accurate with free word order languages. ...
Nội dung trích xuất từ tài liệu:
Báo cáo khoa học: "Quadratic-Time Dependency Parsing for Machine Translation"