| 68 | | to be described... |
| | 68 | The SET system consists of several Python modules: |
| | 69 | |
| | 70 | * {{{grammar}}} -- loading, organizing and parsing of rules sets, definition of the {{{Rule}}} a {{{Grammar}}} class. |
| | 71 | |
| | 72 | * {{{token}}} -- definition of the {{{Token}}} class (and its derivatives) representing a single word/token. |
| | 73 | |
| | 74 | * {{{segment}}} -- input parsing, definition of the {{{Segment}}} class representing the input sentence (a list of {{{Token}}} objects). |
| | 75 | |
| | 76 | * {{{matcher}}} -- definition of the {{{Match}}} and {{{Matcher}}} class. A {{{Match}}} objects represents a rule realization, whereas {{{Matcher}}} searches for possible matches on a given segment. |
| | 77 | |
| | 78 | * {{{parser}}} -- implements the parsing procedure itself ({{{Parser}}} class) including ranking functions. |
| | 79 | |
| | 80 | * {{{tree_view}}} -- implements displaying graphical output of trees. |
| | 81 | |
| | 82 | * {{{utils}}} -- contains several helper functions. |
| | 83 | |
| | 84 | * {{{set}}} -- represents the main module. |
| | 85 | |
| | 86 | |
