An improved Levenshtein algorithm for spelling correction word candidate list generation
Candidates’ list generation in spelling correction is a process of finding words from a lexicon that should be close to the incorrect word. The most widely used algorithm for generating candidates’ list for incorrect words is based on Levenshtein distance. However, this algorithm takes too much time...
Saved in:
Main Author: | Abdulkhudhur, Hanan Najm |
---|---|
Format: | Thesis |
Language: | English English |
Published: |
2016
|
Subjects: | |
Online Access: | http://etd.uum.edu.my/6564/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Similar Items
-
Implementation of improved Levenshtein algorithm for spelling correction word candidate list generation
by: Abdulkhudur, Hanan Najm, et al.
Published: (2016) -
An Upgrade on the Key Generation Algorithm of the GGH-MKA Lattice-Based Encryption Scheme
by: Arif Mandangan, et al.
Published: (2021) -
A greedy heuristics multiple criteria model for solving multi-landfill site selection and plant propagation algorithm for improving waste collection vehicle routing solutions
by: Nur Azriati, Mat
Published: (2023) -
Winsorize tree algorithm for handling outliers in classification problem
by: Ch’ng, Chee Keong
Published: (2016) -
Global Algorithms for Nonlinear Discrete Optimization and Discrete-Valued Optimal Control Problems
by: Woon, Siew Fang
Published: (2009)