Beefy Boxes and Bandwidth Generously Provided by pair Networks
Your skill will accomplish
what the force of many cannot
 
PerlMonks  

Re^2: Searching for best match

by Sosi (Sexton)
on Oct 06, 2014 at 08:47 UTC ( #1102944=note: print w/replies, xml ) Need Help??


in reply to Re: Searching for best match
in thread Searching for best match

Thank you! Yes the best match is the longest one. In the Stackoverflow post someone suggested that I looked into fuzzy-matching modules. I'm also looking into this.

Replies are listed 'Best First'.
Re^3: Searching for best match
by Anonymous Monk on Oct 06, 2014 at 11:39 UTC

    It's a little unclear to me if Text::Fuzzy does what you want, but of course investigating CPAN modules is a good idea.

    Also, just a note that the code above is only an interpretation if what your original code appears to want to do, i.e. looking at only the first two names for matches.

    A more complete selection of sample input, description of what you want the match to be, and sample output would really help, I think.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1102944]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others browsing the Monastery: (3)
As of 2018-09-20 05:14 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Eventually, "covfefe" will come to mean:













    Results (171 votes). Check out past polls.

    Notices?
    • (Sep 10, 2018 at 18:53 UTC) Welcome new users!