Stories
Slash Boxes
Comments
NOTE: use Perl; is on undef hiatus. You can read content, but you can't post it. More info will be forthcoming forthcomingly.

All the Perl that's Practical to Extract and Report

The Fine Print: The following comments are owned by whoever posted them. We are not responsible for them in any way.
 Full
 Abbreviated
 Hidden
More | Login | Reply
Loading... please wait.
  • Why not use a low watermark algorithm to get the "best" match? Even if you need to keep track of all methods with the current "best" distance to break ties in the end, it seems sorting is unnecessary.

    Having never implemented a MMD myself, I am kind of curious how a string edit distance (Levenshtein or Hamming) could be used as a replacement to Manhattan distance. Could you provide a simple example?

    • The Parrot MMD system used to sort the candidate list, but apparently (according to chromatic++) we don't anymore.

      As to the ability of a Hamming distance to perform this duty, it's just a thought that I had. It may turn out to be untenable, but it's something I would like to try. As far as I understand the type tuple generation code, the tuple only contains the information that the signature string contains, with the addition of the PMC type.

      For simple situations, we can take a string like "SS->I", and c

      --
      Andrew Whitworth