International Journal of Scientific and Research Publications

Home
About Us
Editorial Board

Online Publication

Log In
New User?
       Register Now!
Forgot Password?
       Email Password!


Call For Papers

Call for Research Paper

Authors

Online Submission
Paper Submission Guidelines
Online Publication Charge
Print Publication Charge
How to publish research paper
Publication Certificate
Research Catalogue
Resources
FAQs

Reviewer

Join Reviewer Panel
Reviewer Guidelines

IJSRP Publications

E-Journal
Print Journal

Downloads

IJSRP Paper Format
Instructions

Contact Us

Feedback Form
Contact Us
Site Map

IJSRP, Volume 9, Issue 9, September 2019 Edition [ISSN 2250-3153]



      Yi Mar Myint

Abstract: In information theory, linguistics and computer science, the Levenshtein distance is a string metric for measuring the difference between two sequences. Informally, the Levenshtein distance between two words is the minimum number of single-character edits (insertions, deletions or substitutions) required to change one word into the other. The edit distance between two sequences is the minimum number of weighted transformation-operations that are required to transform one string into the

[Reference this Paper]   [BACK]

Ooops! It appears you don't have a PDF plugin for this barrPostingser. you can click here to download the PDF file.

Reference this Research Paper (copy & paste below code):

Yi Mar Myint (2019); Edit distance computation with minimum number of edit operations in database management system and information retrieval; International Journal of Scientific and Research Publications (IJSRP) 9(9) (ISSN: 2250-3153), DOI: http://dx.doi.org/10.29322/IJSRP.9.09.2019.p9385

IJSRP PUBLICATIONS

Home

About Us
Editorial Board
Call for Paper

Call for Research Paper
Paper Status
IJSRP Paper Format
Join Us

Download e-journal
Join Forum
Invite Friends
Subscribe
Get Social with Us!



Copyright © 2011-2016, IJSRP Inc., All rights reserved.