visualization of word alignment based on bracketing (command aw); does not work for syncategorematic words yet

1 files changed, 74 insertions, 1 deletions

diff --git a/src/PGF/VisualizeTree.hs b/src/PGF/VisualizeTree.hs
index 0219dcbde..a15e380d6 100644
--- a/src/PGF/VisualizeTree.hs
+++ b/src/PGF/VisualizeTree.hs
@@ -15,13 +15,16 @@
 --        instead of rolling its own.
 -----------------------------------------------------------------------------
 
-module PGF.VisualizeTree ( visualizeTrees
+module PGF.VisualizeTree ( visualizeTrees, alignLinearize
 			) where
 
 import PGF.CId (prCId)
 import PGF.Data
+import PGF.Linearize
 import PGF.Macros (lookValCat)
 
+import Data.List (intersperse)
+
 visualizeTrees :: PGF -> (Bool,Bool) -> [Tree] -> String
 visualizeTrees pgf funscats = unlines . map (prGraph False . tree2graph pgf funscats)
 
@@ -46,3 +49,73 @@ tree2graph pgf (funs,cats) = prf [] where
 
 prGraph digr ns = concat $ map (++"\n") $ [graph ++ "{\n"] ++ ns ++ ["}"] where
   graph = if digr then "digraph" else "graph"
+
+
+-- word alignments from Linearize.linearizesMark
+-- words are chunks like {[0,1,1,0] old}
+
+alignLinearize :: PGF -> Tree -> String
+alignLinearize pgf = prGraph True . lin2graph . linsMark  where
+  linsMark t = [s | la <- cncnames pgf, s <- take 1 (linearizesMark pgf la t)]
+
+lin2graph :: [String] -> [String]
+lin2graph ss = prelude ++ nodes ++ links
+
+ where
+
+  prelude = ["rankdir=LR ;", "node [shape = record] ;"]
+
+  -- find all words
+  lins :: String -> [(String,String)]
+  lins [] = []
+  lins s = let (s1, s2)  = if null s  then ([],[]) else span (/='{') s in 
+           let (s21,s22) = if null s2 then ([],[]) else span (/='}') (tail s2) in
+           if null s21 then lins s22 else wlink s21 : lins s22
+
+  -- separate a word to the link (1,2,3) and the word itself
+  wlink :: String -> (String,String)
+  wlink s = let (s1, s2)  = span (/=']') s in 
+            (tail s1, init (drop 1 s2))
+
+  -- make all marks unique to deal with discontinuities
+  nlins :: [(Int,[((Int,String),String)])]
+  nlins = [(i, [((j,m),w) | (j,(m,w)) <- zip [0..] (lins s)]) | (i,s) <- zip [0..] ss]
+
+  nodes = map mkStruct nlins
+
+  mkStruct (i, ws) = struct i ++ "[label = \"" ++ fields ws ++ "\"] ;"
+
+  fields ws = concat (intersperse "|" [tag (mark m) ++ " " ++ w | (m,w) <- ws]) 
+
+  struct i = "struct" ++ show i
+
+  mark (j,n) = "n" ++ show j ++ "a" ++ uncommas n
+
+  uncommas = map (\c -> if c==',' then 'c' else c)
+
+  tag s = "<" ++ s ++ ">"
+
+  links = concatMap mkEdge (init nlins)
+
+  mkEdge (i,lin) = let lin' = snd (nlins !! (i+1)) in -- next lin in the list
+    [edge i v w | (v@(_,p),_) <- lin, (w@(_,q),_) <- lin', p == q]
+
+  edge i v w = 
+    struct i ++ ":" ++ mark v ++ " -> " ++ struct (i+1) ++ ":" ++ mark w ++ " ;"
+
+{-
+digraph{
+rankdir ="LR" ;
+node [shape = record] ;
+
+struct1 [label = "<f0> this|<f1> very|<f2> intelligent|<f3> man"] ;
+struct2 [label = "<f0> cet|<f1> homme|<f2> tres|<f3> intelligent|<f4> ci"] ;
+
+struct1:f0 -> struct2:f0 ;
+struct1:f1 -> struct2:f2 ;
+struct1:f2 -> struct2:f3 ;
+struct1:f3 -> struct2:f1 ;
+struct1:f0 -> struct2:f4 ;
+}
+-}
+