Watson uses the same technology as the Fresno design, except the Fresno design is meant to be a uniform graph pattern matching instruction upon which applications are built. Watson is the complete system.
How would the semantic processor be ganged up to make a Watson?
A question and an answer are a Qson bundle, a complete nested store of an ontological word graph. Basically, ship the thing around and try various pattern matches (read graph convolutions) on the fixed set of Qson bundles in the database. Depending upon the goal of the quest, the matching conditions can be altered, it is all in the pass, match and collect portion of query by example. The Fresno desing is duplicated in hundreds of Linux machines passing around Qsons. The match conditions are a small few lines of alterable code, depending upon the query, the match criteria changes. The the main process is one of storing, passing and convolving with a uniform nested store, the Qson.
No comments:
Post a Comment