home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.lang.perl
- Path: sparky!uunet!nih-csl.dcrt.nih.gov!postman
- From: gmc@helix.nih.gov (Gordon M. Charrick)
- Subject: Algorithm for matching names???
- Message-ID: <1993Jan4.160014.11361@alw.nih.gov>
- Sender: postman@alw.nih.gov (AMDS Postmaster)
- Organization: National Institutes of Health, Bethesda
- Date: Mon, 4 Jan 1993 16:00:14 GMT
- Lines: 11
-
- Hi everyone,
-
- I'm looking for some code that can match names that may not be exactly the
- same (i.e. B Smith and Bob Smith, John Doe and John Q Doe, Steve and
- Stephen, Bill and William, etc). Does anyone have anything to do this
- already? It sounds like it could be a bit of a bitch to write! Thanks in
- advance.
- --
- Gordon Charrick [n4ytx] 301-496-4823 ____
- gmc@helix.nih.gov \ /
- Nat'l Inst. of Health, Bethesda, MD \/
-