Fleet
0.0.9
Inference in the LOT
|
A tree stores sentences that we use here. You provide S-expressions like "(S (NP he.1) (VP (V saw)) (NP >himself.1))" Here each string and part of speech (S, NP, he, saw, etc.) is stored as a "label". More...
#include <string>
#include <vector>
#include <assert.h>
#include <set>
#include <map>
#include <functional>
#include "BaseNode.h"
#include "SExpression.h"
Go to the source code of this file.
Classes | |
class | BindingTree |
Enumerations | |
enum | POS { POS::None, POS::S, POS::SBAR, POS::NP, POS::NPS, POS::NPO, POS::NPPOSS, POS::VP, POS::MD, POS::PP, POS::CP, POS::CC, POS::N, POS::V, POS::P, POS::A } |
Functions | |
std::string | str (BindingTree *t) |
Variables | |
std::map< std::string, POS > | posmap |
A tree stores sentences that we use here. You provide S-expressions like "(S (NP he.1) (VP (V saw)) (NP >himself.1))" Here each string and part of speech (S, NP, he, saw, etc.) is stored as a "label".
|
strong |
std::string str | ( | BindingTree * | t | ) |
std::map<std::string,POS> posmap |