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.