A system for developing natural language enabled software applications is described. Resolvable types define abstract representations of linguistic elements and interrelationships between linguistic elements of a natural language input. Resolution semantics define procedural rules for resolving validity of the resolvable types in a natural language enabled software application.

 
Web www.patentalert.com

< System and method for SIMD code generation for loops with mixed data lengths

< Combinational circuit, and encoder, decoder and semiconductor device using this combinational circuit

> Method, program product, and processing system for performing object editing through implicit object selection

> Efficient construction of pruned SSA form
~ 00225