Beefy Boxes and Bandwidth Generously Provided by pair Networks vroom
Perl: the Markov chain saw
 
PerlMonks  

Re: Inverting full names

by Grygonos (Chaplain)
on Apr 08, 2005 at 16:53 UTC ( [id://446169]=note: print w/replies, xml ) Need Help??

This is an archived low-energy page for bots and other anonmyous visitors. Please sign up if you are a human and want to interact.


in reply to Inverting full names

I just performed a similar excercise for my employer. we were receiving names in this format last <suffix> first <middle> <> denotes optional

In my experience it required more than one regex, and a good knowledge of your data. for example your john m. doe example would be done as follows

use strict; use warnings; my @names = ('John-Boy M. Doe', 'John Doe', 'John St. Doe', 'John St Doe', 'John M. St. Doe', 'John M. O Doe', 'John M. O\'Doe'); foreach my $name (@names) { NAME_TEST: { $name =~ m{^([\w\-\']+)\s*(\w*\.*)\s((?:O|St)(?:\'|\.)*\s*[\w\ +-\']+)} && do{print 'First/Middle/(Prefix)Last'; + print $1.'-'.$2.'-'.$3."\n\n"; + last NAME_TEST;}; $name =~ m{^([\w\-\']+)\s*(\w*\.*)\s((?:O|St)(?:\'|\.)*\s*[\w\ +-\']+)} && do{print 'First/Middle/(Prefix)Last'; + print $1.'-'.$2.'-'.$3."\n\n"; + last NAME_TEST;} } }
As you can see I included some other examples of things you'll have to deal with. Running these regexen in a certain order is important. If you take my example and swap them it gives incorrect results, because the 2nd one finds what it thinks is a first middle last (because it doesn't know about the predef'd prefixes and such) Hope some of that helped

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://446169]
help
Sections?
Information?
Find Nodes?
Leftovers?
    Notices?
    hippoepoptai's answer Re: how do I set a cookie and redirect was blessed by hippo!
    erzuuliAnonymous Monks are no longer allowed to use Super Search, due to an excessive use of this resource by robots.