Titlebook: Current Issues in Parsing Technology; Masaru Tomita Book 1991 Springer Science+Business Media New York 1991 Constraint Satisfaction.Parsin

處理

IOTA

排斥

A Method for Disjunctive Constraint Satisfaction,pendencies. Lexical-Functional Grammar (Kaplan & Bresnan, 1982), Head-Driven Phrase-Structure Grammar (Pollard & Sag, 1987), PATR (Karttunen, 1986a), FUG (Kay, 1979, 1985), and the various forms of categorial unification grammar (Karttunen, 1986b; Uszkoreit, 1986; Zeevat, Klein, & Calder, 1987) all

誘騙

Polynomial Parsing of Extensions of Context-Free Grammars,G), Head Grammars (HG), Linear Indexed Grammars (LIG), and Tree Adjoining Grammars (TAG) are weakly equivalent, i.e., they generate the same class of string languages. Although it is known that there are polynomial-time recognition algorithms for HG and TAG (Pollard, 1984; Vijay-Shanker & Joshi, 198

褪色

委托

Chart Parsing for Loosely Coupled Parallel Systems,ly to remain true for some time. By loosely coupled I mean that the processors do not share memory, so that some form of stream or message-passing protocol is required for processor-processor communication. It follows that in most cases the programmer must make explicit appeal to communication primi

預(yù)示

Parsing with Connectionist Networks,along with rules for transforming language into these formalisms. The builders of such systems must accurately anticipate and model all of the language constructs that their systems will encounter. In loosely structured domains such as spoken language the task becomes very difficult. Connectionist n

ineffectual

Expediency

違反