alignment 0.2.0

data/CHANGELOG

@@ -0,0 +1 @@
+v0.1.0. initial release

data/Manifest

@@ -0,0 +1,8 @@
+README.rdoc
+Rakefile
+test/test_alignment.rb
+CHANGELOG
+ext/gale_church/gale_church.c
+ext/gale_church/extconf.rb
+lib/alignment.rb
+Manifest

data/README.rdoc

@@ -0,0 +1,26 @@
+= alignment
+
+Alignment functions for corpus linguistics. Currently implemented
+is the Gale-Church alignment algorithm.
+
+== Installation
+
+  gem install alignment
+
+== License
+
+GPL2
+
+The Gale-Church implementation was derived from NATools.
+Implementation is copyright Pernilla Danielsson, Daniel Ridings,
+and Alberto Simões. Algorithm is copyright William Gale and
+Kenneth Church.
+
+Ruby version is copyright Marius L. Jøhndal.
+
+== Usage
+
+
+== Development
+
+The project is hosted on github on http://github.com/mlj/alignment.

data/Rakefile

@@ -0,0 +1,16 @@
+# -*- encoding: utf-8 -*-
+begin
+  require 'jeweler'
+
+  Jeweler::Tasks.new do |p|
+    p.name = "alignment"
+    p.summary = "Alignment functions for corpus linguistics"
+    p.description = "Alignment functions for corpus linguistics."
+    p.authors = ['Marius L. Jøhndal']
+    p.email = "mariuslj (at) ifi [dot] uio (dot) no"
+    p.homepage = "http://github.com/mlj/alignment"
+    p.rubyforge_project = "alignment"
+  end
+rescue LoadError
+  puts "Jeweler not available. Install it with: sudo gem install jeweler"
+end

data/VERSION

@@ -0,0 +1 @@
+0.2.0

data/alignment.gemspec

@@ -0,0 +1,47 @@
+# Generated by jeweler
+# DO NOT EDIT THIS FILE DIRECTLY
+# Instead, edit Jeweler::Tasks in Rakefile, and run 'rake gemspec'
+# -*- encoding: utf-8 -*-
+
+Gem::Specification.new do |s|
+  s.name = "alignment"
+  s.version = "0.2.0"
+
+  s.required_rubygems_version = Gem::Requirement.new(">= 0") if s.respond_to? :required_rubygems_version=
+  s.authors = ["Marius L. J\303\270hndal"]
+  s.date = "2011-12-03"
+  s.description = "Alignment functions for corpus linguistics."
+  s.email = "mariuslj (at) ifi [dot] uio (dot) no"
+  s.extensions = ["ext/gale_church/extconf.rb"]
+  s.extra_rdoc_files = [
+    "README.rdoc"
+  ]
+  s.files = [
+    "CHANGELOG",
+    "Manifest",
+    "README.rdoc",
+    "Rakefile",
+    "VERSION",
+    "ext/gale_church/.gitignore",
+    "ext/gale_church/extconf.rb",
+    "ext/gale_church/gale_church.c",
+    "lib/.gitignore",
+    "lib/alignment.rb",
+    "test/test_alignment.rb"
+  ]
+  s.homepage = "http://github.com/mlj/alignment"
+  s.require_paths = ["lib"]
+  s.rubyforge_project = "alignment"
+  s.rubygems_version = "1.8.11"
+  s.summary = "Alignment functions for corpus linguistics"
+
+  if s.respond_to? :specification_version then
+    s.specification_version = 3
+
+    if Gem::Version.new(Gem::VERSION) >= Gem::Version.new('1.2.0') then
+    else
+    end
+  else
+  end
+end
+

data/ext/gale_church/.gitignore

@@ -0,0 +1,3 @@
+Makefile
+*.o
+*.so

data/ext/gale_church/extconf.rb

@@ -0,0 +1,5 @@
+require 'mkmf'
+extension_name = 'gale_church'
+dir_config(extension_name)
+$CFLAGS='-Wall'
+create_makefile(extension_name)

data/ext/gale_church/gale_church.c

@@ -0,0 +1,411 @@
+/* NATools - Package with parallel corpora tools
+ * Original Implementation Copyright:
+ *               Pernilla Danielsson and Daniel Ridings
+ * Algorithm Copyright:
+ *               William Gale and Kenneth Church
+ * Copyright (C) 2002-2004  Alberto Sim�es
+
+ * Ruby adaptation:
+ *   Copyright (C) 2008  Marius L. J�hndal
+ *
+ * This package is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU Lesser General Public
+ * License as published by the Free Software Foundation; either
+ * version 2 of the License, or (at your option) any later version.
+ *
+ * This library is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * Lesser General Public License for more details.
+ *
+ * You should have received a copy of the GNU Lesser General Public
+ * License along with this library; if not, write to the
+ * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
+ * Boston, MA 02111-1307, USA.
+ */
+
+#include "ruby.h"
+#include <assert.h>
+#include <math.h>
+#include <stdio.h>
+#include <fcntl.h>
+#include <stdlib.h>
+#include <unistd.h>
+#include <string.h>
+
+#ifndef RSTRING_PTR /* Ruby 1.8 compatibility */
+#define RARRAY_LEN(ptr) RARRAY(ptr)->len
+#endif
+
+VALUE mLogos = Qnil;
+VALUE mGaleChurch = Qnil;
+
+void Init_gale_church();
+
+VALUE method_align(VALUE self, VALUE len1, VALUE len2);
+
+struct alignment {
+  int x1;
+  int y1;
+  int x2;
+  int y2;
+  int d;
+};
+
+static int two_side_distance(int x1, int y1, int x2, int y2);
+static int seq_align(int *x, int *y, int nx, int ny, int (*dist_funct)(),
+                     struct alignment **align);
+
+void Init_gale_church()
+{
+  mLogos = rb_define_module("Alignment");
+  mGaleChurch = rb_define_module_under(mLogos, "GaleChurch");
+  rb_define_module_function(mGaleChurch, "align", method_align, 2);
+}
+
+VALUE method_align(VALUE self, VALUE len1, VALUE len2)
+{
+  VALUE ret, res1, res2, grouped_regions1, grouped_regions2;
+
+  int n, i, ix, iy, prevx, prevy;
+  struct alignment *align, *a;
+  int *len1_x;
+  int *len2_x;
+
+  res1 = rb_ary_new();
+  res2 = rb_ary_new();
+
+  len1_x = (int *)malloc(RARRAY_LEN(len1) * sizeof(int));
+  len2_x = (int *)malloc(RARRAY_LEN(len2) * sizeof(int));
+
+  for (i = 0; i < RARRAY_LEN(len1); i++)
+    len1_x[i] = NUM2INT(rb_ary_entry(len1, i));
+
+  for (i = 0; i < RARRAY_LEN(len2); i++)
+    len2_x[i] = NUM2INT(rb_ary_entry(len2, i));
+
+  n = seq_align(len1_x, len2_x, RARRAY_LEN(len1), RARRAY_LEN(len2),
+                two_side_distance, &align);
+
+  free(len1_x);
+  free(len2_x);
+
+  prevx = prevy = ix = iy = 0;
+
+  for (i = 0; i < n; i++) {
+    a = &align[i];
+
+    if (a->x2 > 0)
+      ix++;
+    else if (a->x1 == 0)
+      ix--;
+
+    if (a->y2 > 0)
+      iy++;
+    else if (a->y1 == 0)
+      iy--;
+
+    if (a->x1 == 0 && a->y1 == 0 && a->x2 == 0 && a->y2 == 0) {
+      ix++;
+      iy++;
+    }
+
+    ix++;
+    iy++;
+
+    grouped_regions1 = rb_ary_new();
+    for (; prevx < ix; prevx++)
+      rb_ary_push(grouped_regions1, INT2FIX(prevx));
+    rb_ary_push(res1, grouped_regions1);
+
+    grouped_regions2 = rb_ary_new();
+    for (; prevy < iy; prevy++)
+      rb_ary_push(grouped_regions2, INT2FIX(prevy));
+    rb_ary_push(res2, grouped_regions2);
+  }
+
+  free(align);
+
+  ret = rb_ary_new();
+  rb_ary_push(ret, res1);
+  rb_ary_push(ret, res2);
+
+  return ret;
+}
+
+/********************************************************************/
+
+/**
+ * @file
+ * @brief Sentence-aligner main program
+ *
+ * Sentence-aligner software heavily based on Pernilla Danielsson and
+ * Daniel Ridings implementation of William Gale and Kenneth Church
+ * sentence aligner algorithm
+ *
+ * The compiled program is used as
+ * <pre>
+ *  nat-sentence-aligner -D '.PARA' -d '.End of Sentence'  file1 file2
+ * </pre>
+ * where both <i>file1</i> and <i>file2</i> are tokenized and with a
+ * token per line. In the example, '.PARA' is the hard delimiter,
+ * and '.End of Sentence' the soft delimiter. They are considered as
+ * single tokens, and as such, should appear in a line by themselves.
+ *
+ * The program is allowed to delete soft delimiters as necessary in
+ * order to align the files, but it cannot change hard delimiters.
+ *
+ * The output will be written in two files: file1.al and file2.al
+ * where each one contains aligned sentences.
+ *
+ * For debugging it can be useful to output the data in just one file.
+ * In this case, use the '-s' switch and just the 'file1.al' will be
+ * created.
+ *
+ * @todo Check if we want to document all the functions
+ */
+
+
+#define dist(x,y) distances[(x) * ((ny) + 1) + (y)]
+#define pathx(x,y) path_x[(x) * ((ny) + 1) + (y)]
+#define pathy(x,y) path_y[(x) * ((ny) + 1) + (y)]
+
+/**
+ * @brief Contant representing a big align distance between two
+ * sentences
+ */
+#define BIG_DISTANCE 2500
+
+/*
+
+seq_align by Mike Riley
+Sequence alignment routine.
+This version allows for contraction/expansions.
+
+x and y are sequences of objects, represented as non-zero ints, to be aligned.
+
+dist_funct(x1, y1, x2, y2) is a distance function of 4 args:
+
+dist_funct(x1, y1, 0, 0) gives cost of substitution of x1 by y1.
+dist_funct(x1, 0, 0, 0) gives cost of deletion of x1.
+dist_funct(0, y1, 0, 0) gives cost of insertion of y1.
+dist_funct(x1, y1, x2, 0) gives cost of contraction of (x1,x2) to y1.
+dist_funct(x1, y1, 0, y2) gives cost of expansion of x1 to (y1,y2).
+dist_funct(x1, y1, x2, y2) gives cost to match (x1,x2) to (y1,y2).
+
+align is the alignment, with (align[i].x1, align[i].x2) aligned
+with (align[i].y1, align[i].y2).  Zero in align[].x1 and align[].y1
+correspond to insertion and deletion, respectively.  Non-zero in
+align[].x2 and align[].y2 correspond to contraction and expansion,
+respectively.  align[].d gives the distance for that pairing.
+
+The function returns the length of the alignment.
+
+*/
+
+static int seq_align(int *x, int *y, int nx, int ny, int (*dist_funct)(),
+    struct alignment **align)
+{
+  int *distances, *path_x, *path_y, n;
+  int i, j, oi, oj, di, dj, d1, d2, d3, d4, d5, d6, dmin;
+  struct alignment *ralign;
+
+  distances = (int *) malloc((nx + 1) * (ny + 1) * sizeof(int));
+  path_x = (int *) malloc((nx + 1) * (ny + 1) * sizeof(int));
+  path_y = (int *) malloc((nx + 1) * (ny + 1) * sizeof(int));
+  ralign = (struct alignment *) malloc((nx + ny) * sizeof(struct alignment));
+
+  for (j = 0; j <= ny; j++) {
+    for (i = 0; i <= nx; i++) {
+      d1 = i>0 && j>0 ?         /* substitution */
+        dist(i-1, j-1) + (*dist_funct)(x[i-1], y[j-1], 0, 0)
+        : INT_MAX;
+      d2 = i>0 ?                /* deletion */
+        dist(i-1, j) + (*dist_funct)(x[i-1], 0, 0, 0)
+        : INT_MAX;
+      d3 = j>0 ?                /* insertion */
+        dist(i, j-1) + (*dist_funct)(0, y[j-1], 0, 0)
+        : INT_MAX;
+      d4 = i>1 && j>0 ?         /* contraction */
+        dist(i-2, j-1) + (*dist_funct)(x[i-2], y[j-1], x[i-1], 0)
+        : INT_MAX;
+      d5 = i>0 && j>1 ?         /* expansion */
+        dist(i-1, j-2) + (*dist_funct)(x[i-1], y[j-2], 0, y[j-1])
+        : INT_MAX;
+      d6 = i>1 && j>1 ?         /* melding */
+        dist(i-2, j-2) + (*dist_funct)(x[i-2], y[j-2], x[i-1], y[j-1])
+        : INT_MAX;
+
+      dmin = d1;
+      if (d2<dmin) dmin=d2;
+      if (d3<dmin) dmin=d3;
+      if (d4<dmin) dmin=d4;
+      if (d5<dmin) dmin=d5;
+      if (d6<dmin) dmin=d6;
+
+      if (dmin == INT_MAX) {
+        dist(i,j) = 0;
+      }
+      else if (dmin == d1) {
+        dist(i,j) = d1;
+        pathx(i,j) = i-1;
+        pathy(i,j) = j-1;
+      }
+      else if (dmin == d2) {
+        dist(i,j) = d2;
+        pathx(i,j) = i-1;
+        pathy(i,j) = j;
+      }
+      else if (dmin == d3) {
+        dist(i,j) = d3;
+        pathx(i,j) = i;
+        pathy(i,j) = j-1;
+      }
+      else if (dmin == d4) {
+        dist(i,j) = d4;
+        pathx(i,j) = i-2;
+        pathy(i,j) = j-1;
+      }
+      else if (dmin == d5){
+        dist(i,j) = d5;
+        pathx(i,j) = i-1;
+        pathy(i,j) = j-2;
+      }
+      else                      /* dmin == d6 */ {
+        dist(i,j) = d6;
+        pathx(i,j) = i-2;
+        pathy(i,j) = j-2;
+      }
+    }
+  }
+
+  n = 0;
+  for (i=nx, j=ny ; i>0 || j>0 ; i = oi, j = oj) {
+    oi = pathx(i, j);
+    oj = pathy(i, j);
+    di = i - oi;
+    dj = j - oj;
+
+    if (di == 1 && dj == 1) {  /* substitution */
+      ralign[n].x1 = x[i-1];
+      ralign[n].y1 = y[j-1];
+      ralign[n].x2 = 0;
+      ralign[n].y2 = 0;
+      ralign[n++].d = dist(i, j) - dist(i-1, j-1);
+    }
+
+    else if (di == 1 && dj == 0) {  /* deletion */
+      ralign[n].x1 = x[i-1];
+      ralign[n].y1 = 0;
+      ralign[n].x2 = 0;
+      ralign[n].y2 = 0;
+      ralign[n++].d = dist(i, j) - dist(i-1, j);
+    }
+
+    else if (di == 0 && dj == 1) {  /* insertion */
+      ralign[n].x1 = 0;
+      ralign[n].y1 = y[j-1];
+      ralign[n].x2 = 0;
+      ralign[n].y2 = 0;
+      ralign[n++].d = dist(i, j) - dist(i, j-1);
+    }
+
+    else if (dj == 1) {  /* contraction */
+      ralign[n].x1 = x[i-2];
+      ralign[n].y1 = y[j-1];
+      ralign[n].x2 = x[i-1];
+      ralign[n].y2 = 0;
+      ralign[n++].d = dist(i, j) - dist(i-2, j-1);
+    }
+
+    else if (di == 1) {    /* expansion */
+      ralign[n].x1 = x[i-1];
+      ralign[n].y1 = y[j-2];
+      ralign[n].x2 = 0;
+      ralign[n].y2 = y[j-1];
+      ralign[n++].d = dist(i, j) - dist(i-1, j-2);
+    }
+    else /* di == 2 && dj == 2 */ { /* melding */
+      ralign[n].x1 = x[i-2];
+      ralign[n].y1 = y[j-2];
+      ralign[n].x2 = x[i-1];
+      ralign[n].y2 = y[j-1];
+      ralign[n++].d = dist(i, j) - dist(i-2, j-2);
+    }
+  }
+
+  *align = (struct alignment *) malloc(n * sizeof(struct alignment));
+
+  for (i=0; i<n; i++)
+    bcopy(ralign + i, (*align) + (n-i-1), sizeof(struct alignment));
+
+  free(distances);
+  free(path_x);
+  free(path_y);
+  free(ralign);
+  return(n);
+}
+
+/* Returns the area under a normal distribution
+   from -inf to z standard deviations */
+static double pnorm(double z)
+{
+  double t, pd;
+  t = 1/(1 + 0.2316419 * z);
+  pd = 1 - 0.3989423 *
+    exp(-z * z/2) *
+    ((((1.330274429 * t - 1.821255978) * t
+       + 1.781477937) * t - 0.356563782) * t + 0.319381530) * t;
+  /* see Gradsteyn & Rhyzik, 26.2.17 p932 */
+  return(pd);
+}
+
+
+/* Return -100 * log probability that an English sentence of length
+   len1 is a translation of a foreign sentence of length len2.  The
+   probability is based on two parameters, the mean and variance of
+   number of foreign characters per English character.
+*/
+
+static int match(int len1,int len2)
+{
+  double z, pd, mean;
+
+  /* foreign characters per english character */
+  double foreign_chars_per_eng_char = 1;
+
+  /* variance per english character */
+  double var_per_eng_char = 6.8 ;
+
+  if (len1==0 && len2==0) return(0);
+  mean = (len1 + len2/foreign_chars_per_eng_char)/2;
+  z = (foreign_chars_per_eng_char * len1 - len2)/sqrt(var_per_eng_char * mean);
+
+  /* Need to deal with both sides of the normal distribution */
+  if (z < 0) z = -z;
+  pd = 2 * (1 - pnorm(z));
+
+  if (pd > 0) return((int)(-100 * log(pd)));
+  else return(BIG_DISTANCE);
+}
+
+static int two_side_distance(int x1, int y1, int x2, int y2)
+{
+  int penalty21 = 230;          /* -100 * log([prob of 2-1 match] / [prob of 1-1 match]) */
+  int penalty22 = 440;          /* -100 * log([prob of 2-2 match] / [prob of 1-1 match]) */
+  int penalty01 = 450;          /* -100 * log([prob of 0-1 match] / [prob of 1-1 match]) */
+
+  if (x2 == 0 && y2 == 0)
+    if (x1 == 0)                        /* insertion */
+      return(match(x1, y1) + penalty01);
+    else if (y1 == 0)           /* deletion */
+      return(match(x1, y1) + penalty01);
+    else
+      return (match(x1, y1)); /* substitution */
+    else if (x2 == 0)           /* expansion */
+      return (match(x1, y1 + y2) + penalty21);
+    else if (y2 == 0)           /* contraction */
+      return(match(x1 + x2, y1) + penalty21);
+    else                                /* melding */
+      return(match(x1 + x2, y1 + y2) + penalty22);
+}

data/lib/.gitignore

@@ -0,0 +1 @@
+*.so

data/lib/alignment.rb

@@ -0,0 +1,86 @@
+#!/usr/bin/env ruby
+#
+# alignment.rb - Alignment functions
+#
+# Written by Marius L. Jøhndal <mariuslj at ifi.uio.no>, 2008
+#
+require 'gale_church'
+
+module Alignment
+  def self.is_alignable?(o)
+    o.responds_to?(:weight)
+  end
+
+  # Represents an alignment of two regions, one +left+ region and one
+  # +right+ region. Both regions are arrays of alignable objects.
+  AlignedRegions = Struct.new(:left, :right)
+
+  class AlignedRegions
+    def to_s
+      "<#{self.left},#{self.right}>"
+    end
+  end
+
+  public
+
+  # Aligns two arrays of regions +a+ and +b+. Returns an array of
+  # +AlignedRegions+.
+  def self.align_regions(a, b, method = :gale_church)
+    case method
+    when :gale_church
+      x, y = Alignment::GaleChurch::align(a.collect(&:weight), b.collect(&:weight))
+      raise "Error aligning regions: returned block count does not match" unless x.length == y.length
+
+      x.zip(y).collect { |r, s| AlignedRegions.new(r.collect { |i| a[i] }, s.collect { |i| b[i] }) }
+    else
+      raise ArgumentError.new("invalid method #{method}")
+    end
+  end
+
+  class AlignableText
+    attr_reader :text
+
+    def initialize(text)
+      @text = text
+    end
+
+    def weight
+      # FIXME: character length
+      @text.length
+      # FIXME: word count
+      @text.split(' ').length
+    end
+
+    def to_s
+      @text
+    end
+  end
+
+  ANCHOR_REGEXP = /\s*\|\|\s*/
+  BOUNDARY_REGEXP = /\s*\|\s*/
+
+  # Aligns to strings of text +a+ and +b+ using method +method+. The boundaries of the
+  # blocks to be aligned are denoted by a | character (with or without surrounding
+  # white-space). The sequence || denotes an anchor (or hard delimiter), i.e. a fixed 
+  # synchronisation point. There must be the same number of anchors in both strings,
+  # but the number of boundaries may be different. The returned value is an array
+  # of pairs of aligned strings.
+  def self.align_text(a, b, method = :gale_church)
+    result = []
+
+    regions_a = a.split(ANCHOR_REGEXP)
+    regions_b = b.split(ANCHOR_REGEXP)
+
+    raise ArgumentError.new("different number of anchors in strings") unless regions_a.length == regions_b.length
+
+    regions_a.zip(regions_b).each do |x, y|
+      r = align_regions(x.split(BOUNDARY_REGEXP).collect { |region| AlignableText.new(region) },
+                        y.split(BOUNDARY_REGEXP).collect { |region| AlignableText.new(region) },
+                       method)
+      r.collect! { |i| [ i.left.collect(&:text).join(' '), i.right.collect(&:text).join(' ') ] }
+      result += r
+    end
+
+    result
+  end
+end

data/test/test_alignment.rb

@@ -0,0 +1,41 @@
+require 'alignment'
+require 'test/unit'
+
+class AlignmentTestCase < Test::Unit::TestCase
+  def test_church_alignment
+    x = [ Alignment::AlignableText.new("foo") ]
+    y = [ Alignment::AlignableText.new("bar") ]
+    assert_equal "<foo,bar>", Alignment::align_regions(x, y).collect(&:to_s).join(",")
+
+    x = [ Alignment::AlignableText.new("foo") ]
+    y = [ Alignment::AlignableText.new("bar"), Alignment::AlignableText.new("baz") ]
+    assert_equal "<foo,barbaz>", Alignment::align_regions(x, y).collect(&:to_s).join(",")
+
+    x = [ ]
+    y = [ Alignment::AlignableText.new("bar") ]
+    assert_equal "<,bar>", Alignment::align_regions(x, y).collect(&:to_s).join(",")
+
+    x = [ ]
+    y = [ ]
+    assert_equal "", Alignment::align_regions(x, y).collect(&:to_s).join(",")
+
+    x = [ Alignment::AlignableText.new("foo"), Alignment::AlignableText.new("koo") ]
+    y = [ Alignment::AlignableText.new("bar"), Alignment::AlignableText.new("baz") ]
+    assert_equal "<foo,bar>,<koo,baz>", Alignment::align_regions(x, y).collect(&:to_s).join(",")
+  end
+
+  def test_church_text_alignment
+    assert_equal [["The quick brown fox", "Den kvikke brune reven"], ["jumps", "hopper"], ["over the lazy dog", "over den trege hunden"]],
+      Alignment::align_text("The quick brown fox | jumps | over the lazy dog",
+                            "Den kvikke brune reven | hopper | over den trege hunden")
+
+    assert_equal [["The quick brown fox", "Den kvikke brune reven"], ["jumps", "hopper elegant"], ["over the lazy dog", "over den trege hunden"]],
+      Alignment::align_text("The quick brown fox | jumps | over the lazy dog",
+                            "Den kvikke brune reven | hopper elegant | over den trege hunden")
+
+    assert_equal [["The quick brown fox", "Den kvikke brune reven"], ["jumps", "hopper"], ["over the lazy dog", "elegant over den trege hunden"]],
+      Alignment::align_text("The quick brown fox | jumps || over the lazy dog",
+                            "Den kvikke brune reven | hopper || elegant | over den trege hunden")
+  end
+end
+    

metadata

@@ -0,0 +1,76 @@
+--- !ruby/object:Gem::Specification 
+name: alignment
+version: !ruby/object:Gem::Version 
+  hash: 23
+  prerelease: 
+  segments: 
+  - 0
+  - 2
+  - 0
+  version: 0.2.0
+platform: ruby
+authors: 
+- "Marius L. J\xC3\xB8hndal"
+autorequire: 
+bindir: bin
+cert_chain: []
+
+date: 2011-12-11 00:00:00 Z
+dependencies: []
+
+description: Alignment functions for corpus linguistics.
+email: mariuslj (at) ifi [dot] uio (dot) no
+executables: []
+
+extensions: 
+- ext/gale_church/extconf.rb
+extra_rdoc_files: 
+- README.rdoc
+files: 
+- CHANGELOG
+- Manifest
+- README.rdoc
+- Rakefile
+- VERSION
+- alignment.gemspec
+- ext/gale_church/.gitignore
+- ext/gale_church/extconf.rb
+- ext/gale_church/gale_church.c
+- lib/.gitignore
+- lib/alignment.rb
+- test/test_alignment.rb
+homepage: http://github.com/mlj/alignment
+licenses: []
+
+post_install_message: 
+rdoc_options: []
+
+require_paths: 
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement 
+  none: false
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      hash: 3
+      segments: 
+      - 0
+      version: "0"
+required_rubygems_version: !ruby/object:Gem::Requirement 
+  none: false
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      hash: 3
+      segments: 
+      - 0
+      version: "0"
+requirements: []
+
+rubyforge_project: alignment
+rubygems_version: 1.8.11
+signing_key: 
+specification_version: 3
+summary: Alignment functions for corpus linguistics
+test_files: []
+