Zusammenfassung
Die Anzahl von Rechnern steigt sehr schnell; Rechner werden auch billiger. Dies bedeutet, daß die Verwendung von Rechenanlagen sehr bald für mehr Anwendungen als heute gewinnbringend sein wird. In Zukunft werden immer mehr Informationen, die derzeit noch auf Papier gespeichert sind, statt dessen in einem Rechner gespeichert werden; in zunehmendem Umfang wird diese Information auch via konversationelle Terminals, die eine Person mit einem Rechner verbinden, für den direkten Zugriff verfügbar sein. Einige der Vorteile der Verwendung von menschlichen Sprachen in solchen Dialogen sind:
-
(a)
die natürliche Sprache ist flexibler und für allgemeine Zwecke besser geeignet als künstliche Programmiersprachen;
-
(b)
jeder kann mit dem Rechner in Kontakt treten, ohne zuerst eine künstliche Sprache zu lernen. Dies ist in einer Demokratie, wo möglichst viel Information für möglichst viele Personen zugänglich sein sollte, sehr wichtig. Künstliche Sprachen beschränken den Zugriff auf die Information auf Personen mit Spezialkenntnissen.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Literatur
Bach, E. An introduction to transformational grammars. New York: Holt 1964.
Batori, I.: Disambiguating verbs with multiple meanings in the MT-system of IBM Germany Int. Conf. on Computational Linguistics, Stockholm (1969).
Bellert, I.: On the use of linguistic quantifying operators in the logico-semantic structure representation of utterances. Int. Conf. on Computational Linguistics, Stockholm (1969).
Berge, C.: An introduction to the theory of graphs. New York: Wiley 1962.
Bobrow, D. G.: Problems in natural language communication with computers. IEEE Trans. on Human Factors 8, 1 (1967).
Bratley, P., Dewar, H., Thorne, J. P.: Recognition of syntactic structure by computer. Nature 216 (1967).
Breslaw, P.: Experiments with a semantic network. Research Memorandum MIP-R-63, Department of Machine Intelligence and Perception, University of Edinburgh (1969).
Bross, I. D. J., et al.: Feasibility of automated information systems in the user’s natural language. American Scientist 57 (1969).
Colby, K. M., Enea, H.: Heuristic methods for computer understanding of natural language in context-restricted on-line dialogues. Mathematical Biosciences 1, 1–25 (1967).
Davis, M.: Eliminating the irrelevant from mechanical proofs. Proc. Symposia in Applied Mathematics 15, 15–30 (1963).
Earley, J.: An efficient context-free parsing algorithm. Comm. Ass. Comput. Mach. 13, 94–102 (1970).
Floyd, R. W.: The syntax of programming languages — a survey. IEEE Transactions on Electronic Computers, EC-13, 346–353 (1964).
Glasersfeld, E. von: Semantics and the syntactic classification of words. Int. Conf. on Computational Linguistics, Stockholm (1969).
Glasersfeld, E. von, Pisani, P. P.: The multistore parser for hierarchical syntactic structures. Comm Ass. Comput. Mach. 13, 74–82 (1970).
Hewitt, C.: PLANNER: a language for proving theorems in robots. Proc. Int. Joint Conf. on Artificial Intelligence, 295–301, Washington, D.C. (1969).
IBM: Interactive graphics in data processing. IBM Systems Journal 7, 147, 229 (1968).
Kaplan, R. M.: The Mind system: a grammar-rule language. RM-6265/l-PR, RAND Corporation, Santa Monica (1970).
Karttunen, L.: Discourse referents. Int. Conf. on Computational Linguistics, Stockholm (1969).
Katz, J. J., Postal, P. M.: An integrated theory of linguistic descriptions. Cambridge Mass.: MIT Press 1964.
Kay, M.: A parsing program for categorial grammars. Memo RM-4283-PR, RAND Corporation, Santa Monica (1964).
McMahon, L. E.: FASE-fundamentally analyzable simplified English. Symp. on the human use of computing machines, Bell Telephone Labs. (1966).
Meltzer, B.: Prolegomena to a theory of efficiency of proof procedures (1971). In diesem Band: Vorbemerkungen zu einer Theorie der Effizienz von Beweisverfahren.
Michie, D.: Formation and execution of plans by machine (1971). In diesem Band: Die Formulierung und Durchführung von Plänen durch Maschinen.
Mäkilä, K.: Deduction procedures in a question answering system. Report C 8310M3(E5). Stockholm: Research Institute of National Defense (1972).
Palme, J.: Reliability of paternity investigations. Statistisk Tidskrift 1 (1968).
Palme, J.: A simplified English for question answering. Report C 8256–11(64), Stockholm: Research Institute of National Defense (1970).
Palme, J.: A natural language parsing program for question answering. Report C 8268–11(64). Stockholm: Research Institute of National Defense (1971).
Palme, J.: From parsing tree to predicate calculus — a preliminary survey. Report C 8313-M3(E5). Stockholm: Research Institute of National Defense (1972a).
Palme, J.: Syntax and dictionary for a computer English. Report C 8312-M3(E5). Stockholm: Research Institute of National Defense (1972b).
Quillian, M. R.: The teachable language comprehender: a simulation program and theory of language. Comm. Ass. Comput. Mach. 12, 459–476 (1969).
Raphael, B.: SIR — a computer program for semantic information retrieval. Dissertation, MIT (1964).
Robinson, J. A.: A machine-oriented logic based on the resolution principle. J. Ass. Comput. Mach. 12, 23–41 (1965a).
Robinson, J. A.: Automatic deduction with hyper-resolution. International Journal of Computer Mathematics 1, 227–234 (1965b).
Robinson, J. A.: Building deduction machines (1971). In diesem Band: Über den Bau von Deduktionsmaschinen.
Rosenbaum, P. S.: A grammar base question-answering procedure. Comm. Ass. Comput. Mach. 10, 630–635 (1967).
Sandewall, E. J.: Representation of facts in a computer question answering system. Report Dept. Comput. Science, University of Uppsala (1965).
Sandewall, E. J.: A formal notation that re-expresses natural language sentence structure. Report Dept. Comput. Science, University of Uppsala (1968).
Sandewall, E. J.: A property-list representation for certain formulas in predicate calculus. Report Dept. Comput. Science, University of Uppsala (1969a).
Sandewall, E. J.: A set-oriented property-structure representation for binary relations. In: Machine Intelligence 5, 237–252 (Meltzer, B., Michie, D., Hrsg.). Edinburgh: Edinburgh University Press 1969(b).
Sandewall, E. J.: Representing natural-language information in predicate calculus. In Machine Intelligence 6, 255–277 (Meltzer, B., Michie, D., Hrsg.). Edinburgh: Edinburgh University Press 1971(a).
Sandewall, E. J.: Heuristic search: concepts and methods (1971b). In diesem Band: Heuristische Suche: Konzepte und Methoden.
Sandewall, E. J.: Formal methods in the design of question-answering systems. Artificial Intelligence 2, 129–145 (1971c).
Schwarz, R. H.: Towards a computational formalization of natural language semantics. Int. Conf. on Computational Linguistics, Stockholm (1969).
Simmons, R. F.: Natural language question-answering systems: 1969. Comm. Ass. Comput. Mach. 13, 15–30 (1970).
Vargas, D.: Problem of improving the efficiency of parsing systems. Int. Conf. on Computational Linguistics, Stockholm (1969).
Vauquois, B.: A survey of formal grammars and algorithms for recognition and transformation in mechanical translation. IFIP 68 (1968).
Winograd, T.: Understanding natural language. New York: Academic Press 1972.
Woods, W. A.: Procedural semantics for a question-answering machine. Proc. AFIPS Conf. 33, I, 457–471 (1968).
Woods, W. A.: Transition network grammars for natural language analysis. Comm. Ass. Comput. Mach. 13, 591–606 (1970).
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1975 Springer-Verlag/Wien
About this chapter
Cite this chapter
Palme, J. (1975). Rechenanlagen, die natürliche Sprache verstehen. In: Findler, N.V. (eds) Künstliche Intelligenz und Heuristisches Programmieren. Springer, Vienna. https://doi.org/10.1007/978-3-7091-8389-2_11
Download citation
DOI: https://doi.org/10.1007/978-3-7091-8389-2_11
Publisher Name: Springer, Vienna
Print ISBN: 978-3-7091-8390-8
Online ISBN: 978-3-7091-8389-2
eBook Packages: Springer Book Archive