000 02902nam a2200313 a 4500
003 CUTN
005 20180918160516.0
008 980115s1996 ii b 001 0 eng
020 _a8120309219
042 _alcode
082 _a006.35
_bAKS
100 _aBharati, Akshar
245 0 0 _aNatural language processing :
_ba Paninian perspective /
_cAkshar Bharati, Vineet Chaitanya, Rajeev Sangal ; with contributions from K.V. Ramakrishnamacharyulu.
250 _aEastern economy ed.
260 _aNew Delhi :
_bPrentice-Hall of India,
_c1996.
300 _axviii, 218 p. ;
_c24 cm.
505 _tIntroduction to NLP.
_tLanguage Structure and Language Analyzer
_tWord and Their Analyzer
_tLocal Word Grouping
_tPaninian Grammar
_tPaninian Parser
_tMachine Translation
_tLexical Functional Grammar
_tLFG and Indian Languages
_tTree Adjoining Grammar
_tComparing TAG with PG
_tGovernment and Binding
_tComparing GB with PG
650 0 _aComputational linguistics.
650 0 _aIndo-Aryan languages, Modern
700 1 _aChaitanya, Vineet.
700 1 _aSangal, Rajeev.
942 _2ddc
_cBOOKS
504 _aIncludes bibliographical references (p. 203-212) and index.
520 _aThis book presents a Paninian perspective towards natural language processing. It has three objectives: (1) to introduce the reader to NLP, (2) to introduce the reader to Paninian Grammar (PG) which is the application of the original Paninian framework to the processing of modern Indian languages using the computer, (3) to compare Paninian Grammar (PG) framework with modern Western computational grammar frameworks.Indian languages like many other languages of the world have relatively free word order. They also have a rich system of case-endings and post-positions. In contrast to this, the majority of grammar frameworks and designed for English and other positional languages. The unique aspect of the computational grammar describes here is that it is designed for free word order languages and makes special use of case-endings and post-positions. Efficient parsers for the grammar are also described. The computational grammar is likely to be suitable for other free word order languages of the world.Second half of the book presents a comparison of Paninian Grammar (PG) with existing modern western computational grammars. It introduces three western grammar frameworks using examples from English: Lexical Functional Grammar (LFG), Tree Adjoining Grammar (TAG), and Government and Binding (GB). The presentation does not assume any background on part of the reader regarding these frameworks. Each presentation is followed by either a discussion on applicability of the framework to free word order languages, or a comparison with PG framework.
546 _aIncludes passages in Indic languages
_b(roman).
600 0 0 _aPāṇini.
650 0 _xData processing.
710 2 _aAkshar Bharati (Group)
999 _c25844
_d25844