Logo
Unionpedia
Communication
Get it on Google Play
New! Download Unionpedia on your Android™ device!
Free
Faster access than browser!
 

Approximate string matching

Index Approximate string matching

In computer science, approximate string matching (often colloquially referred to as fuzzy string searching) is the technique of finding strings that match a pattern approximately (rather than exactly). [1]

32 relations: Acoustic fingerprint, Agrep, Anti-spam techniques, Big O notation, Bitap algorithm, Computer science, Concept search, Dynamic programming, Edit distance, Jaro–Winkler distance, JavaScript, Levenshtein distance, Locality-sensitive hashing, Metaphone, Metric tree, N-gram, Needleman–Wunsch algorithm, Nucleotide, Pattern, Plagiarism detection, Programming tool, Regular expression, Scala (programming language), Search engine indexing, Smith–Waterman algorithm, Soundex, Spell checker, String (computer science), String metric, Substring, Suffix tree, Unix.

Acoustic fingerprint

An acoustic fingerprint is a condensed digital summary, a fingerprint, deterministically generated from an audio signal, that can be used to identify an audio sample or quickly locate similar items in an audio database.

New!!: Approximate string matching and Acoustic fingerprint · See more »

Agrep

agrep (approximate grep) is an open-source approximate string matching program, developed by Udi Manber and Sun Wu between 1988 and 1991, for use with the Unix operating system.

New!!: Approximate string matching and Agrep · See more »

Anti-spam techniques

Various anti-spam techniques are used to prevent email spam (unsolicited bulk email).

New!!: Approximate string matching and Anti-spam techniques · See more »

Big O notation

Big O notation is a mathematical notation that describes the limiting behaviour of a function when the argument tends towards a particular value or infinity.

New!!: Approximate string matching and Big O notation · See more »

Bitap algorithm

The bitap algorithm (also known as the shift-or, shift-and or Baeza-Yates–Gonnet algorithm) is an approximate string matching algorithm.

New!!: Approximate string matching and Bitap algorithm · See more »

Computer science

Computer science deals with the theoretical foundations of information and computation, together with practical techniques for the implementation and application of these foundations.

New!!: Approximate string matching and Computer science · See more »

Concept search

A concept search (or conceptual search) is an automated information retrieval method that is used to search electronically stored unstructured text (for example, digital archives, email, scientific literature, etc.) for information that is conceptually similar to the information provided in a search query.

New!!: Approximate string matching and Concept search · See more »

Dynamic programming

Dynamic programming is both a mathematical optimization method and a computer programming method.

New!!: Approximate string matching and Dynamic programming · See more »

Edit distance

In computational linguistics and computer science, edit distance is a way of quantifying how dissimilar two strings (e.g., words) are to one another by counting the minimum number of operations required to transform one string into the other.

New!!: Approximate string matching and Edit distance · See more »

Jaro–Winkler distance

In computer science and statistics, the Jaro–Winkler distance is a string metric for measuring the edit distance between two sequences.

New!!: Approximate string matching and Jaro–Winkler distance · See more »

JavaScript

JavaScript, often abbreviated as JS, is a high-level, interpreted programming language.

New!!: Approximate string matching and JavaScript · See more »

Levenshtein distance

In information theory, linguistics and computer science, the Levenshtein distance is a string metric for measuring the difference between two sequences.

New!!: Approximate string matching and Levenshtein distance · See more »

Locality-sensitive hashing

Locality-sensitive hashing (LSH) reduces the dimensionality of high-dimensional data.

New!!: Approximate string matching and Locality-sensitive hashing · See more »

Metaphone

Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.

New!!: Approximate string matching and Metaphone · See more »

Metric tree

A metric tree is any tree data structure specialized to index data in metric spaces.

New!!: Approximate string matching and Metric tree · See more »

N-gram

In the fields of computational linguistics and probability, an n-gram is a contiguous sequence of n items from a given sample of text or speech.

New!!: Approximate string matching and N-gram · See more »

Needleman–Wunsch algorithm

The Needleman–Wunsch algorithm is an algorithm used in bioinformatics to align protein or nucleotide sequences.

New!!: Approximate string matching and Needleman–Wunsch algorithm · See more »

Nucleotide

Nucleotides are organic molecules that serve as the monomer units for forming the nucleic acid polymers deoxyribonucleic acid (DNA) and ribonucleic acid (RNA), both of which are essential biomolecules within all life-forms on Earth.

New!!: Approximate string matching and Nucleotide · See more »

Pattern

A pattern is a discernible regularity in the world or in a manmade design.

New!!: Approximate string matching and Pattern · See more »

Plagiarism detection

Plagiarism detection is the process of locating instances of plagiarism within a work or document.

New!!: Approximate string matching and Plagiarism detection · See more »

Programming tool

A programming tool or software development tool is a computer program that software developers use to create, debug, maintain, or otherwise support other programs and applications.

New!!: Approximate string matching and Programming tool · See more »

Regular expression

A regular expression, regex or regexp (sometimes called a rational expression) is, in theoretical computer science and formal language theory, a sequence of characters that define a search pattern.

New!!: Approximate string matching and Regular expression · See more »

Scala (programming language)

Scala is a general-purpose programming language providing support for functional programming and a strong static type system.

New!!: Approximate string matching and Scala (programming language) · See more »

Search engine indexing

Search engine indexing collects, parses, and stores data to facilitate fast and accurate information retrieval.

New!!: Approximate string matching and Search engine indexing · See more »

Smith–Waterman algorithm

The Smith–Waterman algorithm performs local sequence alignment; that is, for determining similar regions between two strings of nucleic acid sequences or protein sequences.

New!!: Approximate string matching and Smith–Waterman algorithm · See more »

Soundex

Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English.

New!!: Approximate string matching and Soundex · See more »

Spell checker

In computing, a spell checker (or spell check) is an application program that flags words in a document that may not be spelled correctly.

New!!: Approximate string matching and Spell checker · See more »

String (computer science)

In computer programming, a string is traditionally a sequence of characters, either as a literal constant or as some kind of variable.

New!!: Approximate string matching and String (computer science) · See more »

String metric

In mathematics and computer science, a string metric (also known as a string similarity metric or string distance function) is a metric that measures distance ("inverse similarity") between two text strings for approximate string matching or comparison and in fuzzy string searching.

New!!: Approximate string matching and String metric · See more »

Substring

A substring is a contiguous sequence of characters within a string.

New!!: Approximate string matching and Substring · See more »

Suffix tree

In computer science, a suffix tree (also called PAT tree or, in an earlier form, position tree) is a compressed trie containing all the suffixes of the given text as their keys and positions in the text as their values.

New!!: Approximate string matching and Suffix tree · See more »

Unix

Unix (trademarked as UNIX) is a family of multitasking, multiuser computer operating systems that derive from the original AT&T Unix, development starting in the 1970s at the Bell Labs research center by Ken Thompson, Dennis Ritchie, and others.

New!!: Approximate string matching and Unix · See more »

Redirects here:

Fuzzy search, Fuzzy searching, Fuzzy string searching.

References

[1] https://en.wikipedia.org/wiki/Approximate_string_matching

OutgoingIncoming
Hey! We are on Facebook now! »