Abstract
In this paper, we have focussed on assignment of meaning to sentences in NL. We have tried to say that theoretical Computer Science in general, and computational complexity theory and logic in particular, have a lot to contribute to NLP. On the other hand NLP has a number of challenging problems which require new ways of thinking and may thus lead to radically new frameworks in theoretical CS, particularly logic. Recent history has several instances where theoretical CS has helped shape research in NLP. At the same time, several open problems in NLP await work, some of which have the potential to throw up radically new frameworks in theoretical Computer Science.
(Extended Abstract)
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Barton, G. Edward, Robert C. Berwick, and Eric S. Ristad, Computational Complexity and Natural Language, MIT Press, Cambridge, MA, 1987.
Barwise, Jon, and Robin Cooper, “Generalized Quantifiers and Natural Language,” Linguistics and Philosophy 4, 1981, pp.159–219. (Also in Kulas et al. (1988)).
Bharati, Akshar, Vineet Chaitanya, and Rajeev Sangal, A Computational Grammar for Indian Languages Processing, Tech. Report TRCS-90-96, Dept of Computer Sc. & Engg, I.I.T. Kanpur, 1990a.
Bharati, Akshar, Vineet Chaitanya, and Rajeev Sangal, A Computational Framework for Indian Languages, Tech. Report TRCS-90-100, Dept of Computer Sc. & Engg, I.I.T. Kanpur, 1990b.
Bharati, Akshar, and Rajeev Sangal, “A Karaka Based Approach to parsing of Indian Languages,” COLING-90: Int. Conf. on Computational Linguistics, Assoc. of Computational Linguistics, 1990c (forthcoming).
Chomsky, N., Aspects of Theory of Syntax, MIT Press, Cambridge, MA, 1965.
Dowty, David R., Lauri Karttunen and Arnold M. Zwicky, (eds.), Natural Language Parsing, Cambridge University Press, Cambridge, UK, 1985.
Gazdar, Gerald E., E. Klein, G. Pullum, and I. Sag, Generalized Phrase Structure Grammar, Basil Blackwell, Oxford, 1985.
Grosz, Barbara J., Karen Sparck Jones, Bonnie Lynn Webber, (eds.), Readings in Natural Language Processing, Morgan Kaufmann, Los Altos, CA, 1986.
Hintikka, Jaakko, “Quantifiers in Natural Languages: Some Logical Problems”, in Essays on Mathematical and Philosophical Logic, J. Hintikka et al., (eds.), D. Reidel, Dordrecht, 1977. (Also in Kulas et al. (1988)).
Joshi, Aravind K., “Tree Adjoining Grammars: How Much Context Sensitivity is Required to Provide Reasonable Structural Descriptions ?,” in Dowty et al. (1985).
Joshi, Aravind K., Leon S. Levy, and M. Takahashi, “Tree Adjunct Grammars,” Journal of Computer and Systems Sciences, 1975.
Kulas, Jack, James H. Fetzer, and Terry L. Rankin, (eds.), Philosophy, Language and Artificial Intelligence, Kluwer Academic, Dordrecht, 1988.
Kaplan, Ronald M., and Joan Bresnan, “Lexical Functional Grammar,” The Mental Representation of Grammatical Relations, Joan Bresnan, (ed), MIT Press, Cambridge, MA, 1982.
Narasimhan, R., “On the Nature of Scientific Activity,” Tech. Report, Computer Sc. Group, Tata Inst. of Fundamental Res., Bombay, 1971.
Narasimhan, R., “What is Science Really About,” Science Today, Nov.–Dec.1973.
Narasimhan, R., Modeling Language Behaviour, Springer Verlag, Berlin, 1981.
Narasimhan, R., “The Orality Literacy Contrast,” Keynote Address to National Seminar on Human Communication, I.I.T. Kanpur, 1985. (Appeared in Aspects of Human Communication, L. Krishnan, B.N. Patnaik and N.K. Sharma, (eds.), Mittal Publicatons, New Delhi, 1989.)
Pullum, Geoffrey K., “Footloose and Context Free,” Natural Language and Linguistic theory 4, 1986, pp. 409–414. (Also in Kulas et al. (1988).)
Perrault, C.R., “On the Mathematical Properties of Linguistic Theories,” Computational Linguistics 10, 1984, pp. 165–176. (Also in Grosz et al. (1986).)
Ramesh, P.V., Constraints in Logic Programming, M.Tech. thesis, Dept. of Computer Sc. & Engg., I.I.T. Kanpur, 1990.
Reyle, U., and C. Rohrer, (eds.), Natural Language Parsing and Linguistic Theories, D. Reidel, Dordrecht, 1989.
Schank, Roger C., “Language and Memory,” Cognitive Science 4,(3), 1980, pp. 243–284. (Also in Grosz et al. (1988).)
Shieber, Stuart M., “Direct Parsing of ID/LP Grammars,” Linguistics and Philosophy 7(2), 1983, pp. 135–154.
Shieber Stuart M., “Separating Linguistic Analysis from Linguistic Theories,” in Reyle and Rohrer (1988).
Westerstahl, Dag, “Branching Generalized Quantifiers and Natural Language”, in Generalized Quantifiers, Peter Gardenfors, (ed.), D. Reidel, Dordrecht, 1987, pp. 269–298.
Wilks, Yorick, “An Intelligent Analyzer and understander of English,” Communications of ACM 18(5), 1975, pp. 264–274. (Also in Grosz et al. (1988).)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bharati, A., Sangal, R., Chaitanya, V. (1990). Natural language processing, complexity theory and logic. In: Nori, K.V., Veni Madhavan, C.E. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1990. Lecture Notes in Computer Science, vol 472. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53487-3_60
Download citation
DOI: https://doi.org/10.1007/3-540-53487-3_60
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53487-7
Online ISBN: 978-3-540-46313-9
eBook Packages: Springer Book Archive