Skip to main content
Home
Browse packagesDocs
Sign In with GitHubSign In with GitLab

@std/text@0.215.0

latest
Works with
It is unknown whether this package works with Browsers, Deno, Node.js, Cloudflare Workers, Bun
It is unknown whether this package works with Browsers
It is unknown whether this package works with Deno
It is unknown whether this package works with Node.js
It is unknown whether this package works with Cloudflare Workers
It is unknown whether this package works with Bun
•JSR Score58%•
Published2 years ago (0.215.0)
default

Functions

f
closestString(
givenWord: string,
possibleWords: string[],
options?: { caseSensitive?: boolean; }
): string

get most-similar word

f
compareSimilarity(
givenWord: string,
options?: { caseSensitive?: boolean; }
): (
a: string,
b: string
) => number

Sort based on word similarity

f
levenshteinDistance(
str1: string,
str2: string
): number

Calculates the Levenshtein distance between two strings.

f
toCamelCase(input: string): string

Converts a string into camelCase.

f
toKebabCase(input: string): string

Converts a string into kebab-case.

f
toPascalCase(input: string): string

Converts a string into PascalCase.

f
toSnakeCase(input: string): string

Converts a string into snake_case.

f
wordSimilaritySort(
givenWord: string,
possibleWords: string[],
options?: { caseSensitive?: boolean; }
): string[]

Sorts a string-array by similarity to a given string

case

Functions

f
toCamelCase(input: string): string

Converts a string into camelCase.

f
toKebabCase(input: string): string

Converts a string into kebab-case.

f
toPascalCase(input: string): string

Converts a string into PascalCase.

f
toSnakeCase(input: string): string

Converts a string into snake_case.

closest_string

Functions

f
closestString(
givenWord: string,
possibleWords: string[],
options?: { caseSensitive?: boolean; }
): string

get most-similar word

compare_similarity

Functions

f
compareSimilarity(
givenWord: string,
options?: { caseSensitive?: boolean; }
): (
a: string,
b: string
) => number

Sort based on word similarity

levenshtein_distance

Functions

f
levenshteinDistance(
str1: string,
str2: string
): number

Calculates the Levenshtein distance between two strings.

word_similarity_sort

Functions

f
wordSimilaritySort(
givenWord: string,
possibleWords: string[],
options?: { caseSensitive?: boolean; }
): string[]

Sorts a string-array by similarity to a given string

Report package

Please provide a reason for reporting this package. We will review your report and take appropriate action.

Please review the JSR usage policy before submitting a report.

Add Package

deno add jsr:@std/text

Import symbol

import * as text from "@std/text";
or

Import directly with a jsr specifier

import * as text from "jsr:@std/text";