Enhancing Levenshtein’s Edit Distance Algorithm for Evaluating Document Similarity

Communications in Computer and Information Science - Germany
doi 10.1007/978-981-13-0755-3_6
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Singapore

Related search

Optimising the Volgenant–Jonker Algorithm for Approximating Graph Edit Distance

Pattern Recognition Letters
Signal ProcessingComputer VisionPattern RecognitionArtificial IntelligenceSoftware
2017English

Document Similarity Detection Using K-Means and Cosine Distance

International Journal of Advanced Computer Science and Applications
Computer Science
2019English

Designing an A* Algorithm for Calculating Edit Distance Between Rooted-Unordered Trees

Journal of Computational Biology
GeneticsMolecular BiologyComputational TheorySimulationComputational MathematicsMathematicsModeling
2006English

Comparing Heuristics for Graph Edit Distance Computation

VLDB Journal
HardwareInformation SystemsArchitecture
2019English

Implementation of Document Management System Using Levenshtein Distance Algorithm

International Journal of Computer Applications
2020English

Quantification of Similarity Using the Edit-Distance Method for Searching Cooperative Programs Related to Disaster and Safety Management

Journal of the Korean Society of Hazard Mitigation
2018English

An Efficient Query Algorithm for Trajectory Similarity Based on Fréchet Distance Threshold

ISPRS International Journal of Geo-Information
DevelopmentPlanetary SciencesComputers in Earth SciencesPlanningEarthGeography
2017English

Text Classification Using Document-Document Semantic Similarity

International Journal of Web Science
2013English

String Reconciliation With Unknown Edit Distance

2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy