in reply to Re: Re: Re: LCCS time complexity
in thread LCCS time complexity
Thanks, tachyon.
For my application, I needed maximal runs of identical words between two strings. I'm loose about what comprises a word. For example, for my application "hi-res" is the same as "hires", and punctuation and case don't matter. In the spirit of TIMTOWTDI, here's what I scraped together:
rkg# FRAGMENT my $lcs = lcss(standardize($x1), standardize($x2); sub lcss { my ($str1, $str2 ) = @_; my @match = (); my @longest = (); my $i = 0; my $seq1 = [split(/\s+/, $str1)]; my $seq2 = [split (/\s+/, $str2)]; my $sub = sub { @longest = map {$_} @match if (@match >= @longest); @match = (); }; traverse_sequences( $seq1, $seq2, { MATCH => sub {push(@match, $seq1->[$_[0]]);}, DISCARD_A => $sub, DISCARD_B => $sub, }); my $lcs = join(' ', @longest); return $lcs; } # lowercase and remove odd characters sub standardize { my ($text) = @_; return unless $text; $text =~ s/\[.*?\]/ /g; $text =~ s/[.,?"':&()!-]/ /g; $text =~ s/[^\w ]//g; $text =~ s/^\s+//; $text =~ s/\s+$//; $text =~ s/\s+/ /; $text = lc $text; return $text; }
|
---|
Replies are listed 'Best First'. | |
---|---|
Re: Re: TIMTOWTDI
by tachyon (Chancellor) on Sep 11, 2003 at 02:29 UTC | |
by rkg (Hermit) on Sep 11, 2003 at 10:38 UTC | |
by tachyon (Chancellor) on Sep 11, 2003 at 10:54 UTC |
In Section
Seekers of Perl Wisdom