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 |
adaboost | |
adaboost::wr_holder | |
analysis | Class analysis stores a possible reading (lemma, PoS, probability) for a word |
automat | Abstract class to implement a Finite-State Automaton which is used by modules recognizing multiwords (dates, numbers, quantities, |
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_A_lemma | Ancestor lemma in list of lemmas (separator character is |) |
check_A_wordclass | Ancestor lemma belongs to a verb class |
check_and | And of basic contraints |
check_not | Negation |
check_S_category | Ancestor category |
check_S_lemma | Descendant lemma in list of lemmas (separator character is |) |
check_side | Descendant is to the right of its ancestor |
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 |
dataset | |
dataset::iterator | |
dataset::mlDatasetNode | |
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_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_info | Auxiliary class to store information about dependency building |
dep_tree | Class dep_tree stores a dependency tree |
dependencyMaker | DependencyMaker is a class for obtaining a dependency tree from chunks |
depLabeler | DepLabeler is class to set labels into a dependency tree |
depnode | Class denode stores nodes of a dependency tree and parse tree <-> deptree relations |
dictionary | The class dictionary implements dictionary search and suffix analysis for word forms |
document | Class document is a list of paragraphs |
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 | |
fex | |
FlexLexer | |
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 |
iFeature | |
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 |
map_input | |
map_input::const_iterator | |
mlABTree | |
mlOutput | |
mlOutput::label | |
multimap | |
nec | The class nec implements a ML-based NE classificator |
node | Class node stores nodes of a parse_tree Each node in the tree is either a label (intermediate node) or a word (leaf node) |
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_module | The abstract class numbers_module generalizes nummeric expression recognizer for different languages |
paragraph | Class paragraph is just a list of sentences that someone has validated it as a paragraph |
parse_tree | Class parse tree is used to store the results of parsing |
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_default | The derived class quantities_default implements a default quantities recognizer (only percentages are recognized) |
quantities_es | The derived class quantities_es implements a Spanish (and Catalan) quantities recognizer |
quantities_module | The abstract class quantities_module generalizes a percentage, ratios, and currency expression recognizer for different languages |
RegEx | Class RegEx, a simple and small API wrapper for PCRE |
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 |
RGF | |
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 |
senses | Class senses implements a sense annotator |
Sensor | |
SensorCheckMwRE | |
SensorCheckRE | |
SensorData | |
SensorMap | |
SensorMatchRE | |
SensorSet | |
SensorSetPart | |
sentence | Class sentence is just a list of words that someone (the splitter) has validated it as a complete sentence |
set_input | |
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 |
suffixes | Class suffixes implements suffixation rules and dictionary search for suffixed word forms |
sufrule | Class sufrule contains a suffixation 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 | Class traces implements trace and error handling utilities |
tree< T > | |
tree< T >::generic_iterator | |
tree< T >::preorder_iterator | Traverse the tree in preorder (parent first, then children) |
tree< T >::sibling_iterator | Traverse all children of the same node |
util | Class util implements some utilities for NLP analyzers: "tolower" for latin alfabets, parole tags manipulation, string2number and viceversa conversions, etc |
vector | |
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 |
word | Class word stores all info related to a word: form, list of analysis, list of tokens (if multiword) |
yyFlexLexer | |