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

美麗動人

書目名稱Reversible Grammar in Natural Language Processing影響因子(影響力)




書目名稱Reversible Grammar in Natural Language Processing影響因子(影響力)學(xué)科排名




書目名稱Reversible Grammar in Natural Language Processing網(wǎng)絡(luò)公開度




書目名稱Reversible Grammar in Natural Language Processing網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Reversible Grammar in Natural Language Processing被引頻次




書目名稱Reversible Grammar in Natural Language Processing被引頻次學(xué)科排名




書目名稱Reversible Grammar in Natural Language Processing年度引用




書目名稱Reversible Grammar in Natural Language Processing年度引用學(xué)科排名




書目名稱Reversible Grammar in Natural Language Processing讀者反饋




書目名稱Reversible Grammar in Natural Language Processing讀者反饋學(xué)科排名

Confess

Inherently Reversible Grammars,ne hand, we explain why grammars specified as definite programs (or the various related "unification grammars") lead to uniformity of implementation. On the other hand, we define different intrinsic reversibility properties for such grammars—the most important being finite.which says that both parsi

憤憤不平

空氣

MOT

indigenous

,Common Heuristics for Parsing, Generation, and Whatever …,euristics are totally independent of specific domains (such as syntax and semantics) and tasks (such as parsing and generation). Efficient computation for parsing and generating sentences automatically emerge thereof, capturing the essence of standard parsing procedures and semantic head-driven gene

一瞥

Compiling Trace & Unification Grammar,d ideas of Government & Binding Theory (GB). A grammar compiler is presented that transforms a grammar written in the TUG formalism into two different forms, one being useful for parsing, the other being useful for generation.

脫落

A General Computational Method for Grammar Inversion,t defines. For example, a directive .,. would assign, depending upon the binding status of its arguments, the representation .,.,. to the sentence ., or it would produce one of the several possible paraphrases of this sentence given its representation. Building such bi-directional systems has long b

Aggregate

Bi-Directional Preferences,r consideration. It examines various properties that the heuristics must have in order to produce coherent and efficient rankings, and presents ways of combining rankings into more complex preferences. Finally, it considers the issues that arise when heuristics are used bi-directionally by both the

裝勇敢地做

Handling Syntactic Alternatives in a Reversible Grammar,ccount. During parsing, the style may be extracted and used by the system, or, it can be ignored if only the denotational semantics of the sentence is needed.When the same grammar is to be used for generation as well, the syntactic style must be selected to fit in with the current discourse situatio