Groups: Member
Posts: 1
|
Hi!
I'm am working with the demo and have converted the IncrementalMatch example to Java. I have that working fine (minus the db files, just created in memory string array for testing). However, I want to be able to use the lookup tables for nickname processing (i.e., matching Beth to Liz to Elizabeth).
Do I have to do this manually? In other words, open up the DBF file and lookup first names based upon the nickname, substitute it in, and then do the match? Or is there a way for the matcher to internally do the lookups?
Nevermind.... figured it out :)
|
Groups: Administration
Posts: 16
|
RE: NickName lookup tables
Yes, you open up the distributed lookup table and edit, delete or add entries which you want to be found as matching names. Ex: 'Chuck' and 'Charles' are both entered as CHAS, and therefore the matchkey gets built with CHAS instead of the original name.
MatchUp automatically checks this lookup table only when your matchcode uses a First/NickName component (instead of or also with a FirstName component).
CAUTION: Don't overuse or edit this table. At first glance, it may seem like a good idea to add 'John' and 'Jack' as a nickname match. But you may end up matching: Jonathon > Jon > John > Jack > Jackson, then Jonathon would match Jackson. HEAVILY TEST any changes you make to this table before implementing in your processing environment.
NOTE: This logic applys to MatchUp for Windows as well.
|
