Automatic thesaurus construction
Published 1 January 2008
Dongqiang Yang, David Powers
Citations29
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A novel method of automating thesauri using syntactically constrained distributional similarity using semantic differences of each syntactic dependency and proposing to generate thesaurus through word overlapping across major types of grammatical relations.
Abstract
In this paper we introduce a novel method of automating thesauri using syntactically constrained distributional similarity. With respect to syntactically conditioned co-occurrences, most popular approaches to automatic thesaurus construction simply ignore the salience of grammatical relations and effectively merge them into one united ‘context’. We distinguish semantic differences of each syntactic dependency and propose to generate thesauri through word overlapping across major types of grammatical relations. The encouraging results show that our proposal can build automatic thesauri with significantly higher precision than the traditional methods.
Keywords
Computer Science
Journal of the American Society for Information ScienceIndexing by latent semantic analysis
12,677 Citations1990Scott Deerwester, Susan Dumais +3 more
Language<b>WordNet: An electronic lexical database</b> . Ed. by Christiane Fellbaum. Cambridge, MA: MIT Press, 1998. Pp. xxii, 423.
11,687 Citations2000Adam Kilgarriff
The lexical database: nouns in WordNet, George A. Miller modifiers in WordNet, Katherine J. Miller a semantic network of English verbs, and applications of WordNet: building semantic concordances are presented.
Psychological ReviewA solution to Plato's problem: The latent semantic analysis theory of acquisition, induction, and representation of knowledge.
6,039 Citations1997Thomas K. Landauer, Susan Dumais
A new general theory of acquired similarity and knowledge representation, latent semantic analysis (LSA), is presented and used to successfully simulate such learning and several other psycholinguistic phenomena.
Language and Cognitive ProcessesContextual correlates of semantic similarity
1,584 Citations1991George A. Miller, Walter G. Charles
Automatic retrieval and clustering of similar words
1,555 Citations1998Dekang Lin
A word similarity measure based on the distributional pattern of words allows the automatically constructed thesaurus to be significantly closer to WordNet than Roget Thesaurus is.
Communications of the ACMThe vocabulary problem in human-system communication
1,497 Citations1987George W. Furnas, Thomas K. Landauer +2 more
It is shown how this fundamental property of language limits the success of various design methodologies for vocabulary-driven interaction, and an optimal strategy, unlimited aliasing, is derived and shown to be capable of several-fold improvements.
Computational LinguisticsDependency-Based Construction of Semantic Space Models
701 Citations2007Sebastian Padó, Mirella Lapata
This article presents a novel framework for constructing semantic spaces that takes syntactic relations into account, and introduces a formalization for this class of models, which allows linguistic knowledge to guide the construction process.
Discovering word senses from text
597 Citations2002Patrick Pantel, Dekang Lin
A clustering algorithm called CBC (Clustering By Committee) that automatically discovers word senses from text that initially discovers a set of tight clusters called committees that are well scattered in the similarity space.
Noun classification from predicate-argument structures
543 Citations1990Donald Hindle
The resulting quasi-semantic classification of nouns demonstrates the plausibility of the distributional hypothesis, and has potential application to a variety of tasks, including automatic indexing, resolving nominal compounds, and determining the scope of modification.
Publications (Konstfack University of Arts, Crafts, and Design)The Word-Space Model : Using distributional analysis to represent syntagmatic and paradigmatic relations between words in high-dimensional vector spaces
535 Citations2006Magnus Sahlgren
The word-space model is a computational model of word meaning that utilizes the distributional patterns of words collected over large text data to represent semantic similarity between words in terabytes of data.
Computers and the Humanities"I Don’t Believe in Word Senses"
387 Citations1997Adam Kilgarriff
It is suggested, by contrast, that wordsenses exist only relative to a task, and whether and how word sense ambiguity is infact a problem for current NLP applications is explored.
One sense per collocation
384 Citations1993David Yarowsky
This paper shows that for certain definitions of collocation, a polysemous word exhibits essentially only one sense per collocation and utilizes this property in a disambiguation algorithm that achieves precision of 92% using combined models of very local context.
Text, speech and language technologyNatural Language Information Retrieval
324 Citations1999Tomek Strzalkowski
Distributional Structure
317 Citations1970Zellig S. Harris
This discussion will discuss how each language can be described in terms of a distributional structure, i.e. in Terms of the occurrence of parts relative to other parts, and how this description is complete without intrusion of other features such as history or meaning.
Finding predominant word senses in untagged text
315 Citations2004Diana McCarthy, Rob Koeling +2 more
This work presents work on the use of a thesaurus acquired from raw textual corpora and the WordNet similarity package to find predominant noun senses automatically, and demonstrates that this method discovers appropriate predominant senses for words from two domain-specific corpora.
Edinburgh Research Archive (University of Edinburgh)From Distributional to Semantic Similarity
247 Citations2004James Curran
This dissertation describes how to extract contexts from a corpus of over 2 billion words and introduces a new context-weighted approximation algorithm with bounded complexity in context vector size that significantly reduces the system runtime with only a minor performance penalty.
Using syntactic dependency as local context to resolve word sense ambiguity
243 Citations1997Dekang Lin
An algorithm is presented that uses the same knowledge sources to disambiguate different words and does not require a sense-tagged corpus and exploits the fact that two different words are likely to have similar meanings if they occur in identical local contexts.
Selectional Preference and Sense Disambiguation
225 Citations1997Philip Resnik
IEEE Transactions on Systems Man and CyberneticsAutomatic construction of networks of concepts characterizing document databases
221 Citations1992Hao Chen, Kevin J. Lynch
Two East-bloc computing knowledge bases, both based on a semantic network structure, were created automatically from large, operational textual databases using two statistical algorithms to perform semantics-based information management and information retrieval via interactive, conceptual relevance feedback.
Journal of the American Society for Information ScienceA concept space approach to addressing the vocabulary problem in scientific information retrieval: An experiment on the Worm Community System
161 Citations1997Hsinchun Chen, Tobun D. Ng +2 more
An algorithmic approach to addressing the vocabulary problem in scientific information retrieval and information sharing, using the molecular biology domain as an example, and finding that a large percentage of the terms suggested by the subjects were identified in the conjoined fly-worm thesaurus is presented.
Measuring semantic similarity in the taxonomy of WordNet
160 Citations2005Dongqiang Yang, David Powers
A new model to measure semantic similarity in the taxonomy of WordNet, using edge-counting techniques achieves a much improved result compared with other methods: the correlation with average human judgment on a standard 28 word pair dataset is better than anything reported in the literature.
Journal of the American Society for Information ScienceAutomatic thesaurus generation for an electronic community system
142 Citations1995Hsinchun Chen, T. K. Bobby Yim +2 more
An algorithmic approach to the automatic generation of thesauri for electronic community systems, which showed that the worm thesaurus was an excellent “memory-jogging” device and that it supported learning and serendipitous browsing.
Verb similarity on the taxonomy of WordNet
140 Citations2006Dongqiang Yang, David Powers
Two kinds of word similarity algorithms are introduced, SHE and RHE, to investigate the capability of WordNet in measuring verb similarity, in the absence of a standard verb set.
eScholarship (California Digital Library)Towards a Theory of Semantic Space
121 Citations2001Will Lowe
A theoretical framework for semantic space models is developed by synthesizing theoretical analyses from vector space information re- trieval and categorical data analysis with new basic re- search.
IEEE ExpertGenerating, integrating, and activating thesauri for concept-based document retrieval
92 Citations1993Hao Chen, Kevin J. Lynch +2 more
A blackboard-based document management system that uses a neural network spreading-activation algorithm which lets users traverse multiple thesauri is discussed, and the system's query formation; the retrieving, ranking and selection of documents; and thesaurus activation are described.
Information Processing & ManagementThe nature of indexing: how humans and machines analyze messages and texts for retrieval. Part I: Research, and the nature of human indexing
88 Citations2001James D. Anderson, José Pérez-Carballo
This essay critiques the comparative research, then explores the nature of human analysis of messages or texts and efforts to formulate rules to make human practice more rigorous and predictable, and concludes that human analysis should be used on a much more selective basis.
Information Processing & ManagementGrammatically-based automatic word class formation
79 Citations1975Lynette Hirschman, Ralph Grishman +1 more
An automatic procedure which uses the syntactic relations as the basis for grouping words into classes that can be used to describe the informational patterns that occur in texts of the subfield, to disambiguate parses of a sentence, and perhaps to improve the performance of current information retrieval systems.
MIT Press eBooksEvaluation techniques for automatic semantic extraction: comparing syntactic and window based approaches
64 Citations1996Gregory Grefenstetti
An evaluation method using gold standards, i.e., pre-existing hand-compiled resources, is proposed as a means of comparing extraction techniques, which compare two semantic extraction techniques which produce similar word lists.
Lecture notes in computer scienceHow Dominant Is the Commonest Sense of a Word?
52 Citations2004Adam Kilgarriff
A mathematical model of word sense frequency distributions is presented, and word distributions are used to set parameters to imply that the expected dominance of the commonest sense rises with the number of corpus instances, and that highly uneven distributions are to be expected much more often than even ones.
Information Processing & ManagementThe nature of indexing: how humans and machines analyze messages and texts for retrieval. Part II: Machine indexing, and the allocation of human versus machine effort
49 Citations2001James D. Anderson, José Pérez-Carballo
It is found that research comparing human versus automatic approaches has done little to change strongly held beliefs, and automatic indexing has the over-arching advantage of decreasing cost, as human indexing becomes ever more expensive.
Evaluation Techniques for Automatic Semantic Extraction: Comparing Syntactic and Window Based Approaches
46 Citations1993Gregory Grefenstette
Journal of Information ScienceEffectiveness of query expansion in ranked-output document retrieval systems
45 Citations1992F. Çuna Ekmekçioglu, Alexander M. Robertson +1 more
An evaluation of three methods for the expansion of natural language queries in ranked-out put retrieval systems based on term co-oc currence data, on Soundex codes, and on a string similarity measure suggests there is no significant differ ence in retrieval effectiveness between any of these methods and unexpanded searches.
What's in a Thesaurus?
45 Citations2000Adam Kilgarriff, Colin Yallop
The experiment shows that pairs of ‘lexicographically close’ meanings are frequently found in different parts of the hierarchy of WordNet 1.5 and a mapping between WordNet senses and the senses of another dictionary.
Information Processing & ManagementAutomatic thesaurus construction using Bayesian networks
42 Citations1996Young C. Park, Key‐Sun Choi
Online Information ReviewThesauri on the Web: current developments and trends
33 Citations2000Ali Shiri, Crawford W. Revie
Some recent thesaurus projects undertaken to facilitate resource description and discovery and access to wide‐ranging information resources on the Internet are described.
Information Processing & ManagementThesaurus construction: Problems and their roots
32 Citations1997Uri Miller
The analysis is based on research and experience already accumulated in librarianship and information science as well as some other sciences and general scientific methods.
Intrinsic versus extrinsic evaluations of parsing systems
30 Citations2003Diego Mollá, Ben Hutchinson
This paper compares two evaluations of the Link Grammar parser and the Conexor Functional Dependency GrammarParser, finding differences in the results are significant.
Journal of the American Society for Information ScienceColinked descriptors: Improving vocabulary selection for end‐user searching
12 Citations1996Stephen P. Harter, Yung‐Rang Cheng
The potential use of colinked descriptors is a strong argument for building richer and more complex thesauri that reflect as many legitimate links among descriptors as possible.