skip to main content
article
Free access

ASK is transportable in half a dozen ways

Published: 01 April 1985 Publication History

Abstract

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:
to a new domain,
to a new object type,
to access data from a foreign database,
to a new natural language,
to a new programming language,
to a new computer family.
Special-purpose applications, such as those to accommodate standard office tasks, would make use of these various means of extension.

References

[1]
BRACHMAN, R.J. On the epistemological status of semantic networks. In Associative Networks, N. V. Findler, Ed. Academic Press, Orlando, Fla., 1979, pp. 3-50.
[2]
GROSZ, B.J. TEAM, a transportable natural language interface system. In Proceedings of the Conference on Applied Natural Language Processing (Santa Monica). Association for Computational Linguistics and Naval Research Laboratory, 1983, pp. 39-45.
[3]
Ho, T.P. The dialogue designing dialogue. Ph.D. dissertation, California Institute of Technology, 1984.
[4]
MARTIN, W.A. Roles, co-descriptors and formal representation of quantified English expressions. Laboratory .for Computer Science, MIT, Cambridge, Mass.
[5]
PAPACHRISTIDIS, A.C. Heterogeneous data base access. Ph.D. dissertation, California Institute of Technology, 1984.
[6]
SANOU}LLET, R. ASK French, a French natural language syntax. Master's thesis, California Institute of Technology, 1984.
[7]
THOMPSON, B. H., AND THOMPSON, F.B. Shifting to a higher gear in a natural language system. In Proceedings of the 1981 National Computer Conference (Chicago, May 4-7). AFIPS Press, Reston, Va., 1981, pp. 657-662.
[8]
THOMPSON, B. H., AND THOMPSON, F.B. Introducing ASK: A simple knowledgeable system. In Proceedings of the Conference on Applied Natural Language Processing, (Santa Monica). Association for Computational Linguistics and Naval Research Laboratory, 1983, pp. 17-24.
[9]
THOMPSON, B. H., AND THOMPSON, F.B. ASK as window to the world. In Proceedings of the International Conference on Systems, Man and Cybernetics (Bombay and Dehli). IEEE, New York, 1984, pp. 1014-1018.
[10]
THOMPSON, B. H., AND THOMPSON, F.B. Customizing one's own interface using English as primary language. In Proceedings of the South East Asia Regional Computer Conference (Hong Kong). Hong Kong Computer Society, 1984, pp. 15.1-15.16.
[11]
THOMPSON, n. H., AND THOMPSON, F.B. How to get a large natural language system into a PC. In Proceedings of the National Computer Conference (Chicago, July 15-18). AFIPS Press, Reston, Va., to appear.
[12]
Yu, K.I. Communicative databases. Ph.D. dissertation, California Institute of Technology, 1981.
[13]
ZOEPPRITZ, M. The meaning of OF and HAVE in the USL system. Am. J. Comput. Linguist. 7, 2 (1981), 109-119.

Cited By

View all

Recommendations

Reviews

Martin E. Modell

According to the authors, “ASK, A Simple Knowledge System, is a total system for structuring, manipulating, and communicating information. The primary ASK user interface is a simple dialect of English.” The rather odd title of this paper is somewhat of a misnomer in that the most commonly used definition of transportability is from machine domain to machine domain. In this instance the authors treat the verb “to `transport' as a subcase of to `extend.'” That is, they present six ways in which the ASK system can be extended to include new capabilities. The six ways in which ASK is extendible and thus transportable are: :9Bto a new domain, to a new object type, to access data from a foreign database, to a new natural language, to a new programming language, and to a new computer family. Each of the six proposed areas of extension is discussed in some detail, including the steps and methodology employed. The authors' actual experiences are described, both pro and con, along with helpful hints. Comparisons are made with similar implementations using other systems. The authors employ extensive query/response examples to illustrate the proposed methods of extension. Their style is easy to read, and the material is presented in a highly undertandable manner. Some of the authors' statements are of an editorial nature; however, this does not detract in any way from their presentation. On the contrary, their comments seem right on the mark. For example: :9BIt would be nice if there were a “universal” database structure, but there is not. The “epistemological” levels . . . of current database theories leave little room for linguistic subtleties. Ninety-nine percent of ASK is written in standard PASCAL. The machine-dependent parts of ASK are few in number, well isolated and well defined. It would seem that ASK should be easily transportable. Sadly, writing in standard PASCAL does not make that true. . . . Truly transportable PASCAL is not by any means documented, and it is doubtful that it exists. One does not need a preexistent knowledge of ASK, or any natural language or expert system to appreciate the content of this paper. The liberal use of illustrations from the authors' own work indicates extensive work with, and deep understanding of both the specific subject matter of ASK itself, and the wider topic of designing and implementing user-friendly, and thus user-effective, systems. Much of the reference literature originates at the California Institute of Technology, Pasadena, CA, and includes other papers from the same authors. If this paper is any indication, the other papers should be well worth reading.

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Information Systems
ACM Transactions on Information Systems  Volume 3, Issue 2
April 1985
124 pages
ISSN:1046-8188
EISSN:1558-2868
DOI:10.1145/3914
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 April 1985
Published in TOIS Volume 3, Issue 2

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)36
  • Downloads (Last 6 weeks)8
Reflects downloads up to 16 Jan 2025

Other Metrics

Citations

Cited By

View all

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Full Access

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media