Beefy Boxes and Bandwidth Generously Provided by pair Networks
good chemistry is complicated,
and a little bit messy -LW
 
PerlMonks  

N-gram comparison

by sarvan (Sexton)
on Jun 29, 2011 at 10:17 UTC ( #911920=perlquestion: print w/replies, xml ) Need Help??

sarvan has asked for the wisdom of the Perl Monks concerning the following question:

This node falls below the community's threshold of quality. You may see it by logging in.

Replies are listed 'Best First'.
Re: N-gram comparison
by Corion (Patriarch) on Jun 29, 2011 at 10:20 UTC

    Have you searched CPAN? Ngram or Trigram

    Alternatively, write it yourself. It's not hard.

      I second this :) if you're interested in more about n-grams you might wanna read Manning S. , Schutze - "Foundations of statistical natural language processing" chapter 6
Re: N-gram comparison
by choroba (Cardinal) on Jun 29, 2011 at 10:20 UTC
    Just count the number of occurrences of each trigram in a hash for each sentence, then compare the hashes.
    A reply falls below the community's threshold of quality. You may see it by logging in.
Re: N-gram comparison
by planetscape (Chancellor) on Jun 29, 2011 at 21:44 UTC

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others rifling through the Monastery: (1)
As of 2023-02-02 02:38 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    I prefer not to run the latest version of Perl because:







    Results (15 votes). Check out past polls.

    Notices?