Cluster-based find and replace
Name
53883951-MIT.pdf
Description
Full printable version
Size
4.77 MB
Format
Adobe PDF
Checksum (MD5)
7fcfb6ba66a8aadea52f33b1d9e6db63
Author(s)
Marshall, Alisa Marie, 1980-
Advisor(s)
Robert C. Miller.
Date Issued
2003
Publisher
Massachusetts Institute of Technology
Abstract
Current Find and Replace tools offer their users only two options when performing a find and replace: replace one match at a time while prompting the user to confirm each replace, or replace all matches at once without any user confirmation. Each of these options can be prone to errors. In this thesis, I investigated, implemented, and tested a third option when performing a find and replace: a cluster-based find and replace. Instead of replacing one match at a time or all matches at once, the user can choose to replace a cluster of similar matches. While I hypothesized that a cluster-based find and replace interface would make users complete a find and replace task faster and more accurately, preliminary user studies suggest that a cluster-based interface may improve speed.
Description
Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2003.
Includes bibliographical references (p. 43).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
Persistent DSpace Link
