{"id":"https://openalex.org/keywords/levenshtein-algorithm","display_name":"Levenshtein algorithm","description":"A string-comparison algorithm that calculates the minimum number of single-character insertions, deletions, or substitutions needed to transform one string into another.","display_name_alternatives":["Levenshtein distance algorithm"],"ids":{"openalex":"https://openalex.org/keywords/levenshtein-algorithm","wikidata":"https://www.wikidata.org/wiki/Q5338467"},"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.2086,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.2086,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.1032,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"works_count":103,"cited_by_count":591,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/levenshtein-algorithm","updated_date":"2026-11-20T04:06:44","created_date":"2026-09-30T00:00:00"}
