File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: A Data Structure Using Hashing and Tries For Efficient Chinese Lexical Access

TitleA Data Structure Using Hashing and Tries For Efficient Chinese Lexical Access
Authors
Lam, YKHuo, Q
KeywordsData structures
Natural languages
Vocabulary
Word processing
Issue Date2005
PublisherIEEE Computer Society.
Citation
8th International Conference on Document Analysis and Recognition (ICDAR 2005), Seoul, South Korea, August 29 - September 1, 2005. In Eighth International Conference on Document Analysis and Recognition (ICDAR'05), 2005, v. 1, p. 506-510 How to Cite?
DOI: http://dx.doi.org/10.1109/ICDAR.2005.7
AbstractA lexicon is needed in many applications. In the past, different structures such as tries, hash tables and their variants have been investigated for lexicon organization and lexical access. In this paper, we propose a new data structure that combines the use of hash table and tries for storing a Chinese lexicon. The data structure facilitates an efficient lexical access yet requires less memory than that of a trie lexicon. Experiments are conducted to evaluate its performance for in-vocabulary lexical access, out-of-vocabulary word rejection, and substring matching. The effectiveness of the proposed approach is confirmed.
Persistent Identifierhttp://hdl.handle.net/10722/53614
ISBN
0-7695-2420-6
ISSN
1520-5363
2020 SCImago Journal Rankings: 0.353

 

DC FieldValueLanguage
dc.contributor.authorLam, YKen_HK
dc.contributor.authorHuo, Qen_HK
dc.date.accessioned2009-04-03T07:24:41Z-
dc.date.available2009-04-03T07:24:41Z-
dc.date.issued2005en_HK
dc.identifier.citation8th International Conference on Document Analysis and Recognition (ICDAR 2005), Seoul, South Korea, August 29 - September 1, 2005. In Eighth International Conference on Document Analysis and Recognition (ICDAR'05), 2005, v. 1, p. 506-510en_HK
dc.identifier.isbn0-7695-2420-6-
dc.identifier.issn1520-5363-
dc.identifier.urihttp://hdl.handle.net/10722/53614-
dc.description.abstractA lexicon is needed in many applications. In the past, different structures such as tries, hash tables and their variants have been investigated for lexicon organization and lexical access. In this paper, we propose a new data structure that combines the use of hash table and tries for storing a Chinese lexicon. The data structure facilitates an efficient lexical access yet requires less memory than that of a trie lexicon. Experiments are conducted to evaluate its performance for in-vocabulary lexical access, out-of-vocabulary word rejection, and substring matching. The effectiveness of the proposed approach is confirmed.en_HK
dc.languageengen_HK
dc.publisherIEEE Computer Society.en_HK
dc.relation.ispartofEighth International Conference on Document Analysis and Recognition (ICDAR'05)-
dc.rights©2005 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.-
dc.subjectData structuresen_HK
dc.subjectNatural languagesen_HK
dc.subjectVocabularyen_HK
dc.subjectWord processingen_HK
dc.titleA Data Structure Using Hashing and Tries For Efficient Chinese Lexical Accessen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailLam, YK: h9914679@graduate.hku.hken_HK
dc.identifier.emailHuo, Q: qhuo@cs.hku.hken_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/ICDAR.2005.7-
dc.identifier.scopuseid_2-s2.0-33947432416-
dc.identifier.hkuros101984-
dc.identifier.issnl1520-5363-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats