Mapping Text with Phrase Nets
IEEE Transactions on Visualization and Computer GraphicsPublished 29 October 2009
Frank van Ham, Martin Wattenberg, Fernanda Viégas
Citations145
SJR quartileQ1
SJR score1.06
SNIP2.13
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 new technique, the phrase net, is presented, for generating visual overviews of unstructured text that displays a graph whose nodes are words and whose edges indicate that two words are linked by a user-specified relation.
Abstract
We present a new technique, the phrase net, for generating visual overviews of unstructured text. A phrase net displays a graph whose nodes are words and whose edges indicate that two words are linked by a user-specified relation. These relations may be defined either at the syntactic or lexical level; different relations often produce very different perspectives on the same text. Taken together, these perspectives often provide an illuminating visual overview of the key concepts and relations in a document or set of documents.
Keywords
Computer Science
Automatic acquisition of hyponyms from large text corpora
3,283 Citations1992Marti A. Hearst
A set of lexico-syntactic patterns that are easily recognizable, that occur frequently and across text genre boundaries, and that indisputably indicate the lexical relation of interest are identified.
Fast Exact Inference with a Factored Model for Natural Language Parsing
746 Citations2002Dan Klein, Christopher D. Manning
A novel generative model for natural language tree structures in which semantic and syntactic structures are scored with separate models that admits an extremely effective A* parsing algorithm, which enables efficient, exact inference.
IEEE Transactions on Visualization and Computer GraphicsManyEyes: a Site for Visualization at Internet Scale
718 Citations2007Fernanda Viégas, Martin Wattenberg +3 more
The design and deployment of Many Eyes is described, a public Web site where users may upload data, create interactive visualizations, and carry on discussions to support collaboration around visualizations at a large scale by fostering a social style of data analysis.
IEEE Transactions on Visualization and Computer GraphicsThemeRiver: visualizing thematic changes in large document collections
673 Citations2002S. Havre, Elizabeth Hetzler +2 more
The ThemeRiver visualization depicts thematic variations over time within a large collection of documents and uses a river metaphor to convey several key notions, allowing a user to discern patterns that suggest relationships or trends.
Lecture notes in computer scienceGraph Drawing by Stress Majorization
393 Citations2005Emden R. Gansner, Yehuda Koren +1 more
This work shows how to draw graphs by stress majorization, adapting a technique known in the MDS community for more than two decades and appears that majorization has advantages over the technique of Kamada and Kawai in running time and stability.
IEEE Transactions on Visualization and Computer GraphicsThe Word Tree, an Interactive Visual Concordance
313 Citations2008Martin Wattenberg, Fernanda Viégas
The design of the Word Tree is described, along with some of the technical issues that arise in its implementation, and the results of several months of public deployment of word trees on Many Eyes are discussed, which provides a window onto the ways in which users obtain value from the visualization.
The Value of Visualization
251 Citations2006Jarke J. van Wijk
An economic model of visualization is presented, and benefits and costs are established, and two alternative views on visualization are presented and discussed: viewing visualization as an art or as a scientific discipline.
Computer Graphics ForumDocuBurst: Visualizing Document Content using Language Structure
147 Citations2009Christopher Collins, Sheelagh Carpendale +1 more
DocuBurst is a radial, space‐filling layout of hyponymy (the IS‐A relation), overlaid with occurrence counts of words in a document of interest to provide visual summaries at varying levels of granularity.
Journal of the American Society for Information Science and TechnologyThe university–industry knowledge relationship: Analyzing patents and the science base of technologies
121 Citations2004Loet Leydesdorff
The conclusion is that "biotechnology" has historically generated a model for theorizing about university-industry relations that cannot easily be generalized to other sectors and disciplines.
A Latent Space Approach to Dynamic Embedding of Co-occurrence Data
82 Citations2007Purnamrita Sarkar, Sajid M. Siddiqi +1 more
The result is the first algorithm for dynamic embedding of co-occurrence data which provides distributional information for its coordinate estimates, and is demonstrated both on synthetic data and on author-word data from the NIPS corpus, showing that it produces intuitively reasonable embeddings.
International Joint Conference on Artificial IntelligenceA net structure for semantic information storage, deducation and retrieval
71 Citations1971Stuart C. Shapiro
A data structure, MENS (MEmory Net Structure), that is useful for storing semantic information stemming from a natural language, and a system that interacts with a user, stores information into and retrieves information from MENS and interprets some information in MENS as rules telling it how to deduce new information from what is already stored.
Minds at UW (University of Wisconsin)A Net Structure for Semantic Information Storage, Deduction and Retrieval
26 Citations2012Shapiro, Stuart C.
Swinburne Research Bank (Swinburne University of Technology)Force-transfer: a new approach to removing overlapping nodes in graph layout
25 Citations2003Xiaodi Huang, Wei Lai
The Force-Transfer algorithm is proposed to give a new efficient approach to removing overlapping nodes by employing a heuristic method to approximate the global optimal adjustment with the local minimal movement.