標(biāo)題: Titlebook: Advances in Natural Language Processing; 7th International Co Hrafn Loftsson,Eiríkur R?gnvaldsson,Sigrún Helgadó Conference proceedings 201 [打印本頁] 作者: 有判斷力 時間: 2025-3-21 18:05
書目名稱Advances in Natural Language Processing影響因子(影響力)
書目名稱Advances in Natural Language Processing影響因子(影響力)學(xué)科排名
書目名稱Advances in Natural Language Processing網(wǎng)絡(luò)公開度
書目名稱Advances in Natural Language Processing網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Advances in Natural Language Processing被引頻次
書目名稱Advances in Natural Language Processing被引頻次學(xué)科排名
書目名稱Advances in Natural Language Processing年度引用
書目名稱Advances in Natural Language Processing年度引用學(xué)科排名
書目名稱Advances in Natural Language Processing讀者反饋
書目名稱Advances in Natural Language Processing讀者反饋學(xué)科排名
作者: PRO 時間: 2025-3-21 21:39 作者: Ptosis 時間: 2025-3-22 01:55
Respiratory Diseases — The Clinical Spectrumuation methodology to compare these techniques and some of their combinations. This methodology is applied on two corpora of sentential paraphrases obtained by multiple translations. The conclusions that are drawn can be used to guide future work for improving existing techniques.作者: Servile 時間: 2025-3-22 06:30 作者: faucet 時間: 2025-3-22 12:03 作者: 托人看管 時間: 2025-3-22 15:44
Christoph Spengel,Andreas Oestreicher and computationally heavy issue, a half-forgotten history of statistical machine translation will be presented and contrasted with current state-of-the art (in a rather non-technical way)..Computational morphology has been on and off the focus of computational linguistics. Only few of us probably r作者: Buttress 時間: 2025-3-22 17:28
Christoph Spengel,Andreas Oestreicherand-constructed resources, WordNet and FrameNet, differ in their theoretical foundations and their approaches to the representation of word meaning. A core question that both resources address is, how can regularities in the lexicon be discovered and encoded in a way that allows both human annotator作者: 艦旗 時間: 2025-3-22 22:48 作者: 詞匯記憶方法 時間: 2025-3-23 04:22
Tinea Infections: From Head to Toe, the best possible parse. Other proposals make use of the topology of the parse trees and lexical features to reorder the parsing results. In this work, a new reranking approach is presented. There are two main novelties introduced in this paper: firstly, a new discriminative reranking method of par作者: perpetual 時間: 2025-3-23 08:55 作者: 首創(chuàng)精神 時間: 2025-3-23 11:23
Paul Freeling,Stanley Levensteinhe descriptive and discriminative information from the defined categories. Considering that training sets are extremely small in many classification tasks, in this paper we explore the use of unsupervised extractive summarization as a feature selection technique for document categorization. Our expe作者: 釋放 時間: 2025-3-23 15:11
Gillian Strube,K. Gill,Alistair Mouldsed like the basic aspectual opposition between event, state and process or that of time of utterance (for the treatment of deictic categories) that are used to analyse the semantics of grammatical tenses or more general situations. This linguistic model yields a conceptualisation reused for the defi作者: 散布 時間: 2025-3-23 18:31
Respiratory Diseases — The Clinical Spectrum reduction technique which is used for constructing semantic embeddings of multilingual sentence collections. In the proposed method, an independent embedding is constructed for each language in the multilingual collection and the similarities among the resulting semantic representations are used fo作者: CHANT 時間: 2025-3-24 00:34
Respiratory Diseases — The Clinical Spectrumuation methodology to compare these techniques and some of their combinations. This methodology is applied on two corpora of sentential paraphrases obtained by multiple translations. The conclusions that are drawn can be used to guide future work for improving existing techniques.作者: Asparagus 時間: 2025-3-24 06:18
https://doi.org/10.1007/978-94-009-4924-9sed learning technique. The proposed method consists of two phases. The first one is the learning phase and the second is the use phase. The learning phase is based on the Support Vector Machine (SVM) algorithm. In order to evaluate our method, we conducted a comparative study that involves the resu作者: nocturia 時間: 2025-3-24 09:05
https://doi.org/10.1007/978-94-009-4924-9s. Traditional IR engines are perfectly able to retrieve the majority of the relevant documents for most geographical queries, but they have severe difficulties generating a pertinent ranking of the retrieved results, which leads to poor performance. A key reason for this ranking problem has been a 作者: 設(shè)施 時間: 2025-3-24 13:41
Glandular Fever (Infectious Mononucleosis) also analyze the theoretical upper bound of a Corpus expanded by machine translation systems, and propose how it computes the confidence of a classification translator-based RTE system. At the end, we show an algorithm to expand the corpus size using Translator engines and we provide some results o作者: Scleroderma 時間: 2025-3-24 17:35
Who Gets Them, When, and What Happens?his paper we will try to draw a closer connection between empirical and formal semantics and suggest that a notion of frame closely related to that found in FrameNet can be usefully exploited in formal semantics based on a particular type theory with records (TTR). We will first show how frames of t作者: 音的強(qiáng)弱 時間: 2025-3-24 21:39
https://doi.org/10.1007/978-94-009-4924-9To carry out this analysis we clustered a large number of e-mails with the aim of automatic e-mail answering. One issue that came up was whether we should use the whole e-mail including the thread or just the original query for the clustering. In this paper we describe this investigation. Our result作者: AMPLE 時間: 2025-3-24 23:24
Respiratory Diseases — The Clinical Spectruma collection of chunk aligners, and two engines: one based on a simple proof-of-concept monotone EBMT recombinator and a Moses-based statistical decoder. . is a free/open-source release of the basic components of ., the Dublin City University machine translation system.作者: engrossed 時間: 2025-3-25 06:32 作者: 集聚成團(tuán) 時間: 2025-3-25 07:51
Respiratory Diseases — The Clinical Spectrumlarly if one has access to an entire corpus of texts pertaining to the given subject. One of these details is the identification of the era in which the author of the given document(s) lived. For rabbinic documents written in Hebrew and Aramaic, which are almost without exception undated and do not 作者: 令人不快 時間: 2025-3-25 14:56 作者: 攝取 時間: 2025-3-25 19:08 作者: Gnrh670 時間: 2025-3-25 20:42 作者: Affectation 時間: 2025-3-26 02:12
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/149095.jpg作者: 艱苦地移動 時間: 2025-3-26 05:50 作者: Vsd168 時間: 2025-3-26 09:18 作者: 分發(fā) 時間: 2025-3-26 14:25
Reliving the History: The Beginnings of Statistical Machine Translation and Languages with Rich Morpions. We prove that every graph with vertex-degree at most 6 (at most 3) admits a RAC drawing with curve complexity 2 (resp. 1) and with quadratic area. Third, we consider a natural non-planar generalization of planar embedded graphs. Here we give bounds for curve complexity and area different from 作者: 猛然一拉 時間: 2025-3-26 16:58
Automatic Distractor Generation for Domain Specific Textsive . direction. A directed acyclic graph . has . if . is the minimum integer such that the vertices of . can be ordered by . linear orderings, <.,..., <., and for vertices . and . there is a directed path from . to . if and only if .<.. for all 1 ≤. ≤.. In this note we show that the dimension of th作者: 感激小女 時間: 2025-3-26 23:14
A Formal Ontology for a Computational Approach of Time and Aspect the set of all crossing-free straight-edge graphs that can be embedded over a specific point set..We then show how to apply the cross-graph charging-scheme method for graphs that allow certain types of crossings. Specifically, we consider graphs with no set of . pairwise-crossing edges (more common作者: 缺陷 時間: 2025-3-27 04:39 作者: Anthrp 時間: 2025-3-27 08:12
Digital Learning for Summarizing Arabic Documents them..The drawback of the characterization of SLTRs is that we are not able to effectively check whether a given graph admits a flat angle assignment that fulfills the conditions. Hence it is still open to decide whether the recognition of graphs that admit straight line triangle representation is 作者: 確定 時間: 2025-3-27 11:08 作者: Euphonious 時間: 2025-3-27 13:47
Frames in Formal Semantics a plane 3-tree . with . vertices, a set . of . points in ?. that are not necessarily in general position and a mapping of the three outer vertices of . to three different points of ., it is NP-complete to decide if . admits a point-set embedding on . respecting the given mapping.作者: 來自于 時間: 2025-3-27 21:13 作者: Misgiving 時間: 2025-3-27 23:03
: A Free/Open-Source Marker-Driven Example-Based Machine Translation Systemion on empirical and generated networks indicates that our approach improves upon previous methods using other edge indices. Although primarily designed to achieve more informative drawings, our spanning subgraph may also serve as a sparsifier that trims a hairball graph before the application of a 作者: 使聲音降低 時間: 2025-3-28 06:07 作者: MAUVE 時間: 2025-3-28 08:29
Estimating the Birth and Death Years of Authors of Undated Documents Using Undated Citationsby straight-lines, whereas so-called transitive edges are rendered using Bézier curves. The layout problem then consists of placing control points for these curves. We transform it into a graph layout problem and exploit the generality of random field layout models for its solution.作者: 遣返回國 時間: 2025-3-28 10:52 作者: 松軟 時間: 2025-3-28 18:06
Enriching the Adjective Domain in the Japanese WordNetthat investigate the effect of requiring planarity and acyclicity on the resulting support length. Further, we evaluate the performance and trade-offs between solution quality and speed of several heuristics relative to each other and compared to optimal solutions.作者: 骯臟 時間: 2025-3-28 21:49
A Morphosyntactic Brill Tagger for Inflectional LanguagesOverview: 作者: 梯田 時間: 2025-3-28 23:31 作者: 特別容易碎 時間: 2025-3-29 06:08 作者: CHIDE 時間: 2025-3-29 10:57
Comparison of Paraphrase Acquisition Techniques on Sentential ParaphrasesOverview: 作者: 掙扎 時間: 2025-3-29 12:54
Using Machine Translation Systems to Expand a Corpus in Textual EntailmentOverview: 作者: 我們的面粉 時間: 2025-3-29 19:02 作者: 繁忙 時間: 2025-3-29 20:23 作者: 強(qiáng)制令 時間: 2025-3-30 00:35
https://doi.org/10.1007/978-94-009-4924-9 textual structure) as re-ranking mechanisms for GIR. Our results reveal an improvement in mean average precision (MAP) when compared to the traditional vector space model, even if Pseudo Relevance Feedback is employed.作者: tolerance 時間: 2025-3-30 04:39
Respiratory Diseases — The Clinical Spectrum author. In the framework of this research, we formulate various kinds of "iron-clad", heuristic and greedy constraints defining the birth and death years of an author based on citations referring to him or mentioned by him. Experiments applied on a corpus containing texts composed by rabbinic autho作者: Cpap155 時間: 2025-3-30 10:46 作者: cauda-equina 時間: 2025-3-30 13:09
Paul Freeling,Stanley Levensteinriments using training sets of different sizes indicate that text summarization is a competitive approach for feature selection, and show its appropriateness for situations having small training sets, where it could clearly outperform the traditional information gain technique.作者: Foreshadow 時間: 2025-3-30 20:19 作者: Gossamer 時間: 2025-3-31 00:17 作者: Cholesterol 時間: 2025-3-31 01:04 作者: 減弱不好 時間: 2025-3-31 07:23 作者: pester 時間: 2025-3-31 12:19
Who Gets Them, When, and What Happens?he adjective domain lacks semantic relations such as antonyms, attributes and so on. As part of our ongoing work to enrich the Japanese WordNet, we are investigating attribute nouns for which adjectives express values.作者: Mercantile 時間: 2025-3-31 13:21
Tinea Infections: From Head to Toe,ialogues, obtained from real interactions of real users with an online ECA. Results show that this approach provides a significant improvement over the parsing results of out-of-domain sentences; that is, sentences for which there is no optimal parse among the candidates given by the baseline parse.作者: 取消 時間: 2025-3-31 17:54 作者: Charlatan 時間: 2025-3-31 23:35
