W. J. Teahan, Ian H. Witten  Home/Search
Context
Related
| cs.waikato.ac.nz/pub/pape...paper.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: fermivista.math...s.waikato.ac.nz (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A dictionary storage structure is described which is particularly good for locating a partially-specified key that has given letters in certain positions. It makes this operation, which returns the entire set of matching keys, just as efficient as searching for the full key. The structure also supports finding anagrams, seeking regular expressions, and sorting. It is compact: depending on the method used for representing the sparse sets that are involved it may even provide some compression... (Update)
Active bibliography (related documents): More All
0.3: Compression of Correlated Bit-Vectors - Bookstein, Klein (1990) (Correct)
0.3: Models of Bitmap Generation: A Systematic Approach to Bitmap .. - Bookstein, Klein (1992) (Correct)
0.3: Towards Reliable Modelling with Stochastic Process Algebras - Bradley (1999) (Correct)
Similar documents based on text: More All
0.3: An Open Interface for Probabilistic Models of Text - Cleary, Teahan (1999) (Correct)
0.3: Combining PPM models using a text mining approach - Teahan, Harper (2001) (Correct)
0.3: Correcting English text using PPM models - Teahan, Inglis, Cleary, Holmes (1998) (Correct)
BibTeX entry: (Update)
@misc{ teahan-storing,
author = "W. J. Teahan and Ian H. Witten",
title = "Storing And Retrieving Keys In A Table By Cross-Indexing",
url = "citeseer.ist.psu.edu/41290.html" }
Citations (may not include all citations):2003 The art of computer programming (context) - Knuth - 1973
344 Arithmetic coding for data compression (context) - Witten, Neal et al. - 1987
78 Programming Pearls (context) - Bentley - 1986 ACM
34 Computer programs for detecting and correcting spelling erro.. (context) - Peterson - 1980 ACM DBLP
31 Trie memory (context) - Fredkin - 1960 ACM
30 Computer recreations (context) - Dewdney - 1984
25 The world's fastest Scrabble program (context) - Appel, Jacobson - 1988 ACM DBLP
24 Storing text retrieval systems on CD-ROM: compression and en.. - Klein, Bookstein et al. - 1989 ACM DBLP
19 Parameterised compression for sparse bitmaps - Moffat, Zobel - 1992 ACM DBLP
17 An optimal algorithm for generating minimal perfect hash fun.. - Czech, Havas et al. - 1991 ACM DBLP
14 Practical minimal perfect hash functions for large databases (context) - Fox, Heath et al. - 1992 ACM DBLP
14 A contextual postprocessing system for error correction usin.. (context) - Riseman, Hanson - 1974
13 Novel compression of sparse bit-strings---preliminary report (context) - Fraenkel, Klein - 1985
6 Interpolation search---a log log N search (context) - Perl, Itai et al. - 1978
6 Indexing and compressing full-text databases for CD-ROM (context) - Witten, Bell et al. - 1991
6 Compression of correlated bit-vectors - Bookstein, Klein - 1991 ACM DBLP
5 Computer construction of crossword puzzles using precedence .. (context) - Mazlack - 1976 DBLP
5 Median split trees : a fast lookup technique for frequently .. (context) - Sheil - 1978
3 IEEE Transactions on Computers (context) - on, Sedgewick et al. - 1988
3 Datenbanksysteme II (context) - Wedekind, Harder - 1976
1 Minimal perfect hash functions (context) - Teahan - 1992
1 Association for Computing Machinery (context) - Baeza-Yates, Gonnet - 1992
1 Crossword compilation with Horn Clauses (context) - Berghal - 1987 ACM DBLP
1 Crossword compilation using integer programming (context) - Wilson - 1989 ACM DBLP
1 Storing sparse sets---theory and practice (context) - Rinsma-Melchert, Teahan et al. - 1993
1 Cited by Jakobsson (context) - Mannheim - 1982
1 Natural information procesing (context) - Partridge, James - 1974
1 Huffman coding in bit-vector compression (context) - Jacobsson - 1978 DBLP
1 Improved hierarchical bit-vector compression in document ret.. (context) - TR, University et al. - 1986 ACM DBLP
1 Evaluation of a hierarchical bit-vector compression techniqu.. (context) - Jacobsson - 1982
1 Correcting human error in alphanumeric terminal input (context) - Muth, Tharp - 1977
1 Association for Computing Machinery (context) - Wu, Manber - 1992
1 A proposed standard for measuring crossword compilation (context) - Journal, Berghal et al. - 1990
1 A unifying framework for trie design heuristics (context) - Murphy - 1990 ACM DBLP
1 A prototype crossword compiler (context) - Smith, Steen - 1981 DBLP
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cs.waikato.ac.nz.html): More
Constructing Multi-View Editing Environments Using MViews - Grundy, Hosking (1993) (Correct)
The Calculator Project - Formal Reasoning about Programs - Reeves, Goldson (1995) (Correct)
Applying a Machine Learning Workbench: Experience.. - Garner.. (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC