Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

approximate string-matching algorithm · Vinony

approximate string-matching algorithm

EntityQ1798621· pop 11· linked from 91 articles

approximate string-matching algorithm

Sign in to save

algorithm for finding strings that match a pattern approximately

Wikidata facts

Instance of: algorithm
Subclass of: string-searching algorithm

via Wikidata · CC0

Connections

regular expression

Categories

Dynamic programming Pattern matching String matching algorithms

Sources

wikipedia.externallinksexternallink
Wikidata (CC0)wikidata-claims
Pixabayimage-pixabay

computer science

Entity

International Standard Book Number

digital object identifier

dynamic programming

Levenshtein distance

Hamming distance

sequence alignment

What links here91 pages

string-searching algorithm

Levenshtein distance

ZeroBrane Studio

sequence mining

longest common subsequence problem

nondeterministic finite automaton

Aho–Corasick algorithm

Boyer–Moore string search algorithm

Hirschberg's algorithm

phonetic algorithm

regular expression

ternary search tree

bitap algorithm

Hamming distance

Knuth–Morris–Pratt algorithm

Damerau–Levenshtein distance

Jaro–Winkler distance

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

Rabin–Karp algorithm

Entitydist 0.38

longest prefix match

Entitydist 0.43

Markov algorithm

Entitydist 0.48

Gale–Shapley algorithm

Entitydist 0.56

Entitydist 0.61

Entitydist 0.61

galactic algorithm

Entitydist 0.61

Entitydist 0.63

Fletcher's checksum

Entitydist 0.63

Adagio for Strings

Entitydist 0.64

Normes ortogràfiques

Entitydist 0.64

variable-length code

Entitydist 0.65