File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1007/11940098_29
- Scopus: eid_2-s2.0-77049117554
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: A hybrid approach to Chinese abbreviation expansion
Title | A hybrid approach to Chinese abbreviation expansion |
---|---|
Authors | |
Keywords | Abbreviation disambiguation Chinese abbreviation expansion Hidden Markov models (HMMs) |
Issue Date | 2006 |
Publisher | Springer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/ |
Citation | 21st International Conference on Computer Processing of Oriental Languages: Beyond the Orient: The Research Challenges Ahead, ICCPOL 2006, Singapore, 17-19 December 2006. In Lecture Notes In Computer Science (Including Subseries Lecture Notes In Artificial Intelligence And Lecture Notes In Bioinformatics), 2006, v. 4285 LNAI, p. 277-287 How to Cite? |
Abstract | This paper presents a hybrid approach to Chinese abbreviation expansion. In this study, each short-form in Chinese text is assumed to be created by the method of reduction and the method of elimination or generalization, respectively. A mapping table between short words and long words and a dictionary of non-reduced short-form/full-form pairs are thus applied to generate the respective expansion candidates. Then, a hidden Markov model (HMM) based disambiguation is employed to rank these candidates and select a proper expansion for each ambiguous abbreviation. In order to improve expansion accuracy, some linguistic knowledge like discourse information and abbreviation patterns are further employed to double-check the expanded results and revise some error expansions if any. The proposed approach was evaluated on an abbreviation-expanded corpus built from the Peking University Corpus. The results showed that a recall of 83.8% and a precision of 86.3% can be achieved on average for different types of Chinese abbreviations. © 2006 Springer-Verlag. |
Persistent Identifier | http://hdl.handle.net/10722/90275 |
ISSN | 2023 SCImago Journal Rankings: 0.606 |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Fu, G | en_HK |
dc.contributor.author | Luke, KK | en_HK |
dc.contributor.author | Zhang, M | en_HK |
dc.contributor.author | Zhou, G | en_HK |
dc.date.accessioned | 2010-09-06T10:08:05Z | - |
dc.date.available | 2010-09-06T10:08:05Z | - |
dc.date.issued | 2006 | en_HK |
dc.identifier.citation | 21st International Conference on Computer Processing of Oriental Languages: Beyond the Orient: The Research Challenges Ahead, ICCPOL 2006, Singapore, 17-19 December 2006. In Lecture Notes In Computer Science (Including Subseries Lecture Notes In Artificial Intelligence And Lecture Notes In Bioinformatics), 2006, v. 4285 LNAI, p. 277-287 | en_HK |
dc.identifier.issn | 0302-9743 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/90275 | - |
dc.description.abstract | This paper presents a hybrid approach to Chinese abbreviation expansion. In this study, each short-form in Chinese text is assumed to be created by the method of reduction and the method of elimination or generalization, respectively. A mapping table between short words and long words and a dictionary of non-reduced short-form/full-form pairs are thus applied to generate the respective expansion candidates. Then, a hidden Markov model (HMM) based disambiguation is employed to rank these candidates and select a proper expansion for each ambiguous abbreviation. In order to improve expansion accuracy, some linguistic knowledge like discourse information and abbreviation patterns are further employed to double-check the expanded results and revise some error expansions if any. The proposed approach was evaluated on an abbreviation-expanded corpus built from the Peking University Corpus. The results showed that a recall of 83.8% and a precision of 86.3% can be achieved on average for different types of Chinese abbreviations. © 2006 Springer-Verlag. | en_HK |
dc.language | eng | en_HK |
dc.publisher | Springer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/ | en_HK |
dc.relation.ispartof | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | en_HK |
dc.subject | Abbreviation disambiguation | en_HK |
dc.subject | Chinese abbreviation expansion | en_HK |
dc.subject | Hidden Markov models (HMMs) | en_HK |
dc.title | A hybrid approach to Chinese abbreviation expansion | en_HK |
dc.type | Conference_Paper | en_HK |
dc.identifier.email | Luke, KK:kkluke@hkusua.hku.hk | en_HK |
dc.identifier.authority | Luke, KK=rp01201 | en_HK |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1007/11940098_29 | en_HK |
dc.identifier.scopus | eid_2-s2.0-77049117554 | en_HK |
dc.identifier.hkuros | 153287 | en_HK |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-77049117554&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 4285 LNAI | en_HK |
dc.identifier.spage | 277 | en_HK |
dc.identifier.epage | 287 | en_HK |
dc.publisher.place | Germany | en_HK |
dc.description.other | 21st International Conference on Computer Processing of Oriental Languages: Beyond the Orient: The Research Challenges Ahead, ICCPOL 2006, Singapore, 17-19 December 2006. In Lecture Notes In Computer Science (Including Subseries Lecture Notes In Artificial Intelligence And Lecture Notes In Bioinformatics), 2006, v. 4285 LNAI, p. 277-287 | - |
dc.identifier.scopusauthorid | Fu, G=7202721096 | en_HK |
dc.identifier.scopusauthorid | Luke, KK=7003697439 | en_HK |
dc.identifier.scopusauthorid | Zhang, M=36041252700 | en_HK |
dc.identifier.scopusauthorid | Zhou, G=7403686010 | en_HK |
dc.identifier.issnl | 0302-9743 | - |