Resolvable semantic type and resolvable semantic type resolution
First Claim
Patent Images
1. A system for developing natural language enabled software applications comprising:
- resolvable types comprising abstract representations of linguistic elements and interrelationships between linguistic elements of a natural language input; and
resolution semantics defining procedural rules for resolving validity of instances of the resolvable types in a natural language enabled software application.
1 Assignment
0 Petitions
Accused Products
Abstract
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.
-
Citations
37 Claims
-
1. A system for developing natural language enabled software applications comprising:
-
resolvable types comprising abstract representations of linguistic elements and interrelationships between linguistic elements of a natural language input; and
resolution semantics defining procedural rules for resolving validity of instances of the resolvable types in a natural language enabled software application. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A method for determining validity of an instantiation of a resolvable type in a natural language enabled software program comprising:
-
assembling a proposed interpretation list comprising proposed interpretations of a natural language input, each proposed interpretation comprising one or more commands and optionally non-command elements mapped to resolvable types; and
determining validity of an instantiation associated with each proposed interpretation in the natural language enabled software application. - View Dependent Claims (10, 11, 12, 13)
-
-
14. A set of resolvable types adapted to model semantics of a natural language for natural language programming, the set of resolvable types comprising:
-
a command type adapted to model commands in a natural language input; and
a restriction host type adapted to represent non-command elements of the natural language input, the restriction host type adapted to associate to selected command types or to other restriction host types that are transitively associated with a selected command type based on the natural language input, the restriction host type adapted to host constraints of the selected command types at runtime. - View Dependent Claims (15, 16, 17, 18, 19, 20, 21, 22, 23, 24)
-
-
25. A set of resolvable types adapted to model semantics of a natural language for natural language programming, the set of resolvable types comprising:
-
a command type adapted to model commands in a natural language input; and
a restriction host type adapted to represent non-command elements of the natural language input, the restriction host type adapted to host constraints of the selected command types at runtime. - View Dependent Claims (26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37)
-
Specification