-
Notifications
You must be signed in to change notification settings - Fork 1
/
PermutationLattice.hpp
60 lines (51 loc) · 2.04 KB
/
PermutationLattice.hpp
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
/*
PermutationLattice.hpp
Copyright (c) [2012-], Josef Robert Novak
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted #provided that the following conditions
are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above
copyright notice, this list of #conditions and the following
disclaimer in the documentation and/or other materials provided
with the distribution.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
OF THE POSSIBILITY OF SUCH DAMAGE.
*
*/
#ifndef PERMUTATIONLATTICE_H
#define PERMUTATIONLATTICE_H
#include <fst/fstlib.h>
using namespace fst;
class PermutationLattice {
/*
Generate a lazy-evaluation cascade
to represent the set of permutations
for a set of words.
Each component is a counter-like linear
chain FST, which provides a very efficient
representation of the final result.
*/
public:
bool make_static;
int length;
map<int,int> counts;
vector<VectorFst<StdArc> > component_fsts;
vector<ComposeFst<StdArc> > cascade_fsts;
PermutationLattice( );
PermutationLattice( vector<int>* _tokens, bool _make_static );
void generate_component_fsts( );
};
#endif // PERMUTATIONLATTICE_H //