{"@context":"https://w3id.org/codemeta/3.0","@type":"SoftwareSourceCode","identifier":"pkg:cargo/sesdiff","name":"sesdiff","description":"Generates a shortest edit script (Myers' diff algorithm) to indicate how to get from the strings in column A to the strings in column B. Also provides the edit distance (levenshtein).","version":"0.3.2","softwareVersion":"0.3.2","license":"https://spdx.org/licenses/GPL-3.0+","codeRepository":"https://github.com/proycon/sesdiff","issueTracker":"https://github.com/proycon/sesdiff/issues","url":"https://github.com/proycon/sesdiff/","keywords":["linguistics","nlp","text-processing","lemmatization"],"programmingLanguage":{"@type":"ComputerLanguage","name":"Rust"},"maintainer":[{"@type":"Person","name":"proycon","url":"https://github.com/proycon"}],"author":[{"@type":"Person","name":"proycon","url":"https://github.com/proycon"}],"copyrightHolder":[{"@type":"Person","name":"proycon","url":"https://github.com/proycon"}],"dateCreated":"2020-08-14","dateModified":"2026-09-09","datePublished":"2026-09-09","copyrightYear":2020,"downloadUrl":"https://static.crates.io/crates/sesdiff/sesdiff-0.3.2.crate","softwareHelp":{"@type":"WebSite","url":"https://docs.rs/sesdiff/"},"applicationCategory":"cargo","runtimePlatform":"cargo","developmentStatus":"active","sameAs":["https://crates.io/crates/sesdiff/"],"https://www.w3.org/ns/activitystreams#likes":4}