Search

Advanced Search

Find results with:

Add another field

Search by date

to

Searching collections:

Institutional Repository

Add or remove collections

Home ADtrees for Sequential Data and N-gram Counting

Rate

To link to this object, paste this link in email, IM or document

To embed this object, paste this HTML in website

ADtrees for Sequential Data and N-gram Counting

View Description

Download

small (250x250 max)

medium (500x500 max)

large ( > 500x500)

Full Resolution

Print

PDF
Text

Description

Rating
Permanent URL	http://hdl.lib.byu.edu/1877/2517
Title	ADtrees for Sequential Data and N-gram Counting
BYU Creator	Van Dam, Robert Ventura, Dan A.
Keywords	ADtrees; n-gram count; corpora data
Description/Abstract	We consider the problem of efficiently storing n-gram counts for large n over very large corpora. In such cases, the efficient storage of sufficient statistics can have a dramatic impact on system performance. One popular model for storing such data derived from tabular data sets with many attributes is the ADtree. Here, we adapt the ADtree to benefit from the sequential structure of corpora-type data. We demonstrate the usefulness of our approach on a portion of the well-known Wall Street Journal corpus from the Penn Treebank and show that our approach is exponentially more efficient than the naïve approach to storing n-grams and is also significantly more efficient than a traditional prefix tree.
Source	Rob Van Dam and Dan Ventura, "ADtrees for Sequential Data and N-gram Counting", Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, pp. 492-497, 2007.;
Publisher	IEEE
Date Original	2007
Date Digital	2010-09-28
Language	English eng en
Publication Type	Articles Conference Proceedings
Type	Text
Format	application/pdf
Owning Institution	Brigham Young University
BYU College	College of Physical and Mathematical Sciences
BYU Department	Computer Science
Copyright Status	(c) 2007 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.;
Copyright Use Information	http://www.lib.byu.edu/generic_copyright.html

Tags

Add tags for ADtrees for Sequential Data and N-gram Counting

View as list | View as tag cloud | report abuse

Comments

Post a Comment for ADtrees for Sequential Data and N-gram Counting

you wish to report:

Your comment:

Your Name:

Submit

Cancel

...

Powered by CONTENTdm®