Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl Monk, Perl Meditation
 
PerlMonks  

Re: Re: Approximate matching of company names

by toma (Vicar)
on Oct 30, 2003 at 04:26 UTC ( [id://303198]=note: print w/replies, xml ) Need Help??


in reply to Re: Approximate matching of company names
in thread Some kind of fuzzy logic.

Here is the requested example that shows how n-tuples work:

In this example, take n=3. The company names to compare are "tomacorp" and "tomarcorp". The 3-tuples of tomacorp are:

tom oma mac aco cor orp
The 3-tuples of tomarcorp are:
tom oma mar arc rco cor orp
The tuples in common are:
tom oma cor orp
Four of the six 3-tuples in tomacorp appear in tomarcorp. This is a 75% match.

It should work perfectly the first time! - toma

Replies are listed 'Best First'.
Re^3: Approximate matching of company names
by jelevin (Initiate) on Jul 02, 2011 at 17:45 UTC
    Is there a perl module or modules that implement this approach?

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others sharing their wisdom with the Monastery: (2)
As of 2024-04-26 00:37 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found