Providing a personal assistant module with a selectively-traversable state machine
AssigneeGoogle Inc.
InventorsAdrian Diaconu, Jing Qian, Jack Whyte, Ning Ma, Shir Yehoshua
Life of this patent
Estimating the term…
Loading patent…
AssigneeGoogle Inc.
InventorsAdrian Diaconu, Jing Qian, Jack Whyte, Ning Ma, Shir Yehoshua
Estimating the term…
Techniques are described herein for leveraging an online semantic processor to generate a finite state machine to be delivered to and implemented on a resource-constrained device. In various implementations, a user request may be received by a personal assistant module. Data indicative of the user request may be uploaded, e.g., by the personal assistant module, to an online semantic processor. Data may be received, e.g., by the personal assistant module, from the online semantic processor. The received data may represent a state machine having a plurality of candidate states of the personal assistant module. Each candidate state may be potentially responsive to the request. Resources local to the resource-constrained device may be analyzed to ascertain signal(s) unavailable to the online semantic processor. The personal assistant module may then transition to a given state of the plurality of candidate states. The given state may be selected based on the signal(s).
A method implemented using one or more processors, comprising:
At least one non-transitory computer-readable medium comprising instructions that, in response to execution of the instructions by one or more processors, cause the one or more processors to perform the following operations:
A resource-constrained device comprising one or more processors and memory storing instructions that, in response to execution of the instructions by the one or more processors, cause the one or more processors to:
Dependencies are inferred from the claim text.