2026-09-18T19:33:14Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/296962022-01-13T07:54:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Robert C. Miller.
Marshall, Alisa Marie, 1980-
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2006-03-24T16:16:10Z
2006-03-24T16:16:10Z
2003
2003
http://hdl.handle.net/1721.1/29696
53883951
Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2003.
Includes bibliographical references (p. 43).
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.
by Alisa Marie Marshall.
M.Eng.
43 p.
2277136 bytes
2276944 bytes
application/pdf
application/pdf
eng
Massachusetts Institute of Technology
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.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
Cluster-based find and replace
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="f15b73ab-0276-4067-a5b6-5a3af4133cec">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Cluster-based find and replace</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2003</PublicationDate>
<Authors>
<Author>
<DisplayName>Marshall, Alisa Marie, 1980-</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<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.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>