A Metalanguage for Expressing Grammatical Restrictions in Nodal Spans Parsing of Natural Language (Classic Reprint)

Angebote / Angebote:

Excerpt from A Metalanguage for Expressing Grammatical Restrictions in Nodal Spans Parsing of Natural Language Within the level of syntactic analysis by computer possible today, a large number of English sentences are ambiguous, even highly ambiguous. In a natural language processing system which is too large for disambiguation by a semantic component, it may often be desirable to produce all parses of a setnence. Top-down single-tracking algorithms necessarily require exponential time in this environment. The bottom-up nodal Spans, or Earley's parsing algorithm procuces all parses in parallel in time n3, yields a convenient representation of ambiguity, and therefore seems more desirable for this task. Briefly, if a portion of an input string is capable of two different interpretations which in turn can be subsumed under the same symbol, the algorithm represents this symbol by only one node in the tree-like structure it builds. Ambiguity is thus localized and prevented from causing exponential explosion. In addition, a device known as candidates lists, or predictor. About the Publisher Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully, any imperfections that remain are intentionally left to preserve the state of such historical works.