1 #ifndef __ZGEN_BESTFIRST_SEARCH_SPAN_FACTORY_H__
2 #define __ZGEN_BESTFIRST_SEARCH_SPAN_FACTORY_H__
28 std::vector<Span *>& spans);
39 std::vector<Span *>& spans);
66 const Span* modifier)
const;
78 const Span* modifier)
const;
80 typedef std::vector<int> edges_t;
93 Span* create_gold_spans_from_reference_travel(
int now,
96 const std::vector< edges_t>& left_modifiers_tree,
97 const std::vector< edges_t>& right_modifiers_tree,
109 #endif // end for __ZGEN_BESTFIRST_SEARCH_SPAN_FACTORY_H__
void create_gold_spans_from_reference(const dependency_t *input, const dependency_t *reference, SpanSet &spans)
Definition: span_factory.cc:86
virtual bool legal_to_left_combine(const Span *head, const Span *modifier) const
Definition: span_factory.cc:186
SpanFactory(const Knowledge::PostagConstrain *constrain, SpanAllocator *allocator)
Definition: span_factory.cc:15
boost::unordered_set< Span *, SpanPtrHash, SpanPtrEqual > SpanSet
Definition: span_types.h:12
Definition: instance.h:18
Definition: postag_constrain.h:14
void create_spans_from_chart(const Span *span, const SpanKMaxHeap *charts, std::vector< Span * > &spans)
Definition: span_factory.cc:47
virtual bool legal_to_right_combine(const Span *head, const Span *modifier) const
Definition: span_factory.cc:195
Definition: span_allocator.h:27
Definition: span_types.h:18
Definition: span_factory.h:15
void create_initial_spans_from_input(const dependency_t *input_ref, std::vector< Span * > &spans)
Definition: span_factory.cc:22