source: src/tre/tre @ e7de6cc

#!/usr/bin/ruby1.9.1 -I /usr/local/lib/utt -I $HOME/.local/lib/utt
# -*- coding: iso-8859-2 -*-

$: << "#{ENV['HOME']}/.local/lib/utt"
$: << "/usr/local/lib/utt"

require 'getoptlong'
require 'seg.rb'

opts = GetoptLong.new(
[ '--help',     '-h',   GetoptLong::NO_ARGUMENT ],
[ '--debug',    '-d',   GetoptLong::NO_ARGUMENT ],
[ '--format',   '-F',   GetoptLong::REQUIRED_ARGUMENT ],
[ '--info',     '-I',   GetoptLong::REQUIRED_ARGUMENT ],
[ '--span',     '-s',   GetoptLong::REQUIRED_ARGUMENT ],
[ '--maxsize',          GetoptLong::REQUIRED_ARGUMENT ],
[ '--forest',           GetoptLong::NO_ARGUMENT ],
[ '--ground',           GetoptLong::NO_ARGUMENT ],
[ '--only-trees','-t',  GetoptLong::NO_ARGUMENT ])

$helptext=
"The program generates trees from the graph output by dgp. dgp must\n"+
"must be run with '-i ds' option.\n\n"+
"Command:       tre [options]\n\n"+
"Options:\n"+
"--help         -h      Print help (this text) and exit.\n"+
"--debug        -d      Verbose output. For developers only.\n"+
"--format=s     -F s    Output format. Recognized values:\n"+
"                               a       root + list of arcs\n"+
"                               p       parenthesized notation\n"+
"                               h       human readable indented tree format\n"+
"                       Multiple values are allowed. (default p)\n"+
"--info=s       -I s    Information printed. Recognized values:\n"+
"                               n       node identifier\n"+
"                               f       surface form\n"+
"                               m       morphological information\n"+
"                               l       arc labels\n"+
"--only-trees   -t      Do not copy input. Print trees only.\n"

$DEBUG=false
$FORMAT='p'
$INFO='DEFAULT'
$ONLYTREES=false
$START=nil
$END=nil
$FOREST=false
$MAXSIZE=nil

opts.each do |opt, arg|
  case opt
  when '--help'
    print $helptext
    exit 0
  when '--debug'
    $DEBUG=true
  when '--format'
    $FORMAT=arg
  when '--info'
    $INFO=arg
  when '--only-trees'
    $ONLYTREES=true
  when '--forest'
    $FOREST=true
  when '--ground'
    $GROUND=true
  when '--maxsize'
    $MAXSIZE=arg.to_i
  when '--span'
    $START,$END = arg.split ','
  else
    print "Unknown option #{opt}. Ignored.\n"
  end
end

if $INFO=='DEFAULT'
  case $FORMAT
    when 'p','a'
    $INFO='nl'
    when 'h'
    $INFO='fmnl'
  end
end

$dgpsep=';'

def tre(input)
  $gphid=[]
  $form=[]
  $lem=[]
  $ord1=[]
  $count=0
  nodes=[]
  prevpos=-1
  tokennumber=0
  for line in input
    seg=Seg.new(line)
    print line unless $ONLYTREES || seg.field(3) == 'EOS'
    
    if dgp=seg['dgp']
      if nodes==[] && seg[3]!='BOS'
        print "A sentence must start with BOS segment. Aborting.\n"
        return
      end

      id=dgp[/^\d+/].to_i

      if gph=seg['gph']
        $gphid[id]=gph[/^\d+/].to_i
      else
        print "No gph field. Aborting.\n"
        return
      end

      $form[$gphid[id]] = seg[4]
      $lem[$gphid[id]] = seg['lem']
      $ord1[$gphid[id]] = if prevpos==seg[1].to_i then tokennumber
                         else prevpos=seg[1].to_i; tokennumber+=1 end
              
      nodes[id] = [seg[1].to_i,seg[2].to_i,dgp]

      if seg[3]=='EOS'

        $pref = "#{seg[1]} #{seg[2]} SYN *"

        parsegraph(nodes)

        set_ord #(0...(nodes.length)).each{|i| set_distance_from_i i }

        printgraph if $DEBUG

        if $GROUND
          printground
        else
          thetrees = $FOREST ? genforest : gentrees
          
          output_trees thetrees
          
          print line unless $ONLYTREES
          
          $gphid=[]   # POWTÓRZENIE
          $form=[]
          $lem=[] 
          $ord1=[]
          $count=0      
          nodes=[]
          prevpos=-1
          tokennumber=0
        end
      end
    end
  end
end


def output_trees trees
  for t in trees
    $count += 1
    t1=ground(t)

    span = $FOREST ? " span:" + (ground_tree_min(t1).to_s + ","+ground_tree_max(t1).to_s)+";" : ""
    case $FORMAT
    when /a/
      print "#{$pref} tre:#{$count}#{span} #{arcsinfo(t1[0],t1[1])}"
#       print arcsinfo(t1[0],t1[1])
      print "\n"
    when /p/
      print "#{$pref}#{span} tre:#{$count} par:"
      printpar(t1[0],t1[1])
      print "\n"
    when /h/
      print "#\n# tree #{$count}\n# ------\n"
      printtree(t1[0],t1[1],0)
    end
  end
end


def nodeinfo(id)
  info=""
  if $INFO =~ /o/
    info += $ord1[id].to_s                           
    info += '.' if $INFO =~ /[nfm]/
  end
  if $INFO =~ /n/
    info += id.to_s                           
    info += '.' if $INFO =~ /[fm]/
  end
  if $INFO =~ /f/
    info += $form[id] 
    info += ';' if $INFO =~ /m/
  end
  if $INFO =~ /m/
    info += $lem[id]  
  end
  info
end


def arcsinfo(root,arcs)
  "head:#{nodeinfo(root)} links:" + arcs.map{|a| "(#{($INFO =~ /l/) ? a[2]+":" : ""}#{nodeinfo(a[0])}-#{nodeinfo(a[1])})"}.join("")
#   for a in arcs
#     print ';'
#     print "#{a[2]}:" if $INFO =~ /l/
#       print nodeinfo(a[0])+'-'+nodeinfo(a[1])
#   end
end

def printtree(root,arcs,o)
  if o==0
        print "# %-16s" % "root: "
  end
  print nodeinfo(root),"\n"
  for arc in arcs.select{ |a| a[0]==root }.sort{|a,b| a[1]<=>b[1] }
    print '# ',"   "*(o+1)
    print "%-16s" % (arc[2]+": ")
    printtree(arc[1],arcs,o+1)
  end
end

def printpar(root,arcs)
  print nodeinfo(root)
  deps = arcs.select{ |a| a[0]==root }.sort{|a,b| a[1]<=>b[1] }
  unless deps == []
    print '('
    cont=false
    for arc in deps
      if cont then print ',' else cont=true end
      print arc[2],':' if $INFO =~ /l/
      printpar(arc[1],arcs)
    end
    print ')'
  end
end


def ground_tree_min t
  ([t[0]]+t[1].map{|e| [e[0],e[1]]}).flatten.min
end

def ground_tree_max t
  ([t[0]]+t[1].map{|e| [e[0],e[1]]}).flatten.max
end



def parsegraph(nodes)

  $n   =nodes.length
  $sat =[]; $vis =[]; $succ=[]; $lhs =[]; $arcs=[]; $pos=[]; $len=[]; $ord=[]; $distance={}

  for dgp in nodes

    parts  = dgp[2].split($dgpsep,7)

    if parts[3]==nil || parts[4]==nil || parts[5]==nil
      $stderr.print "ERR: tre requires dgp be called with '--info s' option. Aborting.\n"
      exit
    end

    i      = parts[0].to_i
    $pos[i] = dgp[0].to_i
    $len[i] = dgp[1].to_i
    $sat << i if parts[1]=="s"

    $arcs |= parts[2].split(',').map{ |a| case a 
                                          when /\-\-(\w+)-(\d+)\((\d+)~(\d+)\)/
                                            [i, $2.to_i, $1, $3.to_i, $4.to_i]
                                          when /\+\+(\w+)-(\d+)\((\d+)~(\d+)\)/
                                            [$2.to_i, i, $1, $3.to_i, $4.to_i]
                                          end }
    $succ |= parts[3][1..-2].split(',').map{|x| [x.to_i,i]}
    $vis  |= parts[4][1..-2].split(',').map{|x| [x.to_i,i]} 
    $lhs  |= parts[5][1..-2].split(',').map{|x| [x.to_i,i]} + [[i,i]]

  end

end


def ground(t)
  [ $gphid[t[0]] , t[1].map{|a| [$gphid[a[0]],$gphid[a[1]],a[2]]} ]
end  


#NOWE-START

def successors i
  $succ.select{|e| e[0]==i}.map{|e| e[1]}
end

def predecessors i
  $succ.select{|e| e[1]==i}.map{|e| e[0]}
end

def start_nodes
  $succ.map{|e| e[1]}.map{|e| predecessors(e)}.uniq.map{|e| e[0]}
end

def end_nodes
  $succ.map{|e| e[0]}.map{|e| successors(e)}.uniq.map{|e| e[0]}
end

def set_ord
  positions = $pos.uniq.sort
  (0...$n).each{|i| $ord[i] = positions.index($pos[i]) }
end


def set_distance_from_i i
  set_distance_from_i_to_jth_successors_to_v i, i, 1
end

def set_distance_from_i_to_jth_successors_to_v i, j , v
  succ = successors(j)
  for j1 in succ
    $distance[[i,j1]] = v
    set_distance_from_i_to_jth_successors_to_v i, j1, v+1
  end
end

#NOWE-END


def gentrees
  bos=0; eos=$n-1;
  gentrees2 bos, eos
end


def genforest
  forest=[]
  for bos in start_nodes
    for eos in end_nodes # tu s± te¿ wierzcho³ki poprzedzaj±ce!!!
      next if $ord[bos] > $ord[eos] or ($MAXSIZE != nil and $ord[eos] - $ord[bos] > $MAXSIZE+1)
      forest += gentrees2(bos,eos)
    end
  end
  forest
end

def gentrees2 bos, eos
  $thetrees=[];
  roots = (1...eos).select{|i| $vis.include? [i,eos]}.select{|i| $vis.include? [bos,i]}

  if $DEBUG then print "ROOTS: #{roots.inspect}\n" end
  for root in roots
    gentrees3 bos, eos, root
  end
  $thetrees
end

def gentrees3 bos, eos, root
  $theroot=root
  $thebos=bos
  $theeos=eos
  for r in buildR(root , eos, [])
    (rmin,rmax,rtree) = r
    buildR(bos, rmin, rtree)
  end
end

def buildR(min, max, tree)
  if $DEBUG then print "buildR--#{min}--#{max}--#{tree.inspect}\n" end
  trees=[]
  for a in $arcs.select{|a| a[0]==max && $vis.include?([min,a[1]]) }
    if $DEBUG then print "ARC: #{a.inspect}\n" end
    for r in buildR(a[4],a[3],tree+[a])                 #!!! buildR(a[1],a[3],tree+[a])
      (rmin,rmax,rarcs) = r
      for l in buildR(min,rmin,rarcs)
        (lmin,lmax,larcs) = l
        trees << [lmin,rmax,larcs]
      end
    end
  end
  for i in (0...$n).select{|i| $succ.include?([i,max])}.select{|i| $lhs.include?([min,i])}
    for l in buildL(min,i,tree)
      (lmin,lmax,larcs) = l
      trees << [lmin,lmax,larcs]
    end
  end
  trees  
end
    

def buildL(min,max,tree)
  if $DEBUG then print "buildL--#{min}--#{max}--#{tree.inspect}\n" end
  if $pos[min]==$pos[max]
    if min==$thebos && max==$thebos
      $thetrees.push [$theroot,tree]
      if $DEBUG then print "adding tree: #{tree.inspect}\n" end
    end
    return [[max,max,tree]]
  end
  trees=[]
  for arc in $arcs.select{|a| a[1]==max && $lhs.include?([min,a[0]]) }
    if $DEBUG then print "ARC: #{arc.inspect}\n" end
    for r in buildR(arc[3],arc[4],tree+[arc]) ### buildR(arc[3],max,tree+[arc])
      (rmin,rmax,rarcs) = r
      for l in buildL(min,rmin,rarcs)
        (lmin,lmax,larcs) = l
        trees << [lmin,lmax,larcs]
      end
    end
  end
  trees
end


def printgraph()
  print "N:    #{$n}\n"
  print "SAT:  #{set_to_s($sat)}\n"
  print "SUCC: #{rel_to_s($succ)}\n"
  print "VIS:  #{rel_to_s($vis)}\n"
  print "LHS:  #{rel_to_s($lhs)}\n"
  print "ARCS: #{arcs_to_s($arcs)}\n"
end


def printground
  for i in 1...($form.length-1)
    print "#{$ord1[i]} #{$form[i]} #{$lem[i]} "
    print $arcs.select{|a| $ord1[$gphid[a[1]]] == $ord1[i]}.map{|a| "#{a[2]}:#{$ord1[$gphid[a[0]]]}"}.sort.uniq.join(' ')
    print "\n"
  end
end


def set_to_s(s) "{#{s.join(',')}}" end
def rel_to_s(r) "{#{r.map{|p| "(#{p[0]},#{p[1]})"}.join(',')}}" end
def arc_to_s(q) "-#{q[0]}-#{q[2]}-#{q[1]}/#{q[3]}" end
def arcs_to_s(a) "{#{a.map{|q| arc_to_s(q)}.join(',')}}" end

######################################################################

tre($stdin)