A pattern recognition algorithm is described that learns a transition net grammar from positive examples. Two sets of examples -- one in English and one in Chinese -- are presented. It is hoped that language learning will reduce the knowledge acquisition effort for expert systems and make the natural language interface to database systems more transportable. The algorithm presented makes a step in that direction by providing a robust parser and reducing special interaction for introduction of new words and terms.

In his recent article in AI Magazine, "AI prepares for 2001," Nils Nilsson put forward a paradigm of AI based Sufficiency implies finding a guide to investigate the on a declarative representation of knowledge with semantic case of human beings. I would like improve problem-solving performances succeeds only because to present some ideas and concepts stemming from current syntax mirrors semantics in the domains where the research in Genetic Epistemology (GE), initiated by Jean programs were applied. Piaget, there is then no need for any distinction between This interrogation is precisely the core of the Piagetian rules and metarules or knowledge-base and inference engines. The "epistemic program" should undergo by itself a GE is concerned with knowledge considered as a process, series of revisions of represeutations, and thus experiment [Piaget (1964)]. The obvious point of convergence different schemes of perceptions-or inference enginesas of AI and GE is precisely this concept of knowledge as a the mathematico-logical structure underlying the dynamic process.

About a year ago. I was approached by Phoebe Huang of Comtex Scientific Corporation who hoped that I would help devise a dramatically expanded index for topics in AI to aid Comtex in indexing the series of AI memos and reports that they had been gathering. Comtex had tried to get the ACM to expand and update its classification. But was told that ACM had just revised the listing two years ago or so ago, and did not intend to revise it again for a while: even if they did. The revision might require a year or more to complete. Comtex wanted the new classification within six to eight weeks. I agreed to take on the task, thinking it wouldn't be too hard. The major decision I had to make was whether to use the existing ACM index scheme and add to it, or start with a fresh sheet of paper and devise my own. I decided to stick with ACM's top two levels, only adding, not modifying, major headings.

In Proc. AAAI-85

Proceedings, Ninth Intl. Joint Conference on Artificial Intelligence, pp. 432-435. Los Angeles, California. August 1985.

Berkeley, Calif: University of California Press

Proceedings, 23rd Annual Meeting of the Association for Computational Linguistics, pp. 61-69. Chicago, Illinois, July 1985.

Cognitive Science: A Multidisciplinary Journal, Vol 9, No. 2, pp. 171-216, 1985

Cambridge, Mass.: MIT Press

Proceedings of the 7th Conference of the Cognitive Science Society, University of California, Irvine, CA. pp. 329–334