Ann Arbor / Montreal / Boston / Taipei / Sydney / Tokyo / Washington / DC / Philadelphia / Pittsburgh / Cambridge / London / Mitzpe Ramon / Edinburgh / /
Company
MIT Press / Green and Co. / Other Lexical Resources / D IRECT / Penn Treebank / /
Country
Taiwan / Japan / United States / Canada / Australia / United Kingdom / Israel / /
Currency
USD / / /
Facility
Macquarie Library / University of Edinburgh / Information Technologies University of Sydney NSW / /
IndustryTerm
simplest algorithm / similar search time / approximate similarity search / search term / search complexity / na¨ıve search / search time increases / nearestneighbour search / average search / nearest-neighbour search / search paths / emotion food / search time / /
Organization
Information Technologies University of Sydney NSW / MIT / Australian Research Council / James R. Curran School / University of Edinburgh / Oxford University / North American Chapter / Association for Computational Linguistics / /
Person
David W. Conrath / Sanda Harabagiu / Marius Pasca / Philip Resnik / John Carroll / James Gorman / James Curran / Peter F. Brown / Stephen Clark / George K. Zipf / Alexander Budanitsky / Peter V / Claudia Leacock / Gregory Grefenstette / Darren Pearce / Graeme Hirst / Christiane Fellbaum / Peter Roget / Guido Minnen / Grady Ward / Marc Moens / J. Della Pietra / Robert L. Mercer / Jay J. Jiang / Martin Chodorow / Vincent J. Della / John R. L. Bernard / Moby / Michael E. Houle / Lou Burnard / Jennifer C. Lai / David Weir / Jun Sakuma / /
Position
editor / EXTANT relation extractor / /
Product
WordNet / /
ProgrammingLanguage
DC / /
PublishedMedium
Computational Linguistics / /
Technology
SASH algorithm / Natural Language Processing / Data Mining / DOM / /
Augmenting Approximate Similarity Searching with Lexical Information James Gorman and James R. Curran School of Information Technologies University of Sydney NSW 2006, Australia {jgorman2,james}@it.usyd.edu.au