The algorithm can be run with input SSF format of Hindi-urdu Dependency Treebank. It will generate Phrase structure trees for the corresponding dependency trees. A have given a sample of dependency tree file that can be used as an input.
Python
Switch branches/tags
Nothing to show
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
Clause_joining.py
Phrases.py
README.md
Rule_Selection.py
V_Type.py
Word_order.py
conversion.py
sample_input.dat
ssf_api.py

README.md

Hindi_DS_to_PS_Conversion

The algorithm can be run with input SSF format of Hindi-urdu Dependency Treebank. It will generate Phrase structure trees for the corresponding dependency trees. Please see this paper for more details.

I have given a sample file of dependency trees that can be used as an input.

conversion.py is the main module which takes dependency tree as input (in the format given in sample_input file) and prints output PS trees (in form of bracketted notation).