SCI Parser Programmer's Reference/Said Spec Trees
Author: Pablo Ghenis
Said Spec Trees:
When a spec is processed, it is turned into a tree that can be compared with the user parse tree. Since the spec IS a structural specification, the mapping is straightforward. It is important to keep these mappings in mind though, because our goal is to imagine the structure of possible user input trees and create specs that match them closely enough for the similarity to be recognized by the matcher.
At the top level there are three possible "slots" to fill: verb, dobj and iobj. At lower levels the only slots to be filled are ROOT and MOD(ifier). Alternatives and optionals generate OR and OPT nodes with the appropriate children nodes under them.
'start,(turn<on)[/car]' generates the following tree:
Code:(root s (root verb (or (root verb . 'start') (root (root verb . 'turn') (mod prep . 'on') ) ) ) (opt (dobj np (root noun . 'car') ) ) )