#include <relax_tagger.h>
Inheritance diagram for relax_tagger:
Public Member Functions | |
relax_tagger (const string &, int, double, double, bool) | |
Constructor, given the constraints file and config parameters. | |
void | analyze (list< sentence > &) |
analyze sentences with default options | |
list< sentence > | analyze (const list< sentence > &) |
analyze sentences, return analyzed copy | |
Private Member Functions | |
bool | CheckCondition (const sentence &, sentence::const_iterator, int, const condition &, list< list< pair< int, int > > > &) const |
check a condition of a RuleCG. | |
bool | CheckWordMatchCondition (const list< string > &, bool, int, sentence::const_iterator, list< pair< int, int > > &) const |
check whether a word matches a simple list of terms. | |
bool | check_possible_matching (const string &, word::const_iterator, sentence::const_iterator) const |
check whether a word matches one of all possible condition patterns | |
bool | check_match (const string &, const string &) const |
check a match of two literals, taking into account lemma, tag, wildcards, etc. | |
Private Attributes | |
relax | solver |
Generic solver instance. | |
constraint_grammar | c_gram |
PoS constraints. |
It does so using the generic solver implemented by class relax.
|
Constructor, given the constraints file and config parameters.
|
|
analyze sentences, return analyzed copy
|
|
analyze sentences with default options
Implements POS_tagger. |
|
check a match of two literals, taking into account lemma, tag, wildcards, etc.
|
|
check whether a word matches one of all possible condition patterns
|
|
check a condition of a RuleCG. Add to the given constraint& solver-encoded constraint info for the condition |
|
check whether a word matches a simple list of terms. Return (via list<pair<int,int>>&) a solver-encoded term for the condition |
|
PoS constraints.
|
|
Generic solver instance.
|