In file ../include/EST_SCFG.h:

## class EST_bracketed_string

> This class represents a bracted string used in training of SCFGs.

### Public Methods

  | EST_bracketed_string ()
  | EST_bracketed_string (LISP string)
  | ~EST_bracketed_string ()
  void | set_bracketed_string (LISP string)
  int | length () const
  LISP | string () const
  const EST_String | symbol_at (int i) const The nth symbol in the string
  int | valid (int i, int k) const If a bracketing from i to k is valid in string
  int | operator != (const EST_bracketed_string &a) const
  | (void)

## Documentation

> 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(LISP string)`

`~EST_bracketed_string()`

`void set_bracketed_string(LISP string)`

`int length() const`

`LISP string() const`

`const EST_String symbol_at(int i) const`
  The nth symbol in the string

`int valid(int i, int k) const`
  If a bracketing from i to k is valid in string

`int operator !=(const EST_bracketed_string &a) const`

`(void)`

This class has no child classes.

Friends:
  ostream& operator << (ostream &s, const EST_bracketed_string &a)

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