References
- Aho , A. V. , Sethi , D. and Ullman , J. D. 1982 . “ Compilers-Principles, Techniques, and Tools, Reading Mass ” . Addison-Wesley .
- Aho , A. V. and Ullman , J. D. 1983 . “ Data Structures and Algorithms ” . Addison-Wesley .
- Aoe , J. 1987-04 . The efficient implementation of finite-state machine using double-array . Trans. (D)IEICEJ , 70 ( 4 ) : 653 – 662 .
- Appel , A. W. and Jacobson , G. J. 1988 . The world's fastest scrabble program . Commun. ACM , 31 ( 5 ) : 572 – 578 .
- Berman , F. , Bock , E. , Dittert , E. , O′donnelland , M. J. and Plank , D. 1986 . Collections of functions for perfect hashing . SIAM J. Comput , 15 ( 2 ) : 604 – 618 .
- Blumer , A. , Blumer , J. , Haussler , D. and Mcconnell , R. 1987 . Complete inverded filters for efficient text retrieval and analysis . Journal of ACM , 34 ( 3 ) : 578 – 595 .
- Fredkin , E. 1960 . Trie memory . Commun. ACM , 3 ( 9 ) : 490 – 500 .
- Jonge , W. D. , Tanenbaum , A. S. and Reit , R. P. 1987 . Two access method using compact binary trees . IEEE Trans. Softw. Eng , 13 ( 7 ) : 799 – 809 .
- Kawaguchi , H. , Kato , K. , Fujisawa , H. , Hatakeyama , A. and Fujinawa , M. 1989 . A fast string retrieval scheme for free word retrieval . 39th Nat. Conv. Inf. Proc. Soc. Jap , 2N-8 ( 7 )
- Knuth , D. E. 1973 . Sorting and Searching . The Art of Computer Programming , 3 ( 7 )
- Kurt , M. 1976 . Compressed Tries . Commun. ACM , 19 ( 7 ) : 409 – 415 .
- Peterson , J. L. 1980 . “ Computer Programs for Spelling Correction ” . In Lecture Notes in Comput. Set , 57 – 64 . N.Y : Springer-Verlag .
- Sheil , B. A. 1978 . Median split trees: A fast lookup techniques for frequency occurring keys . Commun.ACM , 21 ( 11 ) : 947 – 959 .
- Suzuki , E. and Takeda , K. 1989 . Design and evaluation of Japanese document edit-support system . Trans. Inf. Proc. Soc , 30 ( 11 ) : 1402 – 1412 .