標(biāo)題: Titlebook: Advances in Natural Language Processing; 9th International Co Adam Przepiórkowski,Maciej Ogrodniczuk Conference proceedings 2014 Springer I [打印本頁(yè)] 作者: autoantibodies 時(shí)間: 2025-3-21 16:10
書(shū)目名稱Advances in Natural Language Processing影響因子(影響力)
書(shū)目名稱Advances in Natural Language Processing影響因子(影響力)學(xué)科排名
書(shū)目名稱Advances in Natural Language Processing網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Advances in Natural Language Processing網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Advances in Natural Language Processing被引頻次
書(shū)目名稱Advances in Natural Language Processing被引頻次學(xué)科排名
書(shū)目名稱Advances in Natural Language Processing年度引用
書(shū)目名稱Advances in Natural Language Processing年度引用學(xué)科排名
書(shū)目名稱Advances in Natural Language Processing讀者反饋
書(shū)目名稱Advances in Natural Language Processing讀者反饋學(xué)科排名
作者: 竊喜 時(shí)間: 2025-3-21 23:55
Development of Amharic Morphological Analyzer Using Memory-Based Learningalyzed already crucial properties of model transformations like termination, correctness and completeness, but functional behaviour is missing up to now..In order to close this gap we generate forward translation rules, which extend standard forward rules by translation attributes keeping track of t作者: 驚呼 時(shí)間: 2025-3-22 00:52
A Finite-State Treatment of Neoclassical Compounds in Modern Greek and Englishimulation run of the source system we find a corresponding simulation run in the target system. Analogously, we have ., if for each simulation run of the target system we find a corresponding simulation run in the source system..In our framework of graph transformation, models are given by graphs, a作者: Seminar 時(shí)間: 2025-3-22 05:12
CroDeriV 2.0.: Initial Experimentsions between molecular species in the cell. They are represented in a natural way as graphs, with molecules as nodes and processes as arcs. In particular, metabolic pathways are represented as directed graphs, with the substrates, products, and enzymes as nodes and the chemical reactions catalyzed b作者: Unsaturated-Fat 時(shí)間: 2025-3-22 10:34
Named Entity Matching Method Based on the Context-Free Morphological Generatorrphisms .(.): .(..) →.(..) to nodes .., .. and edges .: .. →.. in ...Although there are several interesting applications of distributed graphs and transformations, even the basic pushout constructions for the double pushout approach of distributed graph transformation could be shown up to now only i作者: Subdue 時(shí)間: 2025-3-22 16:34
NER in Tweets Using Bagging and a Small Crowdsourced Datasetvels have been added to the conventional design flow resulting in . (ESL) design. Besides abstraction, the focus in ESL during the development of a system moves from design to verification, i.e.?checking whether or not the system works as intended becomes more and more important. However, at each ab作者: encomiast 時(shí)間: 2025-3-22 18:53 作者: 吸引力 時(shí)間: 2025-3-22 22:10 作者: 威脅你 時(shí)間: 2025-3-23 02:00 作者: 沖擊力 時(shí)間: 2025-3-23 08:49
Cross-Lingual Semantic Similarity Measure for Comparable Articlese particular case of urban mobility, the current trend is toward the applications of hybrid propulsion, if not purely electric. The growing dimensions of urban areas suggest that a particular attention needs to be addressed to vehicles’ energy requirements, air quality and noise pollution. Hybrid te作者: 緯線 時(shí)間: 2025-3-23 10:34 作者: Left-Atrium 時(shí)間: 2025-3-23 15:29
Distributional Context Generalisation and Normalisation as a Mean to Reduce Data Sparsity: Evaluatiot encodes a first-order quantifier-free formula, and then checks for unsatisfiability of this formula using a linear-time algorithm [14]. The low polynomial complexity is important, since all computational logic methods can be understood as instances of Herbrand’s reduction of the provability (and t作者: defeatist 時(shí)間: 2025-3-23 18:55 作者: Extemporize 時(shí)間: 2025-3-23 23:26 作者: abnegate 時(shí)間: 2025-3-24 03:36
Stanford Typed Dependencies: Slavic Languages Applicationmender system is a powerful information filtering tool to support user interaction and promote products. Dealing with determining customer interests, graph-based collaborative filtering is recently the most popular technique. Its only drawback is high computing cost, leads to bad scalability and inf作者: lymphedema 時(shí)間: 2025-3-24 07:36
Towards a?Weighted Induction Method of Dependency AnnotationFormal Concept Analysis. Such representations, however, are difficult to comprehend by untrained users and in general in cases where lattices are large. We tackle this problem by automatically generating textual explanations for lattices using standard scales. Our method is based on the general noti作者: 形容詞詞尾 時(shí)間: 2025-3-24 11:31
Semantic and Syntactic Model of Natural Language Based on Non-negative Matrix and Tensor Factorizatiwas used in order to develop many applications in different domains. Although the framework was used in several application domain and well received by end-users, they highlighted an urgent need for traceability within the information fusion process. We propose here an improvement of the toolbox, in作者: Mumble 時(shí)間: 2025-3-24 18:28
Experiments on the Identification of Predicate-Argument Structure in Polishues either visualise a single gene profile or a single tissue profile, whereas the technique presented here combines both - visualising the genes expressed in each tissue in a group of tissues (the components of the developing heart, for example). The technique is presented using data, provided by t作者: 不朽中國(guó) 時(shí)間: 2025-3-24 22:47 作者: Itinerant 時(shí)間: 2025-3-25 02:24
Development of Amharic Morphological Analyzer Using Memory-Based Learningng to the source language is not relevant for the functional behaviour of a model transformation. For this reason we only have to analyze a weaker property, called translation confluence. This leads to our second main result, the functional behaviour of model transformations, which is applied to our作者: Cloudburst 時(shí)間: 2025-3-25 04:52 作者: 安撫 時(shí)間: 2025-3-25 11:12
CroDeriV 2.0.: Initial Experimentsction of transforming a substrate chemical graph to a product chemical graph using a set of explicit chemical reactions, is stated as the problem of finding an appropriate set of sequences of chemical graph transformations from the substrate to the product, and the design of a graph transformation s作者: conifer 時(shí)間: 2025-3-25 14:14 作者: 小溪 時(shí)間: 2025-3-25 19:49
NER in Tweets Using Bagging and a Small Crowdsourced Datasetss measures, CDD ensures that the next step in the design process can only be entered if completeness at the current abstraction level has been achieved. This leads to an early detection of bugs and accelerates the whole design process. The application of CDD is illustrated by means of an example.作者: geriatrician 時(shí)間: 2025-3-25 23:58
Yet Another Ranking Function for Automatic Multiword Term Extractionperations that act upon the artifacts. These tasks are performed as activities in the method’s process workflow model. Tools can then be built that use the artifact model as the foundation of their repository structure and the task and workflow models as the basis for the supported functionality.作者: adumbrate 時(shí)間: 2025-3-26 00:13 作者: STALE 時(shí)間: 2025-3-26 08:14
Term Ranking Adaptation to the Domain: Genetic Algorithm-Based Optimisation of the ,allel independence of amalgamated rules based on the induced multi rules. If we extend an interaction scheme as large as possible we can describe the transformation for an unknown number of matches, which otherwise would have to be defined by an infinite number of rules. This leads to maximal matchi作者: restrain 時(shí)間: 2025-3-26 08:37 作者: 橫截,橫斷 時(shí)間: 2025-3-26 16:09 作者: BULLY 時(shí)間: 2025-3-26 20:32
Distributional Context Generalisation and Normalisation as a Mean to Reduce Data Sparsity: Evaluatio shown to be unsatisfiable, or if it can no longer be expanded, in which case the query formula is shown to be refutable. The process may also enter into a non-terminating sequence of expansion steps. The algorithm that checks for unsatisfiability is not a resolution method, and has the property tha作者: Radiation 時(shí)間: 2025-3-26 23:20 作者: triptans 時(shí)間: 2025-3-27 04:23 作者: Cytokines 時(shí)間: 2025-3-27 08:27 作者: 門(mén)窗的側(cè)柱 時(shí)間: 2025-3-27 10:13
Towards a?Weighted Induction Method of Dependency Annotation. We demonstrate our approach on the spices planner data set, which is a medium sized formal context comprised of fifty-six meals (objects) and thirty-seven spices (attributes). The resulting 531 formal concepts can be covered by means of about 100 standard scales.作者: 沉思的魚(yú) 時(shí)間: 2025-3-27 17:01 作者: concise 時(shí)間: 2025-3-27 21:15 作者: Palatial 時(shí)間: 2025-3-27 22:36
Graph-Based, Supervised Machine Learning Approach to (Irregular) Polysemy in WordNetOverview: 作者: vitreous-humor 時(shí)間: 2025-3-28 02:11 作者: 領(lǐng)導(dǎo)權(quán) 時(shí)間: 2025-3-28 06:47
https://doi.org/10.1007/978-1-4471-3625-5eer entries, we propose a method which uses a context-free morphological generator, built on the top of the morphological lexicon and encoded as a set of inflection rules. The proposed solution outperforms several state-of-the-art methods that are based on word-to-word similarity functions.作者: 行為 時(shí)間: 2025-3-28 12:16
The New Synthese Historical Library relation. The main contribution of the study is to integrate both semantic and dependency relation within distributional aspect. Second contribution is considered as being first major attempt for Turkish synonym identification based on corpus-driven approach.作者: Peak-Bone-Mass 時(shí)間: 2025-3-28 17:24 作者: definition 時(shí)間: 2025-3-28 22:24 作者: 一大塊 時(shí)間: 2025-3-28 23:43 作者: Parley 時(shí)間: 2025-3-29 06:12
Common Eye Diseases and their Managementoach is based on a theoretical background that applies to both languages and assumes that Modern Greek compounding has affected the formation of NCs in English. The processing system is proposed to be both linguistically accurate and computationally efficient.作者: mucous-membrane 時(shí)間: 2025-3-29 08:40 作者: 擔(dān)心 時(shí)間: 2025-3-29 14:59 作者: NATAL 時(shí)間: 2025-3-29 17:01
Common Eye Diseases and their Managementm reasonable (..: 60–70%) to completely useless (..: 40–50%) across available Twitter datasets. This paper introduces a semi-supervised wrapper method for robust learning of sequential problems with many negative examples, such as NER, and shows that using a simple conditional random fields (CRF) mo作者: grenade 時(shí)間: 2025-3-29 22:22 作者: 代理人 時(shí)間: 2025-3-30 01:02 作者: 楓樹(shù) 時(shí)間: 2025-3-30 06:31 作者: Aviary 時(shí)間: 2025-3-30 10:00 作者: 其他 時(shí)間: 2025-3-30 15:57 作者: hypotension 時(shí)間: 2025-3-30 18:30
https://doi.org/10.1007/978-3-319-32404-3tionaries or based on numerical methods such as Latent Semantic Indexing (LSI). In this paper, we use LSI in two ways to retrieve Arabic-English comparable articles. The first way is monolingual: the English article is translated into Arabic and then mapped into the Arabic LSI space; the second way 作者: installment 時(shí)間: 2025-3-30 22:37 作者: EXUDE 時(shí)間: 2025-3-31 02:18
Is Socrates Permitted to Kill Plato?proach suffer from data sparsity and from a high dimensional context matrix. If reducing data sparsity is an important aspect with general corpora, it is also a major issue with specialised corpora that are of much smaller size and with much lower context frequencies. We tackle this problem on speci作者: 詩(shī)集 時(shí)間: 2025-3-31 05:36 作者: 牽連 時(shí)間: 2025-3-31 09:37 作者: Endemic 時(shí)間: 2025-3-31 16:47
The New Synthese Historical Librarynglish data and did not provide descriptions for grammatical features that are fundamental in other language types. This paper addresses the problem of applying the Stanford typed dependency model for Slavic languages. Language features specific to Slavic languages that are presented and described i作者: dominant 時(shí)間: 2025-3-31 20:44
https://doi.org/10.1007/978-3-031-02184-8he?approach builds on the?idea of weighted projection. However, we involve a?weighting factor not only in the?process of projecting dependency relations (weighted projection) but also in the?process of acquiring dependency trees from projected sets of dependency relations (weighted induction). Using作者: NEG 時(shí)間: 2025-4-1 00:01 作者: 舊石器 時(shí)間: 2025-4-1 03:53
https://doi.org/10.1007/978-3-031-02184-8A method for developing a structural model of natural language syntax and semantics is proposed. Factorization of lexical combinability arrays obtained from text corpora generates linguistic databases that are used for analysis of natural language semantics and syntax.作者: 佛刊 時(shí)間: 2025-4-1 07:50
Advances in Natural Language Processing978-3-319-10888-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 能夠支付 時(shí)間: 2025-4-1 13:41 作者: 瑪瑙 時(shí)間: 2025-4-1 17:26
Is Socrates Permitted to Kill Plato? usage and data transmitting necessity of factorization algorithm was analysed and optimized. The described effective GPU-based and distributed algorithms were implemented, tested and compared by means of large sparse matrices processing.
