Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q446273> ?p ?o }
Showing triples 1 to 30 of
30
with 100 triples per page.
- Q446273 subject Q6397419.
- Q446273 subject Q8819520.
- Q446273 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.".
- Q446273 wikiPageExternalLink libbitap.html.
- Q446273 wikiPageExternalLink bitap.py.
- Q446273 wikiPageWikiLink Q1077784.
- Q446273 wikiPageWikiLink Q1120519.
- Q446273 wikiPageWikiLink Q11368.
- Q446273 wikiPageWikiLink Q1266546.
- Q446273 wikiPageWikiLink Q1798621.
- Q446273 wikiPageWikiLink Q185612.
- Q446273 wikiPageWikiLink Q2393193.
- Q446273 wikiPageWikiLink Q269878.
- Q446273 wikiPageWikiLink Q272172.
- Q446273 wikiPageWikiLink Q2903143.
- Q446273 wikiPageWikiLink Q374040.
- Q446273 wikiPageWikiLink Q4693816.
- Q446273 wikiPageWikiLink Q496939.
- Q446273 wikiPageWikiLink Q503419.
- Q446273 wikiPageWikiLink Q5526736.
- Q446273 wikiPageWikiLink Q591605.
- Q446273 wikiPageWikiLink Q6035648.
- Q446273 wikiPageWikiLink Q625642.
- Q446273 wikiPageWikiLink Q6397419.
- Q446273 wikiPageWikiLink Q7322550.
- Q446273 wikiPageWikiLink Q879126.
- Q446273 wikiPageWikiLink Q8819520.
- Q446273 wikiPageWikiLink Q92757.
- Q446273 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.".
- Q446273 label "Bitap algorithm".