Manfred Kochen
- 1 AMRAEL, S. An approach to problem-solving by computer. Final Rep. AFCRL-62-367, Pt. II, Contract No. AF19(604)-8422, May 1962.Google Scholar
- 2 An approach to heuristic problem solving and theorem-proving in propositional calculus. In Hart, J. F., and Takasu, S. (Eds.), Systems and Computer Seience, U. of Toronto Press, Toronto, Ont., Canada, 1967, pp. 125-220.Google Scholar
- 3 Representations of problems of reasoning about actions. In Michie, D. (Ed.), Machine Intelligence, S. Edinburgh U. Press, 1968, pp. 131-171.Google Scholar
- 4 BoBRow, D. G. Syntactic analysis of English by computer--a survey. Proc. /LFIPS 1963 FM1 Joint Comput. Conf., Vol. 24, pp. 365-387 (Spartan Books, Washington, D. C.).Google Scholar
- 5 BOHNERT, H. An English-like extension of an applied predicate calculus. In Kochen, 5L, Itigh-speed document perusal, Final Tech. Rep., AFOSR-2817, May 1, 1962, pp. 83-96.Google Scholar
- 6 CARNP, R. Foundations of Logic and Mathematics. In International Encyclopedia of Unified Science, Vol. I, No. 3, U. of Chicago Press, Chicago, Ill., 1939.Google Scholar
- 7 CARNEY, E.K. On the semantical interpretation of linguistic entities that function structurally. First International Conf. on Machine Translation and Applied Language Analysis, Sept. 1961, pp. 544-559 (Her Majesty's Stationery Office, London).Google Scholar
- 8 COMSKY, N. Cartesian Linguistics. Harper, New York, 1966.Google Scholar
- 9 COOPER, W. S. Fact retrieval and deductive question-answering information retrieval systems. J. ACM 11, 2 (April 1964), 117-137. Google ScholarDigital Library
- 10 CRAIG, J. A., BEREZNER, S. C., CARNEY, H. C., AND LONGYEAR, C.P. DEACON: Direct English access and control. Proc. AFIPS 1966 Fall Joint Comput. Conf., Vol. 29, pp. 365-380 (Spartan Books, Washington, D. C.).Google Scholar
- 11 CRAFT, J. L., GOLDM&N, E. H., AND STROtIM, W.B. A table look-up machine for processing of natural languages. IBM J. Res. Develop. 5 (July 1961), 192-203.Google ScholarDigital Library
- 12 DARLINTON, T. L. Translating ordinary language into symbolic logic. MACVL149, M.I.T., Cambridge, Mass., March 1964.Google Scholar
- 13 D'IPERIO, MARY. Datastructures and their representation in storage. Pt. I: NSA Tech. J. 9, 3 (1964), 59-81; Pt. II: NSA Tech. J. 9, 4 (1964), 7-54.Google Scholar
- 14 EVANS, T. G. A heuristic program to solve geometric analogy problems. Proc. AFIPS 1964 Spring Joint Comput. Conf., Vol. 25, pp. 327-338.Google Scholar
- 15 FEIGENBAUM, E., AND LEDt!}RBERG, J. DENDRAL. Interim Rep. to NASA, NSG-81-60, 1966.Google Scholar
- 16 GREEN, B. F., JR., WOLF, A. K., CHOMSKV C., AND LAUGrtERY, K. BASEBALL: An automatic question answerer. In Feigenbaum, E., and Feldman, J. (Eds.), Compulers and Thought. McGraw-Hill, New York, 1963, pp. 207-216. Google Scholar
- 17 IRONS, E.T. The structure and use of the syntax-directed compiler. Ia Goodman, R. (Ed.), Annual Review in Automatic Programming, Vol. ?, Pergamon Press, Oxford, 1963, pp. 207-227.Google Scholar
- 18 KASHER, ASA. Data-retrieval by computer: A critical survey. In Kochen, M. (Ed.), The Growth of Knowledge: Readings on Organization and Retrieval of Information. Wiley, New York, 1967, pp. 292-324.Google Scholar
- 19 KATZ, J. J., AND FODOR, J.A. The structure of a semantic theory. Language 89 (1963), 170 210.Google Scholar
- 20 KING, G.W. Table look-up procedures in language processing. Part 1: The raw text. IBM J. Res. Develop. 5, 2 (1961), 86-92.Google ScholarDigital Library
- 21 KIEsc, R. A. Computer interpretation of English text and picture patterns. IEEE Trans. EC-8, 4 (1964), 363-376.Google Scholar
- 22 KOCHEN, M. Adaptive mechanisms in digital 'concept' processing. Final Rep. on Adaptive Man-Machine Concept-Processing to AFCRL, June 14, 1962, pp. 104-156. Reprinted in Kochen, M. (Ed.), The Growth of Knowledge: Readings on Organization and Retrieval of Information, Wiley, New York, 1967, pp. 185-202.Google Scholar
- 23 KOCnEN, M. Translation of English-like queries into efficient computer search programs for question-answering. Rep. to AFOSR, Contract AF-49 (638)-1184, Nov. 22, 1965.Google Scholar
- 24 KOCHEN, M. On the representation of limited information by means of pictures, trees, and English-like sentences. Rep. to AFOSR, Contract AF-49 (638)-1184, Sept. 7, 1965.Google Scholar
- 25 KOCEN, M. Some Problems in Information Science. Scarecrow Press, Metuchen, N. J., 1965.Google Scholar
- 26 KONDO, M., AND MURATA, H. On proof retrievM: Problem-solving machines, I. Proe. Japan Aead. M, 4 (April 1965), 254-259.Google Scholar
- 27 LiNnSXY, R.K. Inferential memory as the basis of machines which understand natural language. In Feigenbaum, E., and Feldman, J. (Eds.), Computers and Thought. McGraw- Hill, New York, 1963, 217-233. Google Scholar
- 28 LPKIN. L. E: WATT, W. C., AND KIRSCH, . A. The analysis, synthesis, and descriptio of biological images. Ann. Acad. Sci. I28, Art. 3 (1966), 984-1012.Google Scholar
- 29 LONE, D. L., AND SIMMONS, R, F. Namer: a pattern-recognition system for generating sentences about relations between line drawings. Proc. ACM 20th Nat. Conf. 1965, ACM Pub. P-65, 162-175. Google Scholar
- 30 MNSK M. Steps toward artificial intelligence. Proc. IEEE 49 (Jan. 1961), 8-30.Google Scholar
- 31 MooEs, C. A mathematical theory of language symbols in retrieval. International Conf. on Sci. Inform., Washington, D. C., 1958, pp. 1327-1364.Google Scholar
- 32 --. Some mathematical fundamentals of the use of symbols in information retrieval. Proc. Internat. Conf. on Inform. Processing, UNESCO, Paris, 1959, pp. 315-321.Google Scholar
- 33 NAt.ASIMHAN, R. A linguistic approach to pattern recognition. Digital Computer Lab. Rep. No. 121, U. of Illinois, Urbana, Ill., July 10, 1962.Google Scholar
- 34 --. Syntax directed interpretation of classes of pictures. Comm. ACM 9, 3 (March 1966), 166-173. Google Scholar
- 35 QUILLAN, R. Word concepts: A theory and simulation of some basic semantic capabili. ties. CIP working paper 79, Carnegie Institute of Technology, Pittsburgh, Pa., 1965.Google Scholar
- 36 RIANKIN, B.K. A programmable grammar for a fragment of English for use in an informa. tion retrieval system. Nat. Bur. Stand. Rep. 7352, June 1961.Google Scholar
- 37 SIMMONS, R. F. Answering English questions by computer: A survey. Comm. ACM 8, 1 (Jan. 1965), 53-70. Also in Iochen, M. (Ed.), The Growlh of Knowledge: Readings on Organizatioz and Retrieval of Information, Wiley, New York, 1967, pp. 264-291. Google ScholarDigital Library
- 38 SMON, H. Experiments with a heuristic compiler. J. ACM 10, 4 (Oct. 1963), 493--506. Google Scholar
- 39 THOMPSON, F. English for the computer. Proc. AFIPS 1966 Fall Joint Comput. Conf.,Google Scholar
- 40 TING, A.M. On computable numbers with an application to the Entscheidungsprb. lem. Poc. London Math. oc. {2}, 42, 230-265, 1936-7; Correction, Proe. London Math. Soc. {2}, 45, 544-546 (1937).Google Scholar
- 41 UNGER, S.H. A global parser for context-free phrase structure grammars. Comm. ACM 11, 4 (April 1968), 240-247. Google ScholarDigital Library
- 42 VAN DA, A. A compact data structure for storing, retrieving and manipulating line drawings. Proc. AFIPS 1967 Spring Joint Comput. Conf., Vol. 30, pp. 601-611.Google Scholar
- 43 WAww, W. D., AND HStT, R.W. Concordance to the rules of PLACEBO V. US Government Research and Development Rep. 41,521(A), March 25, 1966, pp. 163-177.Google Scholar
Index Terms
- Automatic Question-Answering of English-Like Questions About Simple Diagrams
Recommendations
Translation of simple English interrogative sentences to Marathi sentences
ICWET '10: Proceedings of the International Conference and Workshop on Emerging Trends in TechnologyThis paper presents a proposed system for machine translation of English interrogative sentences to their Marathi counterpart. The system takes simple interrogative English sentence as an input and performs its lexical analysis. Every token produced by ...
A structure based computer grammar to understand simple and compound English sentences
ICAC3 '09: Proceedings of the International Conference on Advances in Computing, Communication and ControlIn this paper we are contributing to the Natural Language Understanding phase of the broader area Natural Language Processing. This paper presents the design of computer grammar that is capable of understanding simple and compound sentences of English ...
Comments