Dependency based re-ordering

There are dependency parsers based on constraint grammar for a few languages which Apertium would like to treat (e.g. Sámi and Faroese), it might be a nice idea to be able to do re-ordering before transfer (or during transfer) based on the dependency tree (this would not do lexical transfer, concordance or anything else, just LU reordering).

The first stage would be to convert cg-proc to output dependency information along with the lexical units. The second stage would be to write a module that builds a tree and does moving operations.

Examples

Annotation

"<Í>"
        "í" Pr @ADVL> #1->3 
"<upphavi>"
        "upphav" N Neu Sg Dat Indef @P< #2->1 
"<skapti>"
        "skapa" V Ind Prt Sg @VMAIN #3->0 
"<Gud>"
        "gudur" N Msc Sg Acc Indef @<SUBJ #4->3 
"<himmal>"
        "himmal" N Msc Sg Acc Indef @<OBJ #5->3 
"<og>"
        "og" CC @CC #6->5 
"<jørð>"
        "jørð" N Fem Sg Acc Indef @<OBJ #7->3 
"<.>"
        "." CLB #8->0 

Tree

                              0
                              |
 (2)upphav----- (1)í-------(3)skapa
                            |   | 
                            |   |________ (5)himmal----(6)og
                    ________|                | 
                   |                         ---------(7)jørð
              (4)gudur