International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 43 - Issue 22 |
Published: April 2012 |
Authors: Lalita Kumari, Radhey Shyam, Swapan Debbarma, Nirmalya Kar, Smita Das |
![]() |
Lalita Kumari, Radhey Shyam, Swapan Debbarma, Nirmalya Kar, Smita Das . Government and Binding Theory for Hindi Language. International Journal of Computer Applications. 43, 22 (April 2012), 42-45. DOI=10.5120/6406-8892
@article{ 10.5120/6406-8892, author = { Lalita Kumari,Radhey Shyam,Swapan Debbarma,Nirmalya Kar,Smita Das }, title = { Government and Binding Theory for Hindi Language }, journal = { International Journal of Computer Applications }, year = { 2012 }, volume = { 43 }, number = { 22 }, pages = { 42-45 }, doi = { 10.5120/6406-8892 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2012 %A Lalita Kumari %A Radhey Shyam %A Swapan Debbarma %A Nirmalya Kar %A Smita Das %T Government and Binding Theory for Hindi Language%T %J International Journal of Computer Applications %V 43 %N 22 %P 42-45 %R 10.5120/6406-8892 %I Foundation of Computer Science (FCS), NY, USA
Government and Binding theory is used to analyze phase structure rules in Natural Language Processing. It is used to filter out grammatically incorrect sentence. Government and Biding (GB) theory is useful and well applicable in English language. This paper shows way to apply GB theory on Hindi Language. For Applying on Hindi, GB theory is modified little bit, but its flavor is intact. Using this, all components and attributes of Government and Binding can be easily described for Hindi language.