Matching two lists of users

[Jacinta Richardson]

On Tue, 17 Jun 2003, Scott Penrose wrote:

> The basic rules are simple. If I find a match and there is only one of 
> that type then I accept that.
> 
> For example, the user
> 
> 	scottp = Scott Penrose
> 
> Would match on
> 
> 	scottp
> 	Scott Penrose
> 	Penrose, Scott
> 	Scott D Penrose
> 	Penrose, Scott D
> 	SDP
> 	SP

I've got _some_ suggestions but none that specifically answer your
question:

Lingua::Stem - applies stemming algorithms
Text::Levenshtein - measures approximatelness
String::Approx    - as above

Tie::Hash::Approx - uses String::Approx
Tie::Hash::Regex  (maybe) - tries to find values using the given regexp

Text::Soundex - has some advantages.

all the best,

	Jacinta


--
   ("`-''-/").___..--''"`-._          |  Jacinta Richardson	    |
    `6_ 6  )   `-.  (     ).`-.__.`)  |  Perl Training Australia    |
    (_Y_.)'  ._   )  `._ `. ``-..-'   |      +613 9354 6001 	    |  
  _..`--'_..-_/  /--'_.' ,'           | contact at perltraining.com.au |
(il),-''  (li),'  ((!.-'              |   www.perltraining.com.au   |