Please use this identifier to cite or link to this item: http://localhost:8081/xmlui/handle/123456789/9316
Full metadata record
DC FieldValueLanguage
dc.contributor.authorN., Asha-
dc.date.accessioned2014-11-19T07:12:17Z-
dc.date.available2014-11-19T07:12:17Z-
dc.date.issued1993-
dc.identifierM.Techen_US
dc.identifier.urihttp://hdl.handle.net/123456789/9316-
dc.guideGarg, J. K.-
dc.guideAnurag-
dc.description.abstractThis thesis is concerned with the Implementation of a natural language understanding package, using Sanskrit grammar (Karak charts) and conceptual graphs. The package converts imperative and exclamatory sentences in English to an intermediate representation, using Sanskrit. An active lexicon has been implemented, which stores hundreds of words together with their lexical attributes. A verb-centered parser uses this information to semantically analyse the input sentence. It generates output in the, form of a conceptual graph with Karak and non-karak relations between the words of a sentence. In earlier works (12,15] declarati,Yve and interrogative sentences in English were considered. It is also shown in the present work how these two packages can be combined with the present one to give a comprehensive package for natural language understanding. This package can also be used as the basis of a question - answering system in natural languge. The implementation of the system indicates that the Sanskrit based approach may be extended to other languages too. The implementation of the package is done in Turbo C on a PC-AT compatible.en_US
dc.language.isoenen_US
dc.subjectELECTRONICS AND COMPUTER ENGINEERINGen_US
dc.subjectSENTENCE ANALYSISen_US
dc.subjectPANINIAN APPROACHen_US
dc.subjectGRAMMARen_US
dc.titleSENTENCE ANALYSIS USING PANINIAN APPROACH TO GRAMMARen_US
dc.typeM.Tech Dessertationen_US
dc.accession.number245770en_US
Appears in Collections:MASTERS' THESES (E & C)

Files in This Item:
File Description SizeFormat 
ECD245770.pdf3.55 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.