David Hope - D.Phil Candidate, University of Sussex Email

Research: Graphs applied to Natural Language Processing.

Supervisor: Dr. Bill Keller

---

Basic Graphs - in Flash


Sienna Graph
Weighted Edges Graph
Directed Weighted Edges Graph
Subsumption Graph

---

Graph Clustering

The MaxMax algorithm (Keller & Hope, 2007) is used to cluster words.
A weighted clustering coefficient (Keller & Hope, 2009) is used to denote the importance of each vertex in a graph.

---

Papers

MaxMax: A Graph-Based Soft Clustering Algorithm Applied to Word Sense Induction
to appear in: CICLing 2013, Part I, LNCS 7816, pp. 368–381, 2013. Springer-Verlag Berlin Heidelberg 2013, A. Gelbukh (Ed.).
pre-print.

Appraisal Theory Paper - Jonathon Read's research.

---

Software

Java WordNet::Similarity (beta)

A Java implementation of WordNet::Similarity - a Perl coded package that allows one to measure the similarity between word senses using the structure of WordNet.

Java WordNet::Similarity (beta.11.01) class files
Java WordNet::Similarity (beta.11.01) source files

The Java version is simple to set up and use. However, this is beta software: use the Perl version if you can get that up and running.

Google Web 1T (GW1T)

A search engine for GW1T. Returns counts for queries (inc. wildcard, proximity and Boolean queries); allows retrieval of the entire contextual space for a query.