Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery

Re: Comparing large files

by LanX (Chancellor)
on Feb 11, 2014 at 19:30 UTC ( #1074484=note: print w/ replies, xml ) Need Help??

in reply to Comparing large files

If 10 "Mg" is just the size this should result in 1e6 words.

IIRC does one hash entry result approx. 100 bytes overhead, so putting all errors in a hash should be feasible even on my pity NetBook.

Parse the pronunciation-file line by line and build a lookup hash.

Then parse the other file per line and look for missing entries.

If you really have RAM problems try splitting the hash into several disjunct ones (like for every 10% of the file) and parse the second file once for each hash.

Shouldn't take longer then seconds (at most minutes)

HTH! :)

Cheers Rolf

( addicted to the Perl Programming Language)

Comment on Re: Comparing large files

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others chilling in the Monastery: (7)
As of 2016-02-09 06:19 GMT
Find Nodes?
    Voting Booth?

    How many photographs, souvenirs, artworks, trophies or other decorative objects are displayed in your home?

    Results (304 votes), past polls