Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight
 
PerlMonks  

Re: Similarity measurement

by Marshall (Canon)
on Apr 18, 2015 at 23:48 UTC ( [id://1123917]=note: print w/replies, xml ) Need Help??


in reply to Similarity measurement

This is a very complicated problem. Very complicated.

One technique is Text::Levenshtein - calculate the Levenshtein edit distance between two strings.

This is not easy even for a human to do. There are many language differences in syntax that this is almost impossible for a computer to do it.

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others perusing the Monastery: (3)
As of 2024-04-19 23:54 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found