Recursive Enumeration K-Best Decoding Algorithm in Chinese Input Method Application

Xue Gang Zhan; Peng Zhang

doi:10.4028/www.scientific.net/AMR.846-847.1326

Paper Titles

Quantification Research on the Fuzzy Semantics of English Adverbs Based on MMTD
p.1308

A New Method of High-Precision Coordinate Transformation Research Based on Bursa Model
p.1312

Modified PSO Algorithm for Solving the Eigenvalues of Matrix
p.1316

A Geometric Constraints Based Single-Image Reconstruction Method
p.1320

Recursive Enumeration K-Best Decoding Algorithm in Chinese Input Method Application
p.1326

The Process of Ant Algorithm for Solving the Degree-Constrained Euclidean Steiner Minimal Tree
p.1330

Data Processing Modeling for Reference Materials Preparation
p.1334

Face Image Segmentation Technology Research
p.1339

Identification of Dangerous Driving Behaviors Based on Neural Network and Bayesian Filter
p.1343

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 846-847Recursive Enumeration K-Best Decoding Algorithm in...

Recursive Enumeration K-Best Decoding Algorithm in Chinese Input Method Application

Abstract:

The sentence transformation from phonetic to word is a very critical part of the input method. When the input method can not find the candidate through a dictionary word directly, it needs to obtain the results desired by the user through sentence transformation. In this paper, based on recursive enumeration k-best decoding algorithm is used in the input method sentence transformation , with the language model, to get the k-optimal transformation results . Experimental results show that in the input method application environment, based on a recursive enumeration k-best decoding algorithm decoding efficiency significantly better than the deletion algorithm which is the baseline.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 846-847)

Pages:

1326-1329

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.846-847.1326

Citation:

Cite this paper

Online since:

November 2013

Authors:

Xue Gang Zhan*, Peng Zhang

Keywords:

Deletion Algorithm, Input Method, K-Best Decoding, Recursive Enumeration, Sentence Transformation

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] J.A. Azevedo, J.J.E.R.S. Madeira, E.Q.V. Martins and F.M.A. Pires, A shortest paths ranking algorithm, (1990), Proceedings of the Annual Conference AIRO'90, Models and Methods for Decision Support, Operational Research Society of Italy, 1001-1011.

Google Scholar

[2] J. A. Azevedo, M. E. O. Santos Costa, J. J. E. R. Silvestre Madeira, and E. Q. V. Martins. An algorithm for the ranking of shortest paths. Eur. J. Operational Research 69: 97–106, (1993).

DOI: 10.1016/0377-2217(93)90095-5

Google Scholar

[3] A. Bako and P. Kas. Determining the k-th shortest path by matrix method. Szigma 10: 61–66, 1977. In Hungarian.

Google Scholar

[4] A.W. Brander and M. C. Sinclair. A comparative study of k-shortest path algorithms. Proc. 11th UK Performance Engineering Worksh. for Computer and Telecommunications Systems, September (1995).

DOI: 10.1007/978-1-4471-1007-1_25

Google Scholar

[5] Aoe, J. An Efficient Digital Search Algorithm by Using a Double-Array Structure. IEEE Transactions on Software Engineering. Vol. 15, 9 (Sep 1989). pp.1066-1077.

DOI: 10.1109/32.31365

Google Scholar

[6] E.Q.V. Martins and J.L.E. Santos. A new shortest paths ranking algorithm. Investigacao Operacional, 20: (1): 47-62, (2000).

Google Scholar

[7] Victor M. Jimenez and Andres Marzal. Computing the k shortest paths: A new algorithm and a experimental comparison, 15-28, (1999).

Google Scholar