This treatment compares each entry in the dictionary to the data and stores matching positions. All of the possible matches are then reconstructed in the printwords function.
The words are read from the dictionary and compared without needing to be stored in memory.
#! /usr/bin/perl
use strict;
use warnings;
my $data = lc "howdoesonehandlethissensibly";
#my $data ='thesuperuserwascalledderekuser';
my %foundwords;
my $position;
while (<>) {
chomp;
next unless length>2; # remove 1 and 2 letter words
$position = 0;
while (index($data,lc $_, $position) >= 0) {
my $found = index($data, lc $_, $position);
push @{$foundwords{$found}}, lc $_;
$position = $found + 1;
}
}
# Print the word combinations
printwords('', -1);
sub printwords
{
my $string = shift;
my $position = shift;
while (++$position < length $data) {
if (exists $foundwords{$position}) {
foreach my $word (sort {length $a <=> length $b} @{$foundw
+ords{$position}}) {
printwords (join(' ', $string, $word), $position + len
+gth($word) -1);
}
last;
}
}
print "$string\n" if $position == length $data;
}
-
Are you posting in the right place? Check out Where do I post X? to know for sure.
-
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big>
<blockquote> <br /> <dd>
<dl> <dt> <em> <font>
<h1> <h2> <h3> <h4>
<h5> <h6> <hr /> <i>
<li> <nbsp> <ol> <p>
<small> <strike> <strong>
<sub> <sup> <table>
<td> <th> <tr> <tt>
<u> <ul>
-
Snippets of code should be wrapped in
<code> tags not
<pre> tags. In fact, <pre>
tags should generally be avoided. If they must
be used, extreme care should be
taken to ensure that their contents do not
have long lines (<70 chars), in order to prevent
horizontal scrolling (and possible janitor
intervention).
-
Want more info? How to link
or How to display code and escape characters
are good places to start.
|
