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

Re: Calculating "similarity"

by parv (Parson)
on Mar 02, 2003 at 03:18 UTC ( [id://239818]=note: print w/replies, xml ) Need Help??


in reply to Calculating "similarity"

( Correction: the "Vector Space..." article is not actually directly related to the OP's problem but does deal w/ the "closeness of words" concept. In that regard, below is the corrected version of my earlier reply.

UPDATE (Mar 3 2003): If anybody is still interested, i have rounded up some relevant things under "string munging". )

See Vector Space Search Engine article which does some similar things.

The String::Similarity and String::Approx modules may also be of interest. Below are the descriptions (from FreeBSD ports)...

String::Similarity
The "String::Similarity" calculates the similarity index of its two arguments. A value of '0' means that the strings are entirely different. A value of '1' means that the strings are identical. Everything else lies between 0 and 1 and describes the amount of similarity between the strings.

String::Approx
String::Approx lets you match and substitute strings approximately. With this you can emulate errors: typing errors, spelling errors, closely related vocabularies (colour color), genetic mutations (GAG ACT), abbreviations (McScot, MacScot).

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others wandering the Monastery: (6)
As of 2024-04-25 12:31 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found