Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw

Re: please reply

by CountZero (Bishop)
on Jan 06, 2013 at 19:15 UTC ( #1011908=note: print w/replies, xml ) Need Help??

in reply to please reply

Could this be related to exercise 4.4 of exercise solutions (part of a Perl course taught at CNTS - Computational Linguistics at the University of Antwerp)?

The problem to solve is:

Write a program that reads text from standard input until end-of-file, and then prints the frequency of each bigram that occurs in the text. And this without hashes.
If that is indeed the "solution" to this problem, it is not working.


A program should be light and agile, its subroutines connected like a string of pearls. The spirit and intent of the program should be retained throughout. There should be neither too little or too much, neither needless loops nor useless variables, neither lack of structure nor overwhelming rigidity." - The Tao of Programming, 4.1 - Geoffrey James

My blog: Imperial Deltronics

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1011908]
[marto]: you have a balcony on the Sun?
marto ducks
[Discipulus]: bravo! orange juice will help
[marto]: not on the Sun, it'd vaporise
[Corion]: marto: No, a Sun Balcony, it was an ill-fated attempt to revive the Sparc series after the Pizzabox :)

How do I use this? | Other CB clients
Other Users?
Others chanting in the Monastery: (6)
As of 2018-03-21 11:12 GMT
Find Nodes?
    Voting Booth?
    When I think of a mole I think of:

    Results (267 votes). Check out past polls.