Frank, I've solved this problem with a "matchcode builder" that parses the name field from right to left, skipping words in a developed list such as Jr, Sr, etc. etc. to isolate the last name, which is then copied into the matchcode field for dupe detection, sorting and presenting address lists in alphabetic order.
For firm names, I require a flag so the matchcode builder process takes the 1st, rather then the last, name. The operator has to key this flag during entry or add it later. I've done this for a long time now, and am still happy with the solution, rather then even trying to require the operator to enter fixed fields. Another angle is that sometimes it's necessary to import address lists from other sources, which gets back to being able to handle names and addresses as they would be written on an envelope. Of course if the addresses being imported are structured some other way, then special handling to import is required, but I do prefer the natural way. Bill > > One of the problems is there are so many ways that the > string could be > > written depending on whether it referred to a couple, > individual, or > > company. This mean you would need to write many Rx(s) to catch all > > the possibilities, and you still might not have an Rx that > is bullet > > proof. If you're using perl, Activestate has a doc on Rx > that might be > > helpful. > > > What I'm trying to accomplish is a way to nudge the user in > to entering name data consistently. > > Our preferred methods for people are listed below: > > BURCAW, FRANK > BURCAW, FRANK W > BURCAW, FRANK & STEPHANIE > > This will allow for better sorting in grid views. When it's > time to print, then I'll rearrange them to a first name last > name layout. No commas would indicate that it is a company name. > > So I was trying to build a regular expression that would > match the last name, first name pattern as long as a list of > words also did not exist. > > I'l still struggling with this and would appreciate any assistance. > > Best regards, > > Frank > _______________________________________________ Post Messages to: ProFox@leafe.com Subscription Maintenance: http://leafe.com/mailman/listinfo/profox OT-free version of this list: http://leafe.com/mailman/listinfo/profoxtech Searchable Archive: http://leafe.com/archives/search/profox This message: http://leafe.com/archives/byMID/profox/[EMAIL PROTECTED] ** All postings, unless explicitly stated otherwise, are the opinions of the author, and do not constitute legal or medical advice. This statement is added to the messages for those lawyers who are too stupid to see the obvious.
