<html><head><meta http-equiv="Content-Type" content="text/html charset=utf-8"></head><body style="word-wrap: break-word; -webkit-nbsp-mode: space; -webkit-line-break: after-white-space;" class="">Hi Adapters,<div class=""><br class=""></div><div class=""><div class="">Our seminar will take place tomorrow at 4pm in room 3-528. Besides Kangqi, I’ll also give you a talk about the paper “String Similarity Joins: An Experimental Evaluation”.</div><div class="">
<div class="page" title="Page 1">
<div class="layoutArea">
<div class="column"><p class=""><span style="font-size: 9.000000pt; font-family: 'SFRM0900'" class="">String similarity join is an important operation in data in-
tegration and cleansing that finds similar string pairs from
two collections of strings. More than ten algorithms have
been proposed to address this problem in the recent two
decades. </span><span style="font-family: SFRM0900; font-size: 9pt;" class="">Those algorithms will be compared under the same experimental framework in this paper.</span></p></div></div></div></div><div class="">This paper is quite easy to follow, and I hope everyone can enjoy this talk!</div><div class=""><br class=""></div><div class="">Thanks,</div><div class="">Jinyi</div></div></body></html>