Please use this identifier to cite or link to this item: http://localhost:8081/xmlui/handle/123456789/9241
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBhondwe, Harsh-
dc.date.accessioned2014-11-19T05:22:50Z-
dc.date.available2014-11-19T05:22:50Z-
dc.date.issued1994-
dc.identifierM.Techen_US
dc.identifier.urihttp://hdl.handle.net/123456789/9241-
dc.guideGarg, Kumkum-
dc.description.abstractTo generate text, it ry ,t.em must choose rorne I nformat ion based on 'what to say' from its knowledgebase, decide 'how to organize it', and determine 'how to realize it' In natural language. This work is an attempt to generate coherent text, to achieve communicative goals input by the user, in the domain of Economics. Relations from Rhetorical Structure Theory are used as plans to organize the text as a paragraph tree. The construction of the paragraph tree is a top down goal oriented recursive process. Templates and Definite Clause Grammar are used to generate individual clauses and sentences. They form the components of the Surface Generator which takes over after the paragraph tree has been constructed. The domain knowledgebase Is represented to meet the requirement of generation of natural language. The different components of the Generator : Deep generation, Surface generation and Domain Knowledgebase are independently modifiable. This dissertation discusses the theory, design, implementation of such a generator and evaluates the results. The Generator is written in Turbo :Prolog and runs on a PC XT/AT under MS-DOS.en_US
dc.language.isoenen_US
dc.subjectELECTRONICS AND COMPUTER ENGINEERINGen_US
dc.subjectGOAL ORIENTED MULTI-SENTENCE TEXT GENERATIONen_US
dc.subjectDOMAIN KNOWLEDGEBASEen_US
dc.subjectSURFACE GENERATORen_US
dc.titleGOAL ORIENTED MULTI-SENTENCE TEXT GENERATIONen_US
dc.typeM.Tech Dessertationen_US
dc.accession.number246537en_US
Appears in Collections:MASTERS' THESES (E & C)

Files in This Item:
File Description SizeFormat 
ECD246537.pdf3.03 MBAdobe PDFView/Open


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