Titlebook: Reversible Grammar in Natural Language Processing; Tomek Strzalkowski Book 1994 Springer Science+Business Media Dordrecht 1994 Parsing.com

Infirm

conceal

Vldl379

Handling Syntactic Alternatives in a Reversible Grammar,ctional feature system we use is more complex than previous treatments, and allows control over a wider range of syntactic structures, in a fairly sophisticated grammar. The functional features are controlled using “threading” techniques when dealing with unbounded dependencies, clefting, and topicalisation.

碎片

Inherently Reversible Grammars,ng and generation are.enumerable (see text)— and give examples and counter-examples of grammars which possess or do not possess these intrinsic properties. We also show that, under a certain "moderation" condition on linguistic description, finite enumerability of parsing is equivalent to finite enumerability of generation.

花費

,Common Heuristics for Parsing, Generation, and Whatever …,ration. This is a step towards a unified architecture of natural language processing and intelligence in general in which various sorts of constraints such as grammar, lexicon and common sense are integrated in an isotropic and context-dependent fashion.

得意人

Parley

Conquest

通便

A Generationist Approach to Grammar Reversibility in Natural Language Processing, brief comparison with other models is offered at various points.) Finally, I discuss briefly the reasons why the `parser-generator reversibility hypothesis’ may have been introduced to the NLP context.

synchronous

Book 1994forComputational Linguistics. .This book will be a valuable reference to researchers in linguisticsand computer science with interests in computational linguistics,natural language processing, and machine translation, as well as inpractical aspects of computability. .