In file ../include/EST_simplestats.h:
class EST_Discrete |
A class for managing mapping string names to integers and back again, mainly used for representing alphabets in n-grams and grammars etc.
| EST_Discrete () | |
| EST_Discrete (const EST_Discrete &d) | |
| EST_Discrete (const EST_StrList &vocab) Initialise discrete class from given list of strings | |
| ~EST_Discrete () | |
| copy (const EST_Discrete &d) | |
| init (const EST_StrList &vocab) (re-)initialise | |
| length (void) const The number of members in the discrete | |
| index (const EST_String &n) const The int assigned to the given name, if it doesn't exists p_def_val is returned (which is -1 by default) | |
| name (const int n) const The name given the index | |
| def_val (const EST_String &v) set the default value when a name isn't found (-1 by default) | |
| name (const EST_String &n) const An alternative method for getting the int form the name | |
| operator = (const EST_Discrete &a) |
A class for managing mapping string names to integers and back again, mainly used for representing alphabets in n-grams and grammars etc.This offers an efficient way of mapping a known set of string names to integers. It is initialised from a list of names and builds a index of those names to a set of integers.
Alphabetic index HTML hierarchy of classes or Java
This page is part of the
Edinburgh Speech Tools Library documentation
Copyright University of Edinburgh 1997
Contact:
speech_tools@cstr.ed.ac.uk