This talk describes the experience of weaving research in computer science education, and how it can be carried over to software engineering. Curriculum is designed with the objective that students can undertake projects as early as possible. As a result, specially designed technology courses are brought in early on (much like the carpenter learning the tools and power tools in a hands-on manner). Concepts are presented through normal courses but to allow flexibility in choice of courses, long pre-requisite chains are broken carefully. This provides the backdrop in which students are encouraged to choose a stream and undertake research in it, while at the same time learning broad basics. This encourages students to experiment and learn with joy. A suitably-designed flexible curriculum and passionate faculty who radiate the joy of their work are important elements but not sufficient. Students are under tremendous peer pressure to take up routine and ordinary jobs merely because they pay well. A strong base of human values is necessary so that students examine their life goals, and get in touch with what they really want to be/do. This serves as the foundation on which professional ethics can be discussed. Thus, it helps them in becoming a good researcher, as well as a good human being.

Computational linguistics activities in India are being carried out at many institutions. The activities are centred around development of machine translation systems and lexical resources.

There is a need to develop a suitable computational grammar formalism for free word order languages for two reasons: First, a suitably designed formalism is likely to be more efficient. Second, such a formalism is also likely to be linguistically more elegant and satisfying. In this paper, we describe such a formalism, called the Paninian framework, that has been successfully applied to Indian languages.This paper shows that the Paninian framework applied to modern Indian languages gives an elegant account of the relation between surface form (vibhakti) and semantic (karaka) roles. The mapping is elegant and compact. The same basic account also explains active-passives and complex sentences. This suggests that the solution is not just adhoc but has a deeper underlying unity.A constraint based parser is described for the framework. The constraints problem reduces to bipartite graph matching problem because of the nature of constraints. Efficient solutions are known for these problems.It is interesting to observe that such a parser (designed for free word order languages) compares well in asymptotic time complexity with the parser for context free grammars (CFGs) which are basically designed for positional languages.