✦ LIBER ✦

In-memory hash tables for accumulating text vocabularies

✍ Scribed by Justin Zobel; Steffen Heinz; Hugh E. Williams

Book ID: 104136650
Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 59 KB
Volume: 80
Category: Article
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(01)00239-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A distributed full-text top-k document d

A distributed full-text top-k document dissemination system in distributed hash tables

✍ Weixiong Rao; Lei Chen 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 859 KB

Tables for comparing the richness and st

Tables for comparing the richness and structure of vocabulary in texts of different lengths

✍ Ratkowsky, D. A. ;Hantrais, Linda 📂 Article 📅 1975 🏛 Springer 🌐 English ⚖ 439 KB

Incidental memory for location of inform

Incidental memory for location of information in text

✍ Ernst Z. Rothkopf 📂 Article 📅 1971 🏛 Elsevier Science ⚖ 376 KB

Pronouncing new words aloud during the s

Pronouncing new words aloud during the silent reading of text enhances fifth graders’ memory for vocabulary words and their spellings

✍ Julie Rosenthal; Linnea C. Ehri 📂 Article 📅 2010 🏛 Springer Netherlands 🌐 English ⚖ 391 KB

Hemispheric differences in the organizat

Hemispheric differences in the organization of memory for text ideas

✍ Debra L. Long; Clinton L. Johns; Eunike Jonathan 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 377 KB

An n-gram hash and skip algorithm for fi

An n-gram hash and skip algorithm for finding large numbers of keywords in continuous text streams

✍ Jonathan D. Cohen 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 407 KB 👁 1 views

A method of full-text scanning for matches in a large dictionary of keywords is described, suitable for Selective Dissemination of Information (SDI). The method is applicable to large dictionaries (say 10 4 to 10 5 entries), and to arbitrary byte streams for both patterns and data samples. The appro