Pinned Repositories
AcceptabilityStudy
BachReplicationDutch_List1
BachReplicationDutch_List2
BachReplicationDutch_List3
BachReplicationDutch_List4
BachReplicationGerman_List1
CGS698C
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. A have given a sample of dependency tree file that can be used as an input.
LV05
R package for using Lewis and Vasishth (2005) model. Under testing.
measures_of_nonProjectivity
yadavhimanshu059's Repositories
yadavhimanshu059/CGS698C
yadavhimanshu059/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. A have given a sample of dependency tree file that can be used as an input.
yadavhimanshu059/LV05
R package for using Lewis and Vasishth (2005) model. Under testing.
yadavhimanshu059/measures_of_nonProjectivity
yadavhimanshu059/AcceptabilityStudy
yadavhimanshu059/BachReplicationDutch_List1
yadavhimanshu059/BachReplicationDutch_List2
yadavhimanshu059/BachReplicationDutch_List3
yadavhimanshu059/BachReplicationDutch_List4
yadavhimanshu059/BachReplicationGerman_List1
yadavhimanshu059/BachReplicationGerman_List2
yadavhimanshu059/BachReplicationGerman_List3
yadavhimanshu059/BachReplicationGerman_List4
yadavhimanshu059/BachRSVPDutch_List1
yadavhimanshu059/BachRSVPDutch_List2
yadavhimanshu059/BachRSVPDutch_List3
yadavhimanshu059/BachRSVPDutch_List4
yadavhimanshu059/BachRSVPGerman_List1
yadavhimanshu059/BachRSVPGerman_List2
yadavhimanshu059/BachRSVPGerman_List3
yadavhimanshu059/BachRSVPGerman_List4
yadavhimanshu059/BachSPRDutch_Testing
yadavhimanshu059/CGS600A
yadavhimanshu059/crossing_constraints_baselines
yadavhimanshu059/DLM-ICM-baselines
yadavhimanshu059/Hindi_DS_to_PS_Conversion_v2.0
This version of conversion algorithm handles non-projective trees. In addition to generating phrase structure trees for projective dependencies, the current version also converts the non-projective dependencies. This version of the our algorithm successfully converts 98.2% of the dependency trees.
yadavhimanshu059/Programming-C3-course
yadavhimanshu059/RatingStudyTesting
yadavhimanshu059/tufte-latex
A Tufte-inspired LaTeX class for producing handouts, papers, and books