 
 
	 
In file ../include/EST_SCFG.h:
| class EST_bracketed_string | 
This class represents a bracted string used in training of SCFGs.
| ![[more]](icon1.gif)  | EST_bracketed_string () | 
| ![[more]](icon1.gif)  | EST_bracketed_string (LISP string) | 
| ![[more]](icon1.gif)  | ~EST_bracketed_string () | 
| ![[more]](icon1.gif) void | set_bracketed_string (LISP string) | 
| ![[more]](icon1.gif) int | length () const | 
| ![[more]](icon1.gif) LISP | string () const | 
| ![[more]](icon1.gif) const EST_String | symbol_at (int i) const The nth symbol in the string | 
| ![[more]](icon1.gif) int | valid (int i, int k) const If a bracketing from i to k is valid in string | 
| ![[more]](icon1.gif) int | operator != (const EST_bracketed_string &a) const | 
| ![[more]](icon1.gif)  | (void) | 
This class represents a bracted string used in training of SCFGs.An object in this class builds an index of valid bracketing of the string. Thus offering both a tree like access and direct access to the leafs of the tree. The definition of ``valid bracketing'' is any substring
that doesn't cross any brackets. 
 EST_bracketed_string()
 EST_bracketed_string()
 EST_bracketed_string(LISP string)
 EST_bracketed_string(LISP string)
 ~EST_bracketed_string()
 ~EST_bracketed_string()
 void set_bracketed_string(LISP string)
void set_bracketed_string(LISP string)
 int length() const
int length() const 
 LISP string() const
LISP string() const 
 const EST_String symbol_at(int i) const
const EST_String symbol_at(int i) const 
 int valid(int i, int k) const
int valid(int i, int k) const 
 int operator !=(const EST_bracketed_string &a) const
int operator !=(const EST_bracketed_string &a) const 
 (void)
 (void)
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