Libraries tagged by lever

designbycode/levenshtein-distance

1 Favers
100 Downloads

The LevenshteinDistance class provides a method to calculate the Levenshtein distance between two strings. The Levenshtein distance is a measure of the minimum number of single-character edits (insertions, deletions, or substitutions) required to change one word into the other.

Go to Download


dbeurive/lexer

2 Favers
2287 Downloads

This project implements a simple lexer.

Go to Download


datingvip/damerau-levenshtein

0 Favers
980 Downloads

Get text similarity level with Damerau-Levenshtein distance

Go to Download


cageis/lexer

7 Favers
4 Downloads

Used to separate the characters of a string into tokens.

Go to Download


reflar/level-ranks

9 Favers
6707 Downloads

Add a level/experience bar to your flarum Forum.

Go to Download


level3/level3

13 Favers
345 Downloads

A RESTful API builder based on 3-level model (URI, HTTP and Hypermedia)

Go to Download


vanderlee/comprehend

6 Favers
16 Downloads

Framework for building BNF LR(1) parsers

Go to Download


symftony/xpression

16 Favers
1837 Downloads

Xpression is a simple PHP implementation of Specification pattern

Go to Download


souplette/fusbup

0 Favers
573 Downloads

A fast & memory-efficient interface to the Mozilla Public Suffix List.

Go to Download


seeren/log

0 Favers
245 Downloads

Log message and determine level

Go to Download


robinthehood/tokenizer

0 Favers
816 Downloads

With Tokenizer you can easily convert a string to a stream or array of tokens.

Go to Download


openlss/func-log

1 Favers
187 Downloads

Logging functions, also handles CLI output

Go to Download


marcelthole/geo-parser

0 Favers
2285 Downloads

Parser for geography coordinate strings

Go to Download


lazzard/ftp-bridge

9 Favers
26 Downloads

Allows free communication with FTP servers according to RFC959 specification and others related RFC extensions

Go to Download


designbycode/fuzzy-search

0 Favers
5 Downloads

The Fuzzy Search package provides a simple and efficient way to perform fuzzy searches on a collection of texts using the Levenshtein distance algorithm. This package is useful when you need to search for texts that may contain typos or slight variations.

Go to Download


<< Previous Next >>