標(biāo)題: Titlebook: Current Issues in Parsing Technology; Masaru Tomita Book 1991 Springer Science+Business Media New York 1991 Constraint Satisfaction.Parsin [打印本頁] 作者: CK828 時間: 2025-3-21 16:45
書目名稱Current Issues in Parsing Technology影響因子(影響力)
書目名稱Current Issues in Parsing Technology影響因子(影響力)學(xué)科排名
書目名稱Current Issues in Parsing Technology網(wǎng)絡(luò)公開度
書目名稱Current Issues in Parsing Technology網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Current Issues in Parsing Technology被引頻次
書目名稱Current Issues in Parsing Technology被引頻次學(xué)科排名
書目名稱Current Issues in Parsing Technology年度引用
書目名稱Current Issues in Parsing Technology年度引用學(xué)科排名
書目名稱Current Issues in Parsing Technology讀者反饋
書目名稱Current Issues in Parsing Technology讀者反饋學(xué)科排名
作者: 壁畫 時間: 2025-3-21 22:41
Background: Banking and Causality, to the development of Prolog (Cohen, 1988; Colmerauer, 1978) and is analyzed in some detail in (Pereira & Warren, 1980) for Context-Free languages and Horn Clauses. A notable outcome is the parsing technique known as Earley deduction (Pereira & Warren, 1983).作者: 狗舍 時間: 2025-3-22 00:31 作者: INCH 時間: 2025-3-22 04:41 作者: 運動吧 時間: 2025-3-22 12:35
Computer Communications and Networkst are combined to form a rectangular ., and regions are combined to form a larger region using a 2-dimensional phrase structure rule. The parsing algorithms presented in this chapter are 2D-Earley algorithm and 2D-LR algorithm, which are a 2-dimensionally extended version of Earley’s algorithm and the Generalized LR algorithm, respectively.作者: interrupt 時間: 2025-3-22 13:18
Parsing with Discontinuous Phrase Structure Grammar,words. Semantically, it is motivated by the compositionality principle, which entails the decomposition of sentences into meaningful parts in order to systematically derive sentence meanings from individual word meanings.作者: interrupt 時間: 2025-3-22 20:54
Polynomial Parsing of Extensions of Context-Free Grammars,5), there are no known polynomial-time recognition algorithms that work . with CCG or LIG. In this chapter we present polynomial-time recognition algorithms for LIG and CCG that resemble the CKY algorithm for Context-Free Grammars (CFG) (Kasami, 1965; Younger, 1967). We also show how this approach can be adapted for TAG.作者: Highbrow 時間: 2025-3-22 23:19
Overview of Parallel Parsing Strategies,one processor when compiling programs. Slowly, with the advent of new parallel architectures and the ubiquitous application of VLSI, interest increased and presently research on parallel compiling and executing is widespread.作者: caldron 時間: 2025-3-23 02:47
Chart Parsing for Loosely Coupled Parallel Systems,tives in the construction of software which exploits the available parallelism. Even in shared-memory systems, the absence of parallel constructs from available programming languages may mean that appeal to a similar communication model may be necessary, at least in the short term.作者: FLAIL 時間: 2025-3-23 05:55 作者: chalice 時間: 2025-3-23 10:24 作者: 咆哮 時間: 2025-3-23 14:24
Parsing Spoken Language Using Combinatory Grammars,on-argument relations in their interpretation, the proliferation of structural analyses presents obvious problems for parsing within this framework and the related approaches based on the Lambek calculus (cf. Moortgat, 1988).作者: Jejune 時間: 2025-3-23 20:42
A Dependency-Based Parser for Topic and Focus,the written form of language; however, due regard will be also paid to (at least some of) the suprasegmental features and additional remarks will be made with respect to parsing strategies for written and spoken English.作者: dura-mater 時間: 2025-3-24 02:13
Parsing with Lexicalized Tree Adjoining Grammar,, & Sag, 1985), HPSG (Pollard & Sag, 1987), Combinatory Categorial Grammars (Steedman, 1987), Karttunen’s version of Categorial Grammar (Karttunen, 1986, 1988), some versions of GB theory (Chomsky, 1981), and Lexicon-Grammars (Gross, 1984).作者: expeditious 時間: 2025-3-24 03:56 作者: Inclement 時間: 2025-3-24 08:29
Parsing with Connectionist Networks,e constructs that their systems will encounter. In loosely structured domains such as spoken language the task becomes very difficult. Connectionist networks that learn to transform input word sequences into meaningful target representations may be useful in such cases.作者: 不可接觸 時間: 2025-3-24 11:39 作者: GROVE 時間: 2025-3-24 16:12 作者: 凹槽 時間: 2025-3-24 20:28 作者: 協(xié)議 時間: 2025-3-25 02:07 作者: tolerance 時間: 2025-3-25 07:10 作者: 波動 時間: 2025-3-25 07:40 作者: hankering 時間: 2025-3-25 11:59
Why Parsing Technologies?,uired to cope with the messy languages. Many linguistic theories and formalisms have been developed and discussed in the area of Computational Linguistics last couple of decades. On the other hand, there have been many practical systems that involve natural language parsing, such as machine translat作者: Ergots 時間: 2025-3-25 19:46 作者: 大猩猩 時間: 2025-3-25 22:19
Parsing with Lexicalized Tree Adjoining Grammar,xicon is thereby increased in both amount and complexity: see, for example, lexical rules in LFG (Kaplan & Bresnan, 1983), GPSG (Gazdar, Klein, Pullum, & Sag, 1985), HPSG (Pollard & Sag, 1987), Combinatory Categorial Grammars (Steedman, 1987), Karttunen’s version of Categorial Grammar (Karttunen, 19作者: BRINK 時間: 2025-3-26 03:44 作者: exophthalmos 時間: 2025-3-26 04:29
Parsing with Categorial Grammar in Predictive Normal Form,ammatical categories are viewed as functional types, be generalized in order to analyze “noncanonical” natural language constructions such as whextraction and nonconstituent conjunction. A consequence of these augmentations is an explosion of semantically equivalent derivations admitted by the gramm作者: 陳腐思想 時間: 2025-3-26 12:24
PREMO: Parsing by conspicuous lexical consumption,inguistic and AI models. Recent years have also seen rising interest in the computational analysis of machine-readable dictionaries as a lexical resource for parsing. These two trends are neither accidental nor independent of each other; an obvious place to look for large-scale linguistic informatio作者: EXULT 時間: 2025-3-26 14:05 作者: sleep-spindles 時間: 2025-3-26 19:17
Parsing Spoken Language Using Combinatory Grammars,inatory Logic, such as functional composition and type raising. The introduction of such operations is motivated by the need to provide an explanatory account of coordination and unbounded dependency. However, the associativity of functional composition tends to engender an equivalence class of poss作者: 處理 時間: 2025-3-27 00:20 作者: IOTA 時間: 2025-3-27 05:10 作者: 排斥 時間: 2025-3-27 07:37
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 作者: 誘騙 時間: 2025-3-27 12:55
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作者: 褪色 時間: 2025-3-27 14:20 作者: 委托 時間: 2025-3-27 21:43
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ù)示 時間: 2025-3-27 22:51
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 時間: 2025-3-28 05:24 作者: Expediency 時間: 2025-3-28 09:35 作者: 違反 時間: 2025-3-28 13:38 作者: MOAT 時間: 2025-3-28 17:01 作者: negligence 時間: 2025-3-28 19:03 作者: BUOY 時間: 2025-3-29 02:41
Zitha Mokomane,Francine Masson,Eleanor Rossrr, 1987; Johnson; Kolb & Thiersch, 1988; and Stabler, 1989). In this framework, a fixed set of universal principles parameterized according to particular languages interact deductively to account for diverse linguistic phenomena. Much of the work to date has focused on the not inconsiderable task o作者: Epithelium 時間: 2025-3-29 06:42
Work–Family Interface in Sub-Saharan Africaxicon is thereby increased in both amount and complexity: see, for example, lexical rules in LFG (Kaplan & Bresnan, 1983), GPSG (Gazdar, Klein, Pullum, & Sag, 1985), HPSG (Pollard & Sag, 1987), Combinatory Categorial Grammars (Steedman, 1987), Karttunen’s version of Categorial Grammar (Karttunen, 19作者: 不斷的變動 時間: 2025-3-29 07:58 作者: inflame 時間: 2025-3-29 15:12
Work–Family Interface in Sub-Saharan Africaammatical categories are viewed as functional types, be generalized in order to analyze “noncanonical” natural language constructions such as whextraction and nonconstituent conjunction. A consequence of these augmentations is an explosion of semantically equivalent derivations admitted by the gramm作者: BRACE 時間: 2025-3-29 17:54
Work–Family Interface in Sub-Saharan Africainguistic and AI models. Recent years have also seen rising interest in the computational analysis of machine-readable dictionaries as a lexical resource for parsing. These two trends are neither accidental nor independent of each other; an obvious place to look for large-scale linguistic informatio作者: 新娘 時間: 2025-3-29 22:09
Heming Wen,Prabhat Kumar Tiwary,Tho Le-Ngocxample, it is hard for most parsers to take advantage of the fact that . is typically . produced and sold but (probably) not .. So too, it is hard for a parser to know which verbs go with which prepositions (e.g. .) and which nouns fit together to form compound noun phrases (e.g. .). This chapter wi作者: Enteropathic 時間: 2025-3-30 02:37
Heming Wen,Prabhat Kumar Tiwary,Tho Le-Ngocinatory Logic, such as functional composition and type raising. The introduction of such operations is motivated by the need to provide an explanatory account of coordination and unbounded dependency. However, the associativity of functional composition tends to engender an equivalence class of poss作者: pus840 時間: 2025-3-30 07:20
Dieter Ei?el,Ewa Rokicka,Jeremy Leamanition and synthesis quite naturally turned attention of the researchers to the linguistic phenomena known for decades under the terms of theme-rheme, topic-comment, topic-focus. In this chapter we propose a linguistic procedure for parsing utterances in a “free word order” language, the resulting st作者: subacute 時間: 2025-3-30 09:41 作者: Eructation 時間: 2025-3-30 15:28
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 作者: 單挑 時間: 2025-3-30 19:09
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 時間: 2025-3-30 22:54
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 時間: 2025-3-31 04:39
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作者: 正常 時間: 2025-3-31 05:09 作者: Allowance 時間: 2025-3-31 09:14
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作者: 公理 時間: 2025-3-31 15:27 作者: 密碼 時間: 2025-3-31 18:29 作者: Obsequious 時間: 2025-4-1 01:18
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.作者: 空氣 時間: 2025-4-1 02:31
Current Issues in Parsing Technology978-1-4615-3986-5Series ISSN 0893-3405 作者: 細(xì)微差別 時間: 2025-4-1 06:41 作者: 爭吵加 時間: 2025-4-1 12:02
Work–Family Interface in Sub-Saharan Africainguistic and AI models. Recent years have also seen rising interest in the computational analysis of machine-readable dictionaries as a lexical resource for parsing. These two trends are neither accidental nor independent of each other; an obvious place to look for large-scale linguistic information is in existing dictionaries.作者: excursion 時間: 2025-4-1 15:11
