GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Sign in
  • ActionsCI/CD and automation
  • CodespacesCloud development environments
  • All Features
  • Documentation
  • Training
  • Certifications
  • Build with Copilot
  • Customize Copilot
  • Integrations
  • Trending repos
  • GitHub Sponsors
  • Developer articles
  • Enterprises

This view

  • Original page
  • New address

GeezerVison is showing github.com — AlgorithmVisualizer/algorithm/string/edit_distance/desc.json at master · mind-io/AlgorithmVisualizer

Expand file tree

/

desc.json

Copy path
More file actions
More file actions

Latest commit

 

History

History
History
18 lines (18 loc) · 757 Bytes
/

desc.json

Copy path

File metadata and controls

18 lines (18 loc) · 757 Bytes
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
{
"Edit-Distance": "Given two strings str1 (length M) and str2 (length N) and below operations that can performed on str1. Find minimum number of edits (operations) required to convert str1 into str2.<br />Insert<br />Remove<br />Replace<br />All of the above operations are of equal cost",
"Applications": [
"Displaing Near-Proximity Words",
"Information Retrieval (eg- Lucene API)",
"Natural Language Processing"
],
"Complexity": {
"time": "worst $O(|M| \\cdot |N|)$",
"space": "worst $O(|M| \\cdot |N|)$"
},
"References": [
"<a href='https://en.wikipedia.org/wiki/Edit_distance'>Wikipedia</a>"
],
"files": {
"dynamic_programming": "Distance from str1 to str2 using Dynamic Programming (2D Array method)"
}
}
You are visitor 01402520 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.