mirror of
https://github.com/moses-smt/mosesdecoder.git
synced 2024-12-29 06:52:34 +03:00
5240c430ce
This adds a new string-to-tree decoder, which can be enabled with the -s2t option. It's intended to be faster and simpler than the generic chart decoder, and is designed to support lattice input (still WIP). For a en-de system trained on WMT14 data, it's approximately 40% faster in practice. For background information, see the decoding section of the EMNLP tutorial on syntax-based MT: http://www.emnlp2014.org/tutorials/5_notes.pdf Some features are not implemented yet, including support for internal tree structure and soft source-syntactic constraints.
25 lines
362 B
C++
25 lines
362 B
C++
#pragma once
|
|
|
|
namespace Moses
|
|
{
|
|
namespace Syntax
|
|
{
|
|
|
|
class RuleTableFF;
|
|
|
|
// Base class for any data structure representing a synchronous
|
|
// grammar, like a trie (for S2T) or a DFA (for T2S).
|
|
class RuleTable
|
|
{
|
|
public:
|
|
RuleTable(const RuleTableFF *ff) : m_ff(ff) {}
|
|
|
|
virtual ~RuleTable() {}
|
|
|
|
protected:
|
|
const RuleTableFF *m_ff;
|
|
};
|
|
|
|
} // Syntax
|
|
} // Moses
|