Font Size: a A A

The Computer Implementation Of Checking Theory

Posted on:2005-08-17Degree:MasterType:Thesis
Country:ChinaCandidate:J YanFull Text:PDF
GTID:2155360185974044Subject:Foreign Linguistics and Applied Linguistics
Abstract/Summary:PDF Full Text Request
Generative grammar has developed into the stage of Minimalist Program in several dozens of years. Meanwhile, computational linguistics has shown great vitality and creativity. On the background, the author has the attempt to combine the checking theory with the computer. The thesis introduces the nature, definition and development of the generative grammar, illustrates the background of the checking theory and gives a detailed introduction of the basic conceptions, content and application of the checking theory. The thesis also introduces the definition and development of computational linguistics and displays the operation skills of the morphology analysis by computers such as the choice of vocabulary and the grammatical frame. On the basis of the above introduction, the thesis analyzes the possibility of combining checking theory with computers according to the four steps of the treatment of natural language by computers, and gets the conclusion: the possibility is feasible. The C++ language is a programming language with high efficiency and wide use. Thus it is chosen to do the programming job. With the cooperation with the students majoring in computers, the possibility has become the reality. By the program, an input sentence can be judged grammatical or ungrammatical automatically by computers. The thesis is for the purpose to bridge the linguistics and computer science and make contributions to the development of the checking theory and computational linguistics.
Keywords/Search Tags:Minimalist Program, Computational Science, Checking Theory, C++ Language
PDF Full Text Request
Related items