js-levenshtein
Used in:
components
- OverviewOverview
- VersionsVersions
- DependentsDependents
- DependenciesDependencies
<dependency> <groupId>org.mvnpm</groupId> <artifactId>js-levenshtein</artifactId> <version>1.1.6</version> </dependency>
<?xml version="1.0" encoding="UTF-8"?> <project xsi:schemaLocation="http://maven.apache.org/POM/4.0.0 https://maven.apache.org/xsd/maven-4.0.0.xsd" xmlns="http://maven.apache.org/POM/4.0.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"> <modelVersion>4.0.0</modelVersion> <groupId>org.mvnpm</groupId> <artifactId>js-levenshtein</artifactId> <version>1.1.6</version> <name>js-levenshtein</name> <description>The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.</description> <url>https://github.com/gustf/js-levenshtein#readme</url> <organization> <name>Gustaf Andersson</name> <url>https://github.com/gustf/js-levenshtein#readme</url> </organization> <licenses> <license> <name>MIT</name> </license> </licenses> <developers> <developer> <name>ggustf</name> <email>gustaf@me.com</email> </developer> </developers> <scm> <connection>https://github.com/gustf/js-levenshtein.git</connection> <developerConnection>https://github.com/gustf/js-levenshtein.git</developerConnection> <url>https://github.com/gustf/js-levenshtein</url> </scm> <issueManagement> <url>https://github.com/gustf/js-levenshtein/issues</url> </issueManagement> </project>