Download Computational Linguistics: An Introduction by Ralph Grishman PDF

By Ralph Grishman

Inspite of the speedy development of curiosity within the desktop research of language, this publication offers an built-in advent to the sector. necessarily, while many alternative ways are nonetheless being thought of, a simple paintings of synthesis will be neither attainable nor workable. however, Ralph Grishman presents a beneficial survey of varied methods to the issues of syntax research, semantic research, textual content research and common language iteration, whereas contemplating in higher element those who appear to him most efficient. The e-book is written for readers with a few heritage in desktop technology and finite arithmetic, yet complex wisdom of programming languages or compilers isn't really beneficial and neither is a history in linguistics. The exposition is often transparent and scholars will locate the workouts and broad bibliography helping the textual content relatively priceless.

Show description

Read Online or Download Computational Linguistics: An Introduction PDF

Best language & grammar books

Precursors of functional literacy

The aim of this quantity is to give fresh learn within the box of the purchase of sensible literacy and its precursors. the quantity goals to trap the state-of-the-art during this speedily increasing box. An try out is made to elucidate the imprecise and sometimes inconsistent definitions of useful literacy from the point of view of improvement.

Additional info for Computational Linguistics: An Introduction

Sample text

Write at. of a. an. the lengthy. old slowly. poorly Each word of the language is assigned one or more word categories on the basis of its grammatical properties. The assignment is based on the word's use in the language as a whole, not its use in a particular sentence or text. For example, 'users' and 'problems' would each be classified as a noun, while 'cause' would be assigned the three categories tensed verb, un tensed verb. and noun. Every sequence of words is thereby associated with one or more sequences of word categories.

The rejection rules incorporated some constraints which previously were only in the forward transformational component, and so eliminated some trees in step (2) which before had survived to step (4). The rejection rules had a significant effect on parsing times - the 11word sentence which took 36 minutes before now took only 61. The system developed by Petrick (Petrick 1965, 1966; Keyser and Petrick 1967) was similar in outline: applying a series of reverse transformations, checking if the resulting tree can be generated by the base component, and then verifying the analysis by applying the forward transformations to the base tree.

7 In other words, this 42 2 Syntax analysis Most of the word categories have already appeared in our small string grammar: N for noun, v for verb, P for preposition, T for article, and ADJ for adjective. M represents the class of modal auxiliaries: 'do'. 'can', 'may', etc . Some of the non-terminal symbols correspond closely to symbols in the string grammar: NP to NSTG, PP to PN, and S to ASSERTION. On the other hand, we do not have symbols corresponding to SUBJECT, VERB, or OBJECT. Recall that these symbols were introduced into the string grammar to group alternative subject and object strings; in a transformational grammar, the more complex strings are introduced transforrnationally, so this need does not arise.

Download PDF sample

Rated 4.75 of 5 – based on 19 votes