accents | The class accents provides a wrapper to transparently create and access an accents_module to handle accentuation for the appropriate language |
accents_default | Derived accents_module for null accentuation (eg english) |
accents_es | Derived accents_module for Spanish accentuation |
accents_module | The abstract class accents_module generalizes accentuation rules for different languages |
affixes | Class suffixes implements suffixation rules and dictionary search for suffixed word forms |
aligner< T > | |
aligner< T >::alin | |
automat | Abstract class to implement a Finite-State Automaton which is used by modules recognizing multiwords (dates, numbers, quantities, |
bioner | The class bioner implements an AdaBoost-Based NE recognizer |
cell | Class cell stores all information in a chart cell |
chart | Class chart contains an array of cells that constitute a chart |
chart_parser | Class chart_parser implements a chart parser |
check_and | The following classes are implementations of different constraints |
check_asynon | Lemma or any ancestor has given synonym |
check_category | Check category category |
check_lemma | Find lemma in list of lemmas (separator character is |) |
check_not | Negation |
check_pos | Match pos against regexp |
check_semfile | Lemma has given WN semantic file |
check_side | Side of descendant respect to ancestor (or viceversa) |
check_synon | Lemma has given synonym |
check_tonto | Lemma has given top ontology class |
check_wordclass | Lemma belongs to a class |
simplesearch::comparator | |
completer | The class completer implements a parse tree completer, which given a partial parse tree (chunker output), completes the full parse according to some grammar rules |
completerRule | The class completerRule stores rules used by the completer of parse trees |
condition | Class condition implements a condition of a CG rule |
constraint | The class constraint implements a constraint for the relaxation labelling algorithm |
constraint_grammar | Class constraint_grammar implements a pseudo CG, ready to be used from a relax PoS tagger |
coref | The class coref implements a ML-based coreference classificator |
coref_fex | Class for the feature extractor |
corrector | |
database | Class to wrap a berkeley DB database and unify access |
dates | The class dates provides a wrapper to transparently create and access a dates_module, a temporal expression recognizer for the appropriate language |
dates_ca | The derived class dates_ca implements a Catalan date/time recognizer |
dates_default | The derived class dates_default implements a default date/time recognizer (only simple patterns are recognized) |
dates_en | The derived class dates_en implements an English date/time recognizer |
dates_es | The derived class dates_es implements a Spanish date/time recognizer |
dates_module | The abstract class dates_module generalizes temporal expression recognizer for different languages |
dep_txala | DependencyMaker is a class for obtaining a dependency tree from chunks |
dependency_parser | The class dependency_parser is just an abstract class generalizing any dependency parser |
depLabeler | DepLabeler is class to set labels into a dependency tree |
dictionary | The class dictionary implements dictionary search and suffix analysis for word forms |
disambiguator | |
edge | Class edge stores all information in a chart edge |
emission_states | The class emission_states stores the list of states in the HMM that *may* be generating a given word given the two previous words (and their valid tags) |
EXAMPLE | Struct of an example (contains two samples) |
FlexLexer | |
golem | |
grammar | Class grammar implements a CFG, ready to be used from a chart parser |
hmm_tagger | The class hmm_tagger implements the syntactic analyzer and is the main class, which uses all the others |
label | The class label stores all information related to a variable label in the relaxation labelling algorithm |
list | |
locutions | Class locutions recognizes multiwords belonging to a list obtained from a configuration file |
maco | Class maco implements the morphological analyzer, which uses all the specific analyzers: dates, numbers, dictionary, etc |
maco_options | Class maco_options implements a set of specific options of the morphological analyzer |
multimap | |
nec | The class nec implements a ML-based NE classificator |
ner | The class ner is an abstract class that implements a general NE Recognizer |
np | The class np implements a dummy proper noun recognizer |
numbers | Class numbers implements a wrapper to transparently create and access a numbers_module number recognizer for the appropriate language |
numbers_ca | The derived class numbers_ca implements a Catalan number recognizer |
numbers_default | The derived class numbers_default implements a default number recognizer (only numbers in digits are recognized) |
numbers_en | The derived class numbers_en implements an English number recognizer |
numbers_es | The derived class numbers_es implements a Spanish number recognizer |
numbers_gl | The derived class numbers_ca implements a Galician number recognizer |
numbers_it | The derived class numbers_it implements a Italian number recognizer |
numbers_module | The abstract class numbers_module generalizes nummeric expression recognizer for different languages |
ph_rule | Auxiliar class to store a phonetic change rule |
phd< T > | |
phoneticDistance | This class is wrapper to calculate the phonetic distance between two words |
phonetics | This class is a will calculate the phonetic translation of a word |
POS_tagger | The class POS_tagger is just an abstract class generalizing a PoS tagger |
probabilities | Class probabilities sets lexical probabilities for each PoS tag of each word in a sentence |
problem | The class problem stores the structure of a problem, namely, a vector with a position for each variable to consider, and for each variable, a list of initial weights for each possible label |
punts | Class numbers implements a punctuation sign recognizer |
quantities | Class quantities implements a wrapper to transparently create and access a quantities_module monetary expressions detector for the appropriate language |
quantities_ca | The derived class quantities_ca implements a Catalan quantities recognizer |
quantities_default | The derived class quantities_default implements a default quantities recognizer (only percentages are recognized) |
quantities_en | The derived class quantities_en implements an English quantities recognizer |
quantities_es | The derived class quantities_es implements a Spanish quantities recognizer |
quantities_gl | The derived class quantities_gl implements a Galician quantities recognizer |
quantities_module | The abstract class quantities_module generalizes a percentage, ratios, and currency expression recognizer for different languages |
relax | The class relax implements a generic solver for consistent labelling problems, using relaxation labelling algorithm |
relax_tagger | The class relax_tagger implements a PoS tagger based on relaxation labelling algorithm |
rule | Class rule implements a rule of a grammar |
rule_expression | The class rule_expression is an abstract class (interface) for building dynamic restriction on a ruleLabeler which are used by class depLabeler |
ruleCG | Class rule implements a rule of a CG |
ruleLabeler | RuleLabeler is an auxiliary class for the depLabeler |
SAMPLE | Struct that contains one sample |
semanticDB | Class semanticDB implements a semantic DB interface |
sense_info | Class sense_info stores several semantic info about a sense |
senses | Class senses implements a sense annotator |
set | |
setCG | Auxiliary class to store sets defined in the CG |
similarity | This class calculate the similarity between two words |
simplesearch | |
soundChange | This class is a sound change applier |
splitter | Class splitter implements a sentence splitter, which accumulates lists of words until a sentence is completed, and then returns a list of sentence objects |
golem::state | |
sufrule | Class sufrule contains an affixation rule, and is used by class suffixes |
tokenizer | Class tokenizer implements a token splitter, which converts a string into a sequence of word objects, according to a set of tokenization rules read from aconfiguration file |
traces | MOD_TRACECODE and MOD_TRACENAME are empty |
vector | |
vis_viterbi | The class vis_viterbi implements the viterbi algorithm given the weights of different labels, without hidden information |
viterbi | The class viterbi stores the two maps for each observation: The delta map stores the maximum probability for each state in that observation, the phi map stores the backpath to maximize the probability |
yyFlexLexer | |