1.1 --- a/core/sm_trie.cpp	Wed May 02 22:49:28 2007 +0000
     1.2 +++ b/core/sm_trie.cpp	Thu May 03 03:45:53 2007 +0000
     1.3 @@ -21,7 +21,7 @@
     1.4   * Double Array Trie algorithm, based on:
     1.5   * An Efficient Implementation of Trie Structures, by
     1.6   *  Jun-ichi Aoe and Katsushi Maromoto, and Takashi Sato
     1.7 - * from Sofiware - Practice and Experience, Vol. 22(9), 695-721 (September 1992)
     1.8 + * from Software - Practice and Experience, Vol. 22(9), 695-721 (September 1992)
     1.9   *
    1.10   *  A Trie is a simple data structure which stores strings as DFAs, with each 
    1.11   * transition state being a string entry.  For example, observe the following strings:
    1.12 @@ -47,7 +47,7 @@
    1.13   *
    1.14   *  BASE[] is an array where each member is a node in the Trie.  The node can either be UNUSED (empty), an ARC
    1.15   * (containing an offset to the next set of ARCs), or a TERMINATOR (contains the rest of a string).
    1.16 - * Each node has an index which must be interpeted based on the node type.  If the node is a TERMINATOR, then the
    1.17 + * Each node has an index which must be interpreted based on the node type.  If the node is a TERMINATOR, then the
    1.18   * index is an index into a string table, to find the rest of the string.  
    1.19   *  If the node is an ARC, the index is another index into BASE.  For each possible token that can follow the
    1.20   * current token, the value of those tokens can be added to the index given in the ARC.  Thus, given a current