{"id":13740940,"url":"https://github.com/universal-automata/liblevenshtein","last_synced_at":"2025-08-16T21:14:38.915Z","repository":{"id":4216758,"uuid":"5338102","full_name":"universal-automata/liblevenshtein","owner":"universal-automata","description":"Various utilities regarding Levenshtein transducers.","archived":false,"fork":false,"pushed_at":"2020-10-19T09:34:54.000Z","size":1589,"stargazers_count":67,"open_issues_count":13,"forks_count":13,"subscribers_count":5,"default_branch":"master","last_synced_at":"2025-03-14T05:42:28.897Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"https://github.com/universal-automata/liblevenshtein","language":null,"has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/universal-automata.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2012-08-08T06:45:50.000Z","updated_at":"2023-12-08T10:19:27.000Z","dependencies_parsed_at":"2022-09-14T20:12:05.315Z","dependency_job_id":null,"html_url":"https://github.com/universal-automata/liblevenshtein","commit_stats":null,"previous_names":[],"tags_count":3,"template":false,"template_full_name":null,"purl":"pkg:github/universal-automata/liblevenshtein","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/universal-automata%2Fliblevenshtein","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/universal-automata%2Fliblevenshtein/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/universal-automata%2Fliblevenshtein/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/universal-automata%2Fliblevenshtein/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/universal-automata","download_url":"https://codeload.github.com/universal-automata/liblevenshtein/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/universal-automata%2Fliblevenshtein/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":270771871,"owners_count":24642379,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-08-16T02:00:11.002Z","response_time":91,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2024-08-03T04:00:53.808Z","updated_at":"2025-08-16T21:14:38.887Z","avatar_url":"https://github.com/universal-automata.png","language":null,"funding_links":[],"categories":["Software"],"sub_categories":["Utilities"],"readme":"# liblevenshtein\n\n[![Join the chat at https://gitter.im/universal-automata/liblevenshtein](https://badges.gitter.im/universal-automata/liblevenshtein.svg)](https://gitter.im/universal-automata/liblevenshtein?utm_source=badge\u0026utm_medium=badge\u0026utm_campaign=pr-badge\u0026utm_content=badge)\n\n### A library for generating Finite State Transducers based on Levenshtein Automata.\n\n|     Language |                     Build Status                  |                    Release                   |                 Repository                 |\n|-------------:|:-------------------------------------------------:|:--------------------------------------------:|:------------------------------------------ |\n|         Java | [![Build Status][java-build-status]][java-ci]     | [![Maven Central][java-release]][java-maven] | [liblevenshtein-java][java-repo]           |\n| CoffeeScript | [![Build Status][coffee-build-status]][coffee-ci] | [![npm version][coffee-release]][coffee-npm] | [liblevenshtein-coffeescript][coffee-repo] |\n|          C++ | Work-in-progress                                  | Work-in-progress                             | [liblevenshtein-cpp][cpp-repo]             |\n\nLevenshtein transducers accept a query term and return all terms in a\ndictionary that are within n spelling errors away from it. They constitute a\nhighly-efficient (space _and_ time) class of spelling correctors that work very\nwell when you do not require context while making suggestions.  Forget about\nperforming a linear scan over your dictionary to find all terms that are\nsufficiently-close to the user's query, using a quadratic implementation of the\n[Levenshtein distance](https://en.wikipedia.org/wiki/Levenshtein_distance) or\n[Damerau-Levenshtein\ndistance](https://en.wikipedia.org/wiki/Damerau%E2%80%93Levenshtein_distance),\nthese babies find _all_ the terms from your dictionary in linear time _on the\nlength of the query term_ (not on the size of the dictionary, on the length of\nthe query term).\n\nIf you need context, then take the candidates generated by the transducer as a\nstarting place, and plug them into whatever model you're using for context (such\nas by selecting the sequence of terms that have the greatest probability of\nappearing together).\n\nFor a quick demonstration, please visit the [Github Page, here][live-demo].\nThere's also a command-line interface, [liblevenshtein-java-cli][java-cli].\nPlease see its [README.md][java-cli-readme] for acquisition and usage information.\n\nThe library is currently written in Java, CoffeeScript, JavaScript, and C++. I\nwill be porting it to other languages, soon. If you have a specific language you\nwould like to see it in, or package-management system you would like it deployed\nto, let me know.\n\nThis library is based largely on the work of [Stoyan\nMihov](http://www.lml.bas.bg/~stoyan/), [Klaus\nSchulz](http://www.cis.uni-muenchen.de/people/schulz.html), and Petar Nikolaev Mitankin: \"[Fast\nString Correction with\nLevenshtein-Automata](http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.652\n\"Klaus Schulz and Stoyan Mihov (2002)\")\".  For more details, please see the\n[wiki](https://github.com/universal-automata/liblevenshtein/wiki).\n\n[java-repo]: https://github.com/universal-automata/liblevenshtein-java\n[java-build-status]: https://travis-ci.org/universal-automata/liblevenshtein-java.svg?branch=master\n[java-ci]: https://travis-ci.org/universal-automata/liblevenshtein-java\n[java-maven]: https://maven-badges.herokuapp.com/maven-central/com.github.universal-automata/liblevenshtein\n[java-release]: https://maven-badges.herokuapp.com/maven-central/com.github.universal-automata/liblevenshtein/badge.svg\n\n[coffee-repo]: https://github.com/universal-automata/liblevenshtein-coffeescript\n[coffee-build-status]: https://travis-ci.org/universal-automata/liblevenshtein-coffeescript.svg?branch=master\n[coffee-ci]: https://travis-ci.org/universal-automata/liblevenshtein-coffeescript\n[coffee-npm]: https://www.npmjs.com/package/liblevenshtein\n[coffee-release]: https://badge.fury.io/js/liblevenshtein.svg\n\n[cpp-repo]: https://github.com/universal-automata/liblevenshtein-cpp\n\n[live-demo]: http://universal-automata.github.io/liblevenshtein/\n\n[java-cli]: https://github.com/universal-automata/liblevenshtein-java-cli \"liblevenshtein-java-cli\"\n[java-cli-readme]: https://github.com/universal-automata/liblevenshtein-java-cli/blob/master/README.md \"liblevenshtein-java-cli, README.md\"\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Funiversal-automata%2Fliblevenshtein","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Funiversal-automata%2Fliblevenshtein","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Funiversal-automata%2Fliblevenshtein/lists"}