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

subacute

Eructation

https://doi.org/10.1007/978-3-319-02171-3pendencies. 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

單挑

https://doi.org/10.1007/978-3-319-02171-3G), 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

NOTCH

Sinusoidal Oscillators: Problemsvestigated. In these papers parallel lexical analysis, syntactic analysis (parsing) and code generation were discussed. At that time various multi-processor computers were introduced (CDC 6500, 7600, STAR, ILLIAC IV, etc.) and the first attempts were made to construct compilers which used more than

Trochlea

Electrical Resonance: Solutionsly 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

正常

Allowance

Computer Communications and Networksncies of computation. The Programming Language for Natural Language Processing (PLNLP: Heidorn, 1972) is well suited for this task. PLNLP provides a general programming capability, including a rule-writing formalism and algorithms for both parsing (“decoding”) and generation (“encoding”). Although l

公理

密碼

Obsequious

A Probabilistic Parsing Method for Sentence Disambiguation,Constructing a grammar which can parse sentences selected from a natural language corpus is a difficult task. One of the most serious problems is the unmanageably large number of ambiguities. Pure syntactic analysis based only on syntactic knowledge will sometimes result in hundreds of ambiguous parses.