"Using Longest Common Subsequence Matching for Chinese Information Retrieval."

Yun Xiao et al. (2005)

> Home

Details and statistics

DOI: —

access: closed

type: Journal Article

metadata version: 2020-05-14

- view
  - electronic edition @ colips.org
- export record
  dblp key:
  - journals/jclc/XiaoLWK05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jclc/XiaoLWK05
Yun Xiao, Robert W. P. Luk, Kam-Fai Wong, K. L. Kwok:
Using Longest Common Subsequence Matching for Chinese Information Retrieval. J. Chin. Lang. Comput. 15(1): 45-52 (2005)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.