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

Re^2: minimal superstrings/maximal substrings

by Laurent_R (Canon)
on Aug 20, 2019 at 08:42 UTC ( #11104716=note: print w/replies, xml ) Need Help??

in reply to Re: minimal superstrings/maximal substrings
in thread minimal superstrings/maximal substrings

Does the entire lexicon fit into memory or do you need to sort them on disk?
It most probably does. Word lists and dictionaries have at most a few hundreds of thousands of entries, and that's quite small compared to computer memory nowadays, probably even on Raspberry PI nanocomputers.

On your edit: yes, I agree that AWK is a great tool that I have used quite a lot in the past, but, personally, I have almost stopped using AWK when I started to know Perl well enough to make it a more powerful and more flexible replacement.

  • Comment on Re^2: minimal superstrings/maximal substrings

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others about the Monastery: (2)
As of 2023-03-31 03:09 GMT
Find Nodes?
    Voting Booth?
    Which type of climate do you prefer to live in?

    Results (74 votes). Check out past polls.