Name
Abstract | ||
|---|---|---|
Our research focuses on Chinese online ink matching that tries to match handwritten annotations with handwritten queries without attempting to recognize them. Previously, we proposed a semantic matching scheme that uses elastic matching with a dynamic programming approach based on the radical model of Chinese characters. By means of semantic matching, a handwritten annotation may also be retrieved independently of writers via typed text query, or stored texts can be retrieved by handwritten queries. This work concerns with the behavior of the previously proposed radical model in several aspects including character normalization, stroke segmentation, structural information, dynamic programming costs and schemes. Based on our study, a new radical model is proposed. As a result, the recall of retrieval by handwritten query reaches 90% for the first hit (an improvement of 20% over previous results) and the recall by text query reaches 80% when top 20 matches are returned. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1007/3-540-44522-6_42 | SSPR/SPR |
Field | DocType | Volume |
Elastic matching,Chinese characters,Cursive,Annotation,Normalization (statistics),Computer science,Natural language processing,Artificial intelligence,Recall,Semantics,Semantic matching | Conference | 1876.0 |
ISSN | ISBN | Citations |
0302-9743 | 3-540-67946-4 | 1 |
PageRank | References | Authors |
0.43 | 9 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Matthew Y. Ma | 1 | 80 | 7.97 |
| C. Zhang | 2 | 261 | 19.93 |
| patrick s p wang | 3 | 303 | 47.66 |