Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
A word at a time: computing word relatedness using temporal semantic analysis
Computing the degree of semantic relatedness of words is a key functionality of many
language applications such as search, clustering, and disambiguation. Previous …
language applications such as search, clustering, and disambiguation. Previous …
Memory-efficient assembly using Flye
In the past decade, next-generation sequencing (NGS) enabled the generation of genomic
data in a cost-effective, high-throughput manner. The most recent third-generation …
data in a cost-effective, high-throughput manner. The most recent third-generation …
Temporal information retrieval
The study of temporal dynamics and its impact can be framed within the so-called temporal
IR approaches, which explain how user behavior, document content and scale vary with …
IR approaches, which explain how user behavior, document content and scale vary with …
Universal indexes for highly repetitive document collections
Indexing highly repetitive collections has become a relevant problem with the emergence of
large repositories of versioned documents, among other applications. These collections may …
large repositories of versioned documents, among other applications. These collections may …
Using the past to score the present: Extending term weighting models through revision history analysis
The generative process underlies many information retrieval models, notably statistical
language models. Yet these models only examine one (current) version of the document …
language models. Yet these models only examine one (current) version of the document …
[PDF][PDF] Durable top-k search in document archives
We propose and study a new ranking problem in versioned databases. Consider a database
of versioned objects which have different valid instances along a history (eg, documents in a …
of versioned objects which have different valid instances along a history (eg, documents in a …
Index maintenance for time-travel text search
Time-travel text search enriches standard text search by temporal predicates, so that users
of web archives can easily retrieve document versions that are considered relevant to a …
of web archives can easily retrieve document versions that are considered relevant to a …
Document retrieval on repetitive string collections
Most of the fastest-growing string collections today are repetitive, that is, most of the
constituent documents are similar to many others. As these collections keep growing, a key …
constituent documents are similar to many others. As these collections keep growing, a key …
Temporal index sharding for space-time efficiency in archive search
Time-travel queries that couple temporal constraints with keyword queries are useful in
searching large-scale archives of time-evolving content such as the web archives or wikis …
searching large-scale archives of time-evolving content such as the web archives or wikis …
Improved index compression techniques for versioned document collections
J He, J Zeng, T Suel - Proceedings of the 19th ACM international …, 2010 - dl.acm.org
Current Information Retrieval systems use inverted index structures for efficient query
processing. Due to the extremely large size of many data sets, these index structures are …
processing. Due to the extremely large size of many data sets, these index structures are …