Evaluating WordNet-based Measures of Lexical Semantic Relatedness
Why is this work in the frame?
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Machine scores (provisional)
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
- Teacher spread
- 0.288 · how far apart the two teachers sit on this one work
- Validation status
score_only:v0-immature-baseline· verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it
Abstract
The quantification of lexical semantic relatedness has many applications in NLP, and many different measures have been proposed. We evaluate five of these measures, all of which use WordNet as their central resource, by comparing their performance in detecting and correcting real-word spelling errors. An information-content-based measure proposed by Jiang and Conrath is found superior to those proposed by Hirst and St-Onge, Leacock and Chodorow, Lin, and Resnik. In addition, we explain why distributional similarity is not an adequate proxy for lexical semantic relatedness.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
The record
- Venue
- Computational Linguistics
- Topic
- Natural Language Processing Techniques
- Field
- Computer Science
- Canadian institutions
- University of Toronto
- Funders
- University of TorontoUniversity of Pennsylvania
- Keywords
- WordNetComputer scienceSemantic similarityNatural language processingSpellingArtificial intelligenceLexical databaseProxy (statistics)Similarity (geometry)Information retrievalMeasure (data warehouse)LinguisticsMachine learningData mining
- Has abstract in OpenAlex
- yes