Sadik Kapadia

Learn More
Recent work on the problem of detecting synonymy through corpus analysis has used the Test of English as a Foreign Language (TOEFL) as a benchmark. However , this test involves as few as 80 questions , prompting questions regarding the statistical significance of reported results. We overcome this limitation by generating a TOEFL-like test using WordNet,(More)
This dissertation is the result of my own work and includes nothing which is the outcome of work done in collaboration, except where stated. It has not been submitted in whole or part for a degree at any other university. The length of this thesis including footnotes and appendices does not exceed 25000 words. i Contents Declaration i Abstract vi(More)
We present a fast yet highly effective stochastic algorithm, Simmered Greedy Optimization (SG(N)) for solving the co-clustering problem: to simultaneously cluster two finite sets by maximizing the mutual information between the clusterings. (Clustering one set by this criterion is a special case.) This is a combinatorial optimization problem of great(More)
  • 1