Please use this identifier to cite or link to this item:
Title: Use of probabilistic context free grammar for natural language interface for an application
Authors: Jotwani, Naresh D.
Agarwal, Chetan
Keywords: Human-computer interaction
User interfaces
Computer systems
Natural language processing
Computer science
Information retrieval
Interactive computer systems
Issue Date: 2008
Publisher: Dhirubhai Ambani Institute of Information and Communication Technology
Citation: Agarwal, Chetan (2008). Use of probabilistic context free grammar for natural language interface for an application. Dhirubhai Ambani Institute of Information and Communication Technology, ix, 47 p. (Acc.No: T00183)
Abstract: This thesis report deals with the development of a natural language interface for a database application (library system). This application uses Probabilistic Context Free Grammar as a computation model. The material presented in this thesis provides an overview to study the topics on Natural Language Processing, Probabilistic Context Free Grammar, Parsing and extracting the semantic from a pare tree. Probabilistic Context Free Grammar is a computational model which defines probabilistic relationships among a set of production rules for a given grammar. These probabilistic relationships among production rules have several advantages in natural language processing. The goal of natural language processing is to build computational models of Natural Languages for its analysis and generation. Application build takes a simple English sentence, parses the sentence, extracts the semantic and translates it into an SQL query. Application (library system) is coded in programming language JAVA. Though the given code is for a simple library system but can be modified according to requirements fulfilling the criteria of targeted task.
Appears in Collections:M Tech Dissertations

Files in This Item:
File Description SizeFormat 
  Restricted Access
494.2 kBAdobe PDFThumbnail
View/Open Request a copy

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