Cluster-based find and replace

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.

Department dc:contributor.department

Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2003

Author dc:creator

• Marshall, Alisa Marie, 1980-

Advisor dc:contributor.advisor

• Robert C. Miller.

• Electrical Engineering and Computer Science.

Statement dc:rights

• 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.

Licence dc:rights.uri

• http://dspace.mit.edu/handle/1721.1/7582

Language dc:language.iso

eng

Handle dc:identifier.uri

http://hdl.handle.net/1721.1/29696

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/29696