-
Notifications
You must be signed in to change notification settings - Fork 0
/
decoding.h
30 lines (27 loc) · 1.16 KB
/
decoding.h
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
// Copyright (c) 2012-2015 Andre Martins
// All Rights Reserved.
//
// This file is part of TurboParser 2.3.
//
// TurboParser 2.3 is free software: you can redistribute it and/or modify
// it under the terms of the GNU Lesser General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// TurboParser 2.3 is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public License
// along with TurboParser 2.3. If not, see <http://www.gnu.org/licenses/>.
#include <iostream>
#include <vector>
// Decoder for the basic model; it finds a maximum weighted arborescence
// using Edmonds' algorithm (which runs in O(n^2)).
void c_chu_liu_edmonds(
std::vector<bool> *disabled,
std::vector<std::vector<int> > *candidate_heads,
std::vector<std::vector<double> > *candidate_scores,
std::vector<int> *heads,
double *value);