This paper is a discussion of the technical issues and solutions encountered in making the ASK System transportable. A natural language system can be “transportable” in a number of ways. Although transportability to a new domain is most prominent, other ways are also important if the system is to have viability in the commercial marketplace. On the one hand, transporting a system to a new domain may start with the system prior to adding any domain of knowledge and extend it to incorporate the new domain. On the other hand, one may wish to add to a system that already has knowledge of one domain the knowledge concerning a second domain, that is, to extend the system to cover this second domain. In the context of ASK, it has been natural to implement extending and then achieve transportability as a special case. In this paper, we consider six ways in which the ASK System can be extended to include new capabilities: Special-purpose applications, such as those to accommodate standard office tasks, would make use of these various means of extension.

Article Free Access Share on Solutions to issues depend on the knowledge representation Author: Frederick B. Thompson California Institute of Technology, Pasadena, California California Institute of Technology, Pasadena, CaliforniaView Profile Authors Info & Claims ACL '82: Proceedings of the 20th annual meeting on Association for Computational LinguisticsJune 1982 Pages 169–171https://doi.org/10.3115/981251.981298Online:16 June 1982Publication History 0citation121DownloadsMetricsTotal Citations0Total Downloads121Last 12 Months29Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

Motion picture films generated by computers have now been produced by a number of groups across the country. We wish to report here on the design and implementation of the REL Animated Film Language (AFL), designed primarily for use by artists interested in the aesthetics of abstract motion graphics. The language is simple enough to be used by the artist directly, rather than by a professional programmer acting for the artist. It provides convenient means of expressing spatial and temporal changes in the shape and location of the objects with which the artist constructs his compositions. The artist uses the language to express the inter-object relationships which embody the aesthetic content of the work.

Ambiguity is a pervasive and important aspect of natural language. Ambiguities, which are disambiguated by context, contribute powerfully to the expressiveness of natural language as compared to formal languages. In computational systems using natural language, problems of properly controlling ambiguity are particularly large, partially because of the necessity to circumvent parsings due to multiple orderings in the application of rules.Features, that is, subcategorizations of parts-of-speech, constitute an effective means for controlling syntactic ambiguity through ordering the hierarchical organization of syntactic constituents. This is the solution adopted for controlling ambiguity in REL English, which is part of the REL (Rapidly Extensible Language) System. REL is a total software system for facilitating man/machine communications. The efficiency of processing natural language in REL English is achieved both by the detailed syntactic aspects which are incorporated into the REL English grammar, and by means of the particular implementation for processing features in the parsing algorithm.