Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Bitap_algorithm> ?p ?o. }
Showing items 1 to 21 of
21
with 100 items per page.
- Bitap_algorithm abstract "The bitap algorithm (also known as the shift-or, shift-and or Baeza-Yates–Gonnet algorithm) is an approximate string matching algorithm. The algorithm tells whether a given text contains a substring which is "approximately equal" to a given pattern, where approximate equality is defined in terms of Levenshtein distance — if the substring and pattern are within a given distance k of each other, then the algorithm considers them equal. The algorithm begins by precomputing a set of bitmasks containing one bit for each element of the pattern. Then it is able to do most of the work with bitwise operations, which are extremely fast.The bitap algorithm is perhaps best known as one of the underlying algorithms of the Unix utility agrep, written by Udi Manber, Sun Wu, and Burra Gopal. Manber and Wu's original paper gives extensions of the algorithm to deal with fuzzy matching of general regular expressions.Due to the data structures required by the algorithm, it performs best on patterns less than a constant length (typically the word length of the machine in question), and also prefers inputs over a small alphabet. Once it has been implemented for a given alphabet and word length m, however, its running time is completely predictable — it runs in O(mn) operations, no matter the structure of the text or the pattern.The bitap algorithm for exact string searching was invented by Bálint Dömölki in 1964 and extended by R. K. Shyamasundar in 1977, before being reinvented in the context of fuzzy string searching by Manber and Wu in 1991 based on work done by Ricardo Baeza-Yates and Gaston Gonnet. The algorithm was improved by Baeza-Yates and Navarro in 1996 and later by Gene Myers for long patterns in 1998.".
- Bitap_algorithm wikiPageExternalLink agrep.ps.1.Z.
- Bitap_algorithm wikiPageExternalLink libbitap.html.
- Bitap_algorithm wikiPageExternalLink bitap.py.
- Bitap_algorithm wikiPageID "2242223".
- Bitap_algorithm wikiPageRevisionID "564630933".
- Bitap_algorithm hasPhotoCollection Bitap_algorithm.
- Bitap_algorithm subject Category:Articles_with_example_C_code.
- Bitap_algorithm subject Category:String_matching_algorithms.
- Bitap_algorithm comment "The bitap algorithm (also known as the shift-or, shift-and or Baeza-Yates–Gonnet algorithm) is an approximate string matching algorithm. The algorithm tells whether a given text contains a substring which is "approximately equal" to a given pattern, where approximate equality is defined in terms of Levenshtein distance — if the substring and pattern are within a given distance k of each other, then the algorithm considers them equal.".
- Bitap_algorithm label "Baeza-Yates-Gonnet-Algorithmus".
- Bitap_algorithm label "Bitap algorithm".
- Bitap_algorithm label "Bitapアルゴリズム".
- Bitap_algorithm label "Двоичный алгоритм поиска подстроки".
- Bitap_algorithm sameAs Baeza-Yates-Gonnet-Algorithmus.
- Bitap_algorithm sameAs Bitapアルゴリズム.
- Bitap_algorithm sameAs m.06ymll.
- Bitap_algorithm sameAs Q446273.
- Bitap_algorithm sameAs Q446273.
- Bitap_algorithm wasDerivedFrom Bitap_algorithm?oldid=564630933.
- Bitap_algorithm isPrimaryTopicOf Bitap_algorithm.