標(biāo)題: Titlebook: Advances in Probabilistic and Other Parsing Technologies; Harry Bunt,Anton Nijholt Book 2000 Springer Science+Business Media Dordrecht 200 [打印本頁] 作者: HABIT 時(shí)間: 2025-3-21 17:37
書目名稱Advances in Probabilistic and Other Parsing Technologies影響因子(影響力)
書目名稱Advances in Probabilistic and Other Parsing Technologies影響因子(影響力)學(xué)科排名
書目名稱Advances in Probabilistic and Other Parsing Technologies網(wǎng)絡(luò)公開度
書目名稱Advances in Probabilistic and Other Parsing Technologies網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Advances in Probabilistic and Other Parsing Technologies被引頻次
書目名稱Advances in Probabilistic and Other Parsing Technologies被引頻次學(xué)科排名
書目名稱Advances in Probabilistic and Other Parsing Technologies年度引用
書目名稱Advances in Probabilistic and Other Parsing Technologies年度引用學(xué)科排名
書目名稱Advances in Probabilistic and Other Parsing Technologies讀者反饋
書目名稱Advances in Probabilistic and Other Parsing Technologies讀者反饋學(xué)科排名
作者: Femish 時(shí)間: 2025-3-21 23:07 作者: 頂點(diǎn) 時(shí)間: 2025-3-22 03:46
Towards a Reduced Commitment, D-Theory Style Tag Parser,ew of the physical processes that are currently thought to be of importance for the evolution of a protoplanetary disk. Finally, we discuss some new ideas of how chemical reactions might influence the global evolution of such disks..There are many very good reviews available that summarizes our pres作者: Notorious 時(shí)間: 2025-3-22 07:06 作者: 輕彈 時(shí)間: 2025-3-22 09:31 作者: 臨時(shí)抱佛腳 時(shí)間: 2025-3-22 13:37 作者: Gleason-score 時(shí)間: 2025-3-22 17:28
Probabilistic Parse Selection Based on Semantic Co-Occurrences,Overview: 作者: 含糊其辭 時(shí)間: 2025-3-22 23:27 作者: 不可接觸 時(shí)間: 2025-3-23 03:32
Performance Evaluation of Supertagging for Partial Parsing,Overview: 作者: 異常 時(shí)間: 2025-3-23 08:38 作者: 偽善 時(shí)間: 2025-3-23 12:05 作者: 英寸 時(shí)間: 2025-3-23 16:39 作者: Physiatrist 時(shí)間: 2025-3-23 20:23
Probabilistic GLR Parsing,rse early recording techniques leave much to be desired in quality of reproduction. Then recordings of the early days, like the photographs of the time, were highly stylized, so that the spoken word appeared only in the declamatory style of poetry or oratory.作者: 新鮮 時(shí)間: 2025-3-24 00:59
Towards a Reduced Commitment, D-Theory Style Tag Parser,s that most of the material that could be presented in section 4 is easily available in most libraries so that it might be more valuable to dwell on those things that are usually not discussed at great lenght (if at all) in this context and that bear great potentials.作者: 啞劇 時(shí)間: 2025-3-24 05:27
1386-291X echniquesfor underspecification and the integration of semantic information inthe syntactic analysis to deal with massive ambiguity. .The book gives a state-of-978-90-481-5579-8978-94-015-9470-7Series ISSN 1386-291X Series E-ISSN 2542-9388 作者: FLING 時(shí)間: 2025-3-24 07:46
Book 2000and efficientprobabilistic parsing algorithms, approximation techniques applied togrammars and parsers to increase parsing efficiency, and techniquesfor underspecification and the integration of semantic information inthe syntactic analysis to deal with massive ambiguity. .The book gives a state-of-作者: ambivalence 時(shí)間: 2025-3-24 12:39 作者: agglomerate 時(shí)間: 2025-3-24 18:44
Matteo Testa,Diego Valsesia,Enrico Maglifew significant refinements, while maintaining all the advantages of Briscoe and Carroll’s modeling. We discuss the formal and qualitative aspects of our model, illustrating the qualitative differences between Briscoe and Carroll’s model and our model, and their expected impact on parsing performance.作者: 污穢 時(shí)間: 2025-3-24 23:04
https://doi.org/10.1007/978-3-031-09745-4 We present a hybrid semi-deterministic parser that is controlled by the association values between phrases. Whenever the expectation of the parser fails, it chooses an alternative using a chart to avoid backtracking.作者: braggadocio 時(shí)間: 2025-3-25 02:46
https://doi.org/10.1007/978-1-4612-1116-7Experimental results are presented which indicate that the time complexity of this parser is close to cubic in the length of the input for a large English grammar. Finally, a compilation technique is presented which automatically compiles a set of finitely valued features into the context-free backbone grammar.作者: 半圓鑿 時(shí)間: 2025-3-25 07:08 作者: Corroborate 時(shí)間: 2025-3-25 09:45
https://doi.org/10.1007/978-3-319-00366-5g sets of trees into their underspecified equivalents as well as underspecifying combinations of trees..Herein we examine various issues that arise in this new approach to TAG parsing and present solutions to some of the problems. We also describe other issues which need to be resolved for this method of parsing to be implemented.作者: 一美元 時(shí)間: 2025-3-25 15:35
Giulio Coluccia,Chiara Ravazzi,Enrico Magliomputing inside, outside, and Viterbi parses. PFGs can produce probabilities of strings, making them potentially useful for language modeling. Precision and recall results are comparable to the state of the art with words, and the best reported without words.作者: ensemble 時(shí)間: 2025-3-25 16:09 作者: epidermis 時(shí)間: 2025-3-25 23:45
James Palmer,Kenneth Ramsden,Eric Goodgerr sparse data than the more common Maximum Likelihood Estimation would. It has been tested on the . corpus (in the Perm Treebank) and shown to find the correct parse of 60.9% of parseable sentences of 6–20 words.作者: 嚴(yán)重傷害 時(shí)間: 2025-3-26 01:33
https://doi.org/10.1007/978-1-349-09724-1parsing, which include, besides the one for basic dependency parsing, protocols for ambiguity handling, robustness, backtracking, preferential and predictive parsing, as well as textual reference resolution. Based on an empirical evaluation, we also provide reasons for sacrificing completeness of the parse in favor of efficiency gains.作者: AMPLE 時(shí)間: 2025-3-26 04:29
Compressible Fluid Dynamics and Shock Waves smoothing techniques. Second, we show how supertagging can be used for partial parsing and provide detailed evaluation results for detecting noun chunks, verb chunks, preposition phrase attachment and a variety of other linguistic constructions.作者: cumber 時(shí)間: 2025-3-26 12:11
1386-291X ccurate formal descriptions of natural languages.Robustness and efficiency are among the main issuesin parsing. Corpora can be used to obtain frequency information about languageuse. This allows probabilistic parsing, an approach that aims at bothrobustness and efficiency increase. Approximation tec作者: 終點(diǎn) 時(shí)間: 2025-3-26 13:58 作者: 上下連貫 時(shí)間: 2025-3-26 19:43 作者: 不可磨滅 時(shí)間: 2025-3-27 00:17 作者: 刺耳的聲音 時(shí)間: 2025-3-27 03:23
https://doi.org/10.1007/978-94-015-9470-7Index; Parsing; algorithms; computational linguistics; grammar; linguistics; syntactic作者: 馬賽克 時(shí)間: 2025-3-27 07:25 作者: Entropion 時(shí)間: 2025-3-27 11:57 作者: 洞穴 時(shí)間: 2025-3-27 13:38
Applied and Numerical Harmonic Analysisd to first, in their early days, in relation to the compilation and interpretation of computer programs. Since computer programs have in common with written text that they consist of symbol strings that can be decomposed into meaningful substrings, the idea soon came up to apply the techniques of pr作者: 酷熱 時(shí)間: 2025-3-27 21:08
Compressed Sensing and its Applicationsesentative framework. We consider systematically a number of alternative probabilistic frameworks, evaluating their adequacy from both a theoretical and empirical perspective using data from existing large treebanks. We also propose three orthogonal approaches for backing off probability estimates t作者: 1FAWN 時(shí)間: 2025-3-28 00:29
Ben Adcock,Anders C. Hansen,Bogdan Romanncratic selectional influences on each other. Such ‘bilexicalism’ has been a theme of much current work in parsing. The new formalism can be used to describe bilexical approaches to both dependency and phrase-structure grammars, and a slight modification yields link grammars. Its scoring approach is作者: Hdl348 時(shí)間: 2025-3-28 04:15
Giulio Coluccia,Chiara Ravazzi,Enrico Magliharniak, and in experiments have comparable or better performance. PFGs generate features one at a time, probabilistically, conditioning the probabilities of each feature on other features in a local context. Because the conditioning is local, efficient polynomial time parsing algorithms exist for c作者: archetype 時(shí)間: 2025-3-28 10:05 作者: 多嘴 時(shí)間: 2025-3-28 12:02 作者: 歸功于 時(shí)間: 2025-3-28 17:07
https://doi.org/10.1007/978-3-031-09745-4ties occur in the dependency relations between words. While figuring out the correct dependency, lexical associations play an important role. Our parser uses statistical co-occurrence data to compute lexical associations. We show that sentences can be parsed deterministically by means of global mana作者: 紅腫 時(shí)間: 2025-3-28 20:39
https://doi.org/10.1007/978-3-319-00366-5cope with ambiguity by using underspecified descriptions of trees. This chapter introduces a novel approach to parsing TAG, namely one that explores how D-theoretic notions may be applied to TAG parsing..Combining the D-theoretic approach to TAG parsing as we do here raises new issues and problems. 作者: 一個(gè)攪動(dòng)不安 時(shí)間: 2025-3-29 02:58
James Palmer,Kenneth Ramsden,Eric Goodgeres in semantic forms. The method is called ‘Semco’ (for semantic co-occurrence analysis) and is specifically targeted at the differential distribution of such co-occurrences in correct and incorrect parses. It uses Bayesian Estimation for the co-occurrence probabilities to achieve higher accuracy fo作者: Ornament 時(shí)間: 2025-3-29 05:02
https://doi.org/10.1007/978-1-349-09724-1ciated parsers in which declarative knowledge about language structure and procedural knowledge about language use are equally balanced within a strictly object-oriented specification and implementation framework. In particular, we introduce fundamental message-passing protocols for object-oriented 作者: LINE 時(shí)間: 2025-3-29 09:18 作者: Visual-Acuity 時(shí)間: 2025-3-29 12:46 作者: Limerick 時(shí)間: 2025-3-29 17:18 作者: 合群 時(shí)間: 2025-3-29 22:02
9樓作者: Adrenaline 時(shí)間: 2025-3-30 01:53
10樓作者: 延期 時(shí)間: 2025-3-30 04:35
10樓作者: Mindfulness 時(shí)間: 2025-3-30 09:33
10樓作者: 圣歌 時(shí)間: 2025-3-30 13:23
10樓
