1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
|
#ifndef _FAST_INTERSECTOR_H_
#define _FAST_INTERSECTOR_H_
#include <memory>
#include <unordered_map>
#include <vector>
#include <boost/functional/hash.hpp>
using namespace std;
typedef boost::hash<vector<int> > VectorHash;
typedef unordered_map<vector<int>, vector<int>, VectorHash> Index;
class Phrase;
class PhraseLocation;
class Precomputation;
class SuffixArray;
class Vocabulary;
class FastIntersector {
public:
FastIntersector(shared_ptr<SuffixArray> suffix_array,
shared_ptr<Precomputation> precomputation,
shared_ptr<Vocabulary> vocabulary,
int max_rule_span,
int min_gap_size);
virtual ~FastIntersector();
virtual PhraseLocation Intersect(PhraseLocation& prefix_location,
PhraseLocation& suffix_location,
const Phrase& phrase);
protected:
FastIntersector();
private:
vector<int> ConvertPhrase(const vector<int>& old_phrase);
int EstimateNumOperations(const PhraseLocation& phrase_location,
bool has_margin_x) const;
PhraseLocation ExtendPrefixPhraseLocation(PhraseLocation& prefix_location,
const Phrase& phrase,
bool prefix_ends_with_x,
int next_symbol) const;
PhraseLocation ExtendSuffixPhraseLocation(PhraseLocation& suffix_location,
const Phrase& phrase,
bool suffix_starts_with_x,
int prev_symbol) const;
void ExtendPhraseLocation(PhraseLocation& location) const;
pair<int, int> GetSearchRange(bool has_marginal_x) const;
shared_ptr<SuffixArray> suffix_array;
shared_ptr<Vocabulary> vocabulary;
int max_rule_span;
int min_gap_size;
Index collocations;
};
#endif
|
