Sennrich, Rico

While CYK+ and Earley-style variants are popular algorithms for decoding unbinarized SCFGs, in particular for syntax-based Statistical Machine Translation, the algorithms rely on a so-called dot chart which suffers from a high memory consumption. We propose a recursive variant of the CYK+ algorithm that eliminates the dot chart, without incurring an increase in time complexity for SCFG decoding. In an evaluation on a string-to-tree SMT scenario, we empirically demonstrate substantial improvements in memory consumption and translation speed

Edinburgh Research Explorer

A CYK+ Variant for SCFG Decoding Without a Dot Chart

https://www.pure.ed.ac.uk/ws/files/20037571/W14_4011.pdf

A CYK+ Variant for SCFG Decoding Without a Dot Chart

Abstract

Similar works

Full text

Available Versions

Edinburgh Research Explorer