Search results

Create the page "String matching algorithms" on this wiki! See also the search results found.

• Trigram search
  {{Short description|String matching algorithm}} ...match the maximum number of three consecutive character [[character string|string]]s (i.e. [[Trigram|trigrams]]) in the entered search terms, which are gener
  5 KB (739 words) - 12:58, 29 November 2024
• Agrep
  | genre = [[Pattern matching]] ...and 1991,<ref>{{cite conference |title=Agrep -- a fast approximate pattern-matching tool |last1=Wu |first1=Sun |last2=Manber |first2=Udi |date=20–24 January
  4 KB (552 words) - 11:07, 27 May 2025
• Wildcard character
  ...rt description|Character used to substitute for any other character/s in a string}} ..., which can be interpreted as a number of literal characters or an [[empty string]]. It is often used in file searches so the full name need not be typed.<re
  5 KB (745 words) - 13:50, 12 March 2025
• Dictionary coder
  {{Short description|Family of lossless data compression algorithms}} ...er. When the encoder finds such a match, it substitutes a reference to the string's position in the data structure.
  5 KB (717 words) - 08:14, 24 April 2025
• Phonetic algorithm
  ...=t7RDjagG1FAC&pg=PA498 |language=en}}</ref> More general phonetic matching algorithms take articulatory features into account <ref>Ladefoged, Peter. [https://acl ==Algorithms==
  6 KB (800 words) - 14:59, 4 March 2025
• String-searching algorithm
  ...tring-matching algorithm''', is an [[algorithm]] that searches a body of [[string (computer science)|text]] for portions that match by pattern. A basic example of string searching is when the pattern and the searched text are [[Array data struct
  18 KB (2,570 words) - 20:41, 23 April 2025
• Rabin–Karp algorithm
  {{Short description|String searching algorithm}} |class = [[string-searching algorithm|String searching]]
  14 KB (2,128 words) - 00:08, 1 April 2025
• Aho–Corasick algorithm
  {{Short description|String-searching algorithm}} |class = String Searching, String Matching
  10 KB (1,595 words) - 01:59, 19 April 2025
• Prediction by partial matching
  ...uncompressed symbol stream to predict the next symbol in the stream. PPM algorithms can also be used to cluster data into predicted groupings in [[cluster anal In many compression algorithms, the ranking is equivalent to probability mass function estimation. Given t
  7 KB (1,019 words) - 09:57, 25 May 2025
• Pattern matching
  {{About|pattern matching in [[functional programming]]||string matching|and|pattern recognition}} {{For|the use of variable matching criteria in defining abstract patterns to match|regular expression}}
  22 KB (3,214 words) - 19:44, 12 May 2025
• Udi Manber
  ...| doi = 10.1137/0222058 | title = Suffix Arrays: A New Method for On-Line String Searches | journal = [[SIAM Journal on Computing|SIAM J. Comput.]] | volume ...}}</ref><ref>{{cite book | last=Manber | first=Udi |title=Introduction to algorithms: a creative approach |publisher=Addison-Wesley |year=1989 |isbn=978-0-201-1
  8 KB (952 words) - 23:06, 27 May 2025
• Edit distance
  {{short description|Computer science metric of string similarity}} ...red by counting the minimum number of operations required to transform one string into the other. Edit distances find applications in [[natural language proc
  19 KB (2,779 words) - 18:47, 30 March 2025
• Boyer–Moore string-search algorithm
  {{Short description|String searching algorithm}} |name=Boyer–Moore string search
  22 KB (3,498 words) - 17:10, 24 May 2025
• CPM
  *[[Compressed pattern matching]], string searches within uncompressed text *[[Combinatorial pattern matching]], a research area (and a conference) for [[algorithm]]s
  4 KB (475 words) - 10:59, 12 February 2025
• Hash collision
  ...ash clash'''<ref>{{Citation|last=Thomas|first=Cormen|title=Introduction to Algorithms |date=2009|pages=253|publisher=MIT Press|isbn=978-0-262-03384-8}}</ref> is ...cess-date=2016-04-20|website=Computerworld|quote=Much more than encryption algorithms, one-way hash functions are the workhorses of modern cryptography.}}</ref>
  9 KB (1,409 words) - 10:46, 9 November 2024
• CRM114 (program)
  The CRM114 algorithms are multi-lingual (compatible with [[UTF-8]] encodings) and null-safe. A v ...sible to write programs that do not depend on absolutely identical strings matching to function correctly.
  7 KB (967 words) - 00:19, 28 May 2025
• Soundex
  ...>{{cite web |url=http://stevemorse.org/phonetics/bmpm2.htm |title=Phonetic Matching: A Better Soundex |access-date=2012-11-03}}</ref> Using this algorithm, both "Robert" and "Rupert" return the same string "R163" while "Rubin" yields "R150". "Ashcraft" and "Ashcroft" both yield "A
  11 KB (1,693 words) - 18:41, 31 December 2024
• Document retrieval
  '''Document retrieval''' is defined as the matching of some stated user query against a set of [[free-text]] records. These rec Document retrieval systems find information to given criteria by matching text records (''documents'') against user queries, as opposed to [[expert s
  6 KB (816 words) - 00:25, 3 December 2023
• List of graph theory topics
  * [[String graph]] ==Algorithms==
  7 KB (788 words) - 02:52, 24 September 2024
• LZ77 and LZ78
  {{Short description|Lossless data compression algorithms}} ...chain algorithm|LZMA]] and others. Besides their academic influence, these algorithms formed the basis of several ubiquitous compression schemes, including [[GIF
  18 KB (2,827 words) - 09:26, 9 January 2025