نتایج جستجو برای: retrieval speed of collocations

تعداد نتایج: 21183877  

Journal: :Atmospheric Environment 2021

Based on ground-based aerosol optical property observations from the Central China Comprehensive Experimental Site and Aerosol Robotic Network, Moderate Resolution Imaging Spectroradiometer (MODIS) Visible Infrared Radiometer Suite (VIIRS) depth (AOD) products between January 2016 February 2020 over East were evaluated compared both regional site scales. In addition, relationship retrieval erro...

2012
Anna Bordilovskaya

The Japanese lexicon consists of Japanese-origin words (WAGO), Chinese-origin words (KANGO) and words borrowed from English and other European languages (GAIRAIGO). The acquisition of words from three sources results in the abundance of near synonyms without any clear rules when a particular synonym should be used. Loveday has hypothesized that WAGO/KANGO and GAIRAIGO concrete nouns are used to...

2015
Alexander Gelbukh Olga Kolesnikova

The meaning of such verb-noun collocations as the wind blows, time flies, the day passes by can be generalized as ‘what is designated by the noun exists’. Likewise, the meaning of make a decision, provide support, write a letter can be generalized as ‘make what is designated by the noun’. These generalizations represent the meaning of certain groups of collocations and may be used as semantic a...

Journal: :Informatics 2014
Violeta Seretan

We address the problem of automatically processing collocations—a subclass of multi-word expressions characterized by a high degree of morphosyntactic flexibility—in the context of two major applications, namely, syntactic parsing and machine translation. We show that parsing and collocation identification are processes that are interrelated and that benefit from each other, inasmuch as syntact...

2009
Ying Wang

Research hitherto has tended to show that, like vocabulary errors, wrong collocations are often due to transfer from L1, and hence that greater typological difference from the target language leads to more serious collocational errors. We tested this hypothesis by comparing the collocational errors of Swedish and Chinese students. 100 university students from each environment wrote a short essa...

2006
Kiduk Yang Ning Yu Alejandro Valerio Hui Zhang

Web Information Discovery Integrated Tool (WIDIT) Laboratory at the Indiana University School of Library and Information Science participated in the Blog track’s opinion task in TREC2006. The goal of opinion task is to "uncover the public sentiment towards a given entity/target", which involves not only retrieving topically relevant blogs but also identifying those that contain opinions about t...

2005
Norman H. Adams Daniela Marquez Gregory H. Wakefield

For melodic theme retrieval there is a fundamental tradeoff between retrieval performance and retrieval speed. Melodic representations of large dimension yield the best retrieval performance, but at high computational cost, and vice versa. In the present work we explore the use of iterative deepening to achieve robust retrieval performance, but without the accompanying computational burden. In ...

2004
David Wible Chin-Hwa Kuo Nai-Lung Tsao

The purpose of this paper is to introduce an alternative word association measure aimed at addressing the under-extraction collocations that contain high frequency words. While measures such as MI provide the important contribution of filtering out sheer high frequency of words in the detection of collocations in large corpora, one side effect of this filtering is that it becomes correspondingl...

2008
Igor A. Bolshakov Elena I. Bolshakova Alexey P. Kotlyarov Alexander F. Gelbukh

For extracting collocations from the Internet, it is necessary to numerically estimate the cohesion between potential collocates. Mutual Information cohesion measure (MI) based on numbers of collocate occurring closely together (N12) and apart (N1, N2) is well known, but the Web page statistics deprives MI of its statistical validity. We propose a family of different measures that depend on N1,...

2005
Jim Austin

In this paper we evaluate a selection of data retrieval algorithms for storage e ciency retrieval speed and partial matching capabilities using a large information retrieval dataset We evaluate standard data structures for example inverted le lists and hash tables but also a novel binary neu ral network that incorporates single epoch training superimposed coding and associative matching in a bi...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید