[Summary view]

   1  <?php
   2  
   3  //
   4  // NOTICE OF COPYRIGHT
   5  //
   6  // Original code:
   7  //
   8  // Drupal - The copyright of both the Drupal software and the
   9  //          "Druplicon" logo belongs to all the original authors,
  10  //          though both are licensed under the GPL.
  11  //          http://drupal.org
  12  //
  13  // Modifications:
  14  //
  15  // Moodle - Modular Object-Oriented Dynamic Learning Environment
  16  //          http://moodle.com
  17  //
  18  // This file is part of Moodle - http://moodle.org/
  19  //
  20  // Moodle is free software: you can redistribute it and/or modify
  21  // it under the terms of the GNU General Public License as published by
  22  // the Free Software Foundation, either version 3 of the License, or
  23  // (at your option) any later version.
  24  //
  25  // Moodle is distributed in the hope that it will be useful,
  26  // but WITHOUT ANY WARRANTY; without even the implied warranty of
  27  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  28  // GNU General Public License for more details.
  29  //
  30  // You should have received a copy of the GNU General Public License
  31  // along with Moodle.  If not, see <http://www.gnu.org/licenses/>.
  32  //
  33  
  34  /**
  35   * Based on Drupal's search.module version 1.224
  36   *
  37   * {@link http://cvs.drupal.org/viewcvs/drupal/drupal/modules/search/search.module?view=markup}
  38   *
  39   * Usage: $tokens = tokenise_text($text)
  40   * Returns an array of tokens (key) with their score (value)
  41   * (see function definition for more info)
  42   *
  43   * Major Contributors
  44   *  - Martin Dougiamas  {@link http://moodle.com}
  45   *  - Eloy Lafuente (stronk7) {@link http://contiento.com}
  46   *  - Antonio Vicent          {@link http://ludens.es}
  47   *
  48   * @package   moodlecore
  49   * @copyright (C) 2001-3001 Eloy Lafuente (stronk7) {@link http://contiento.com}
  50   * @license   http://www.gnu.org/copyleft/gpl.html GNU GPL v3 or later
  51   */
  52  
  53  /**
  54   * Some constants
  55   */
  56  define ('MINIMUM_WORD_SIZE',  3); /// Minimum word size to index and search
  57  define ('MAXIMUM_WORD_SIZE', 50); /// Maximum word size to index and search
  58  
  59  define ('START_DELIM',  "\xce\xa9\xc3\x91\xc3\x91"); // Use these (omega) and (ntilde) utf-8 combinations
  60  define ('CENTER_DELIM', "\xc3\x91\xce\xa9\xc3\x91"); // as safe delimiters (not puncuation nor usual) while
  61  define ('END_DELIM',    "\xc3\x91\xc3\x91\xce\xa9"); // processing numbers ($join_numbers = false)
  62  
  63  /**
  64   * Matches Unicode character classes to exclude from the search index.
  65   *
  66   * See: http://www.unicode.org/Public/UNIDATA/UCD.html#General_Category_Values
  67   *
  68   * The index only contains the following character classes:
  69   * Lu         Letter, Uppercase
  70   * Ll         Letter, Lowercase
  71   * Lt         Letter, Titlecase
  72   * Lo         Letter, Other
  73   * Nd         Number, Decimal Digit
  74   * No         Number, Other
  75   */
  76  define('PREG_CLASS_SEARCH_EXCLUDE',
  77  '\x{0}-\x{2f}\x{3a}-\x{40}\x{5b}-\x{60}\x{7b}-\x{bf}\x{d7}\x{f7}\x{2b0}-'.
  78  '\x{385}\x{387}\x{3f6}\x{482}-\x{489}\x{559}-\x{55f}\x{589}-\x{5c7}\x{5f3}-'.
  79  '\x{61f}\x{640}\x{64b}-\x{65e}\x{66a}-\x{66d}\x{670}\x{6d4}\x{6d6}-\x{6ed}'.
  80  '\x{6fd}\x{6fe}\x{700}-\x{70f}\x{711}\x{730}-\x{74a}\x{7a6}-\x{7b0}\x{901}-'.
  81  '\x{903}\x{93c}\x{93e}-\x{94d}\x{951}-\x{954}\x{962}-\x{965}\x{970}\x{981}-'.
  82  '\x{983}\x{9bc}\x{9be}-\x{9cd}\x{9d7}\x{9e2}\x{9e3}\x{9f2}-\x{a03}\x{a3c}-'.
  83  '\x{a4d}\x{a70}\x{a71}\x{a81}-\x{a83}\x{abc}\x{abe}-\x{acd}\x{ae2}\x{ae3}'.
  84  '\x{af1}-\x{b03}\x{b3c}\x{b3e}-\x{b57}\x{b70}\x{b82}\x{bbe}-\x{bd7}\x{bf0}-'.
  85  '\x{c03}\x{c3e}-\x{c56}\x{c82}\x{c83}\x{cbc}\x{cbe}-\x{cd6}\x{d02}\x{d03}'.
  86  '\x{d3e}-\x{d57}\x{d82}\x{d83}\x{dca}-\x{df4}\x{e31}\x{e34}-\x{e3f}\x{e46}-'.
  87  '\x{e4f}\x{e5a}\x{e5b}\x{eb1}\x{eb4}-\x{ebc}\x{ec6}-\x{ecd}\x{f01}-\x{f1f}'.
  88  '\x{f2a}-\x{f3f}\x{f71}-\x{f87}\x{f90}-\x{fd1}\x{102c}-\x{1039}\x{104a}-'.
  89  '\x{104f}\x{1056}-\x{1059}\x{10fb}\x{10fc}\x{135f}-\x{137c}\x{1390}-\x{1399}'.
  90  '\x{166d}\x{166e}\x{1680}\x{169b}\x{169c}\x{16eb}-\x{16f0}\x{1712}-\x{1714}'.
  91  '\x{1732}-\x{1736}\x{1752}\x{1753}\x{1772}\x{1773}\x{17b4}-\x{17db}\x{17dd}'.
  92  '\x{17f0}-\x{180e}\x{1843}\x{18a9}\x{1920}-\x{1945}\x{19b0}-\x{19c0}\x{19c8}'.
  93  '\x{19c9}\x{19de}-\x{19ff}\x{1a17}-\x{1a1f}\x{1d2c}-\x{1d61}\x{1d78}\x{1d9b}-'.
  94  '\x{1dc3}\x{1fbd}\x{1fbf}-\x{1fc1}\x{1fcd}-\x{1fcf}\x{1fdd}-\x{1fdf}\x{1fed}-'.
  95  '\x{1fef}\x{1ffd}-\x{2070}\x{2074}-\x{207e}\x{2080}-\x{2101}\x{2103}-\x{2106}'.
  96  '\x{2108}\x{2109}\x{2114}\x{2116}-\x{2118}\x{211e}-\x{2123}\x{2125}\x{2127}'.
  97  '\x{2129}\x{212e}\x{2132}\x{213a}\x{213b}\x{2140}-\x{2144}\x{214a}-\x{2b13}'.
  98  '\x{2ce5}-\x{2cff}\x{2d6f}\x{2e00}-\x{3005}\x{3007}-\x{303b}\x{303d}-\x{303f}'.
  99  '\x{3099}-\x{309e}\x{30a0}\x{30fb}-\x{30fe}\x{3190}-\x{319f}\x{31c0}-\x{31cf}'.
 100  '\x{3200}-\x{33ff}\x{4dc0}-\x{4dff}\x{a015}\x{a490}-\x{a716}\x{a802}\x{a806}'.
 101  '\x{a80b}\x{a823}-\x{a82b}\x{d800}-\x{f8ff}\x{fb1e}\x{fb29}\x{fd3e}\x{fd3f}'.
 102  '\x{fdfc}-\x{fe6b}\x{feff}-\x{ff0f}\x{ff1a}-\x{ff20}\x{ff3b}-\x{ff40}\x{ff5b}-'.
 103  '\x{ff65}\x{ff70}\x{ff9e}\x{ff9f}\x{ffe0}-\x{fffd}');
 104  
 105  /**
 106   * Matches all 'N' Unicode character classes (numbers)
 107   */
 108  define('PREG_CLASS_NUMBERS',
 109  '\x{30}-\x{39}\x{b2}\x{b3}\x{b9}\x{bc}-\x{be}\x{660}-\x{669}\x{6f0}-\x{6f9}'.
 110  '\x{966}-\x{96f}\x{9e6}-\x{9ef}\x{9f4}-\x{9f9}\x{a66}-\x{a6f}\x{ae6}-\x{aef}'.
 111  '\x{b66}-\x{b6f}\x{be7}-\x{bf2}\x{c66}-\x{c6f}\x{ce6}-\x{cef}\x{d66}-\x{d6f}'.
 112  '\x{e50}-\x{e59}\x{ed0}-\x{ed9}\x{f20}-\x{f33}\x{1040}-\x{1049}\x{1369}-'.
 113  '\x{137c}\x{16ee}-\x{16f0}\x{17e0}-\x{17e9}\x{17f0}-\x{17f9}\x{1810}-\x{1819}'.
 114  '\x{1946}-\x{194f}\x{2070}\x{2074}-\x{2079}\x{2080}-\x{2089}\x{2153}-\x{2183}'.
 115  '\x{2460}-\x{249b}\x{24ea}-\x{24ff}\x{2776}-\x{2793}\x{3007}\x{3021}-\x{3029}'.
 116  '\x{3038}-\x{303a}\x{3192}-\x{3195}\x{3220}-\x{3229}\x{3251}-\x{325f}\x{3280}-'.
 117  '\x{3289}\x{32b1}-\x{32bf}\x{ff10}-\x{ff19}');
 118  
 119  /**
 120   * Matches all 'P' Unicode character classes (punctuation)
 121   */
 122  define('PREG_CLASS_PUNCTUATION',
 123  '\x{21}-\x{23}\x{25}-\x{2a}\x{2c}-\x{2f}\x{3a}\x{3b}\x{3f}\x{40}\x{5b}-\x{5d}'.
 124  '\x{5f}\x{7b}\x{7d}\x{a1}\x{ab}\x{b7}\x{bb}\x{bf}\x{37e}\x{387}\x{55a}-\x{55f}'.
 125  '\x{589}\x{58a}\x{5be}\x{5c0}\x{5c3}\x{5f3}\x{5f4}\x{60c}\x{60d}\x{61b}\x{61f}'.
 126  '\x{66a}-\x{66d}\x{6d4}\x{700}-\x{70d}\x{964}\x{965}\x{970}\x{df4}\x{e4f}'.
 127  '\x{e5a}\x{e5b}\x{f04}-\x{f12}\x{f3a}-\x{f3d}\x{f85}\x{104a}-\x{104f}\x{10fb}'.
 128  '\x{1361}-\x{1368}\x{166d}\x{166e}\x{169b}\x{169c}\x{16eb}-\x{16ed}\x{1735}'.
 129  '\x{1736}\x{17d4}-\x{17d6}\x{17d8}-\x{17da}\x{1800}-\x{180a}\x{1944}\x{1945}'.
 130  '\x{2010}-\x{2027}\x{2030}-\x{2043}\x{2045}-\x{2051}\x{2053}\x{2054}\x{2057}'.
 131  '\x{207d}\x{207e}\x{208d}\x{208e}\x{2329}\x{232a}\x{23b4}-\x{23b6}\x{2768}-'.
 132  '\x{2775}\x{27e6}-\x{27eb}\x{2983}-\x{2998}\x{29d8}-\x{29db}\x{29fc}\x{29fd}'.
 133  '\x{3001}-\x{3003}\x{3008}-\x{3011}\x{3014}-\x{301f}\x{3030}\x{303d}\x{30a0}'.
 134  '\x{30fb}\x{fd3e}\x{fd3f}\x{fe30}-\x{fe52}\x{fe54}-\x{fe61}\x{fe63}\x{fe68}'.
 135  '\x{fe6a}\x{fe6b}\x{ff01}-\x{ff03}\x{ff05}-\x{ff0a}\x{ff0c}-\x{ff0f}\x{ff1a}'.
 136  '\x{ff1b}\x{ff1f}\x{ff20}\x{ff3b}-\x{ff3d}\x{ff3f}\x{ff5b}\x{ff5d}\x{ff5f}-'.
 137  '\x{ff65}');
 138  
 139  /**
 140   * Matches all CJK characters that are candidates for auto-splitting
 141   * (Chinese, Japanese, Korean).
 142   * Contains kana and BMP ideographs.
 143   */
 144  define('PREG_CLASS_CJK', '\x{3041}-\x{30ff}\x{31f0}-\x{31ff}\x{3400}-\x{4db5}'.
 145  '\x{4e00}-\x{9fbb}\x{f900}-\x{fad9}');
 146  
 147  
 148  /**
 149   * This function process the text passed at input, extracting all the tokens
 150   * and scoring each one based in their number of ocurrences and relation with
 151   * some well-known html tags
 152   *
 153   * @param string  $text the text to be tokenised.
 154   * @param array   $stop_words array of utf-8 words than can be ignored in
 155   *                the text being processed. There are some cool lists of
 156   *                stop words at http://snowball.tartarus.org/
 157   * @param boolean $overlap_cjk option to split CJK text into some overlapping
 158   *                tokens is order to allow them to be searched. Useful to build
 159   *                indexes and search systems.
 160   * @param boolean $join_numbers option to join in one unique token sequences of numbers
 161   *                separated by puntuaction chars. Useful to build indexes and
 162   *                search systems.
 163   * @return array one sorted array of tokens, with tokens being the keys and scores in the values.
 164   */
 165  function tokenise_text($text, $stop_words = array(), $overlap_cjk = false, $join_numbers = false) {
 166  
 167      // Multipliers for scores of words inside certain HTML tags.
 168      // Note: 'a' must be included for link ranking to work.
 169      $tags = array('h1' => 25,
 170                    'h2' => 18,
 171                    'h3' => 15,
 172                    'h4' => 12,
 173                    'h5' => 9,
 174                    'h6' => 6,
 175                    'u' => 3,
 176                    'b' => 3,
 177                    'i' => 3,
 178                    'strong' => 3,
 179                    'em' => 3,
 180                    'a' => 10);
 181  
 182      // Strip off all ignored tags to speed up processing, but insert space before/after
 183      // them to keep word boundaries.
 184      $text = str_replace(array('<', '>'), array(' <', '> '), $text);
 185      $text = strip_tags($text, '<'. implode('><', array_keys($tags)) .'>');
 186  
 187      // Split HTML tags from plain text.
 188      $split = preg_split('/\s*<([^>]+?)>\s*/', $text, -1, PREG_SPLIT_DELIM_CAPTURE);
 189      // Note: PHP ensures the array consists of alternating delimiters and literals
 190      // and begins and ends with a literal (inserting $null as required).
 191  
 192      $tag = FALSE; // Odd/even counter. Tag or no tag.
 193      $score = 1; // Starting score per word
 194      $accum = ' '; // Accumulator for cleaned up data
 195      $tagstack = array(); // Stack with open tags
 196      $tagwords = 0; // Counter for consecutive words
 197      $focus = 1; // Focus state
 198  
 199      $results = array(0 => array()); // Accumulator for words for index
 200  
 201      foreach ($split as $value) {
 202          if ($tag) {
 203              // Increase or decrease score per word based on tag
 204              list($tagname) = explode(' ', $value, 2);
 205              $tagname = core_text::strtolower($tagname);
 206              // Closing or opening tag?
 207              if ($tagname[0] == '/') {
 208                  $tagname = substr($tagname, 1);
 209                  // If we encounter unexpected tags, reset score to avoid incorrect boosting.
 210                  if (!count($tagstack) || $tagstack[0] != $tagname) {
 211                      $tagstack = array();
 212                      $score = 1;
 213                  }
 214                  else {
 215                      // Remove from tag stack and decrement score
 216                      $score = max(1, $score - $tags[array_shift($tagstack)]);
 217                  }
 218              }
 219              else {
 220                  if (isset($tagstack[0]) && $tagstack[0] == $tagname) {
 221                      // None of the tags we look for make sense when nested identically.
 222                      // If they are, it's probably broken HTML.
 223                      $tagstack = array();
 224                      $score = 1;
 225                  }
 226                  else {
 227                      // Add to open tag stack and increment score
 228                      array_unshift($tagstack, $tagname);
 229                      $score += $tags[$tagname];
 230                  }
 231              }
 232              // A tag change occurred, reset counter.
 233              $tagwords = 0;
 234          }
 235          else {
 236              // Note: use of PREG_SPLIT_DELIM_CAPTURE above will introduce empty values
 237              if ($value != '') {
 238                  $words = tokenise_split($value, $stop_words, $overlap_cjk, $join_numbers);
 239                  foreach ($words as $word) {
 240                      // Add word to accumulator
 241                      $accum .= $word .' ';
 242                      $num = is_numeric($word);
 243                      // Check word length
 244                      if ($num || core_text::strlen($word) >= MINIMUM_WORD_SIZE) {
 245                          // Normalize numbers
 246                          if ($num && $join_numbers) {
 247                              $word = (int)ltrim($word, '-0');
 248                          }
 249  
 250                          if (!isset($results[0][$word])) {
 251                              $results[0][$word] = 0;
 252                          }
 253  
 254                          $results[0][$word] += $score * $focus;
 255                          // Focus is a decaying value in terms of the amount of unique words up to this point.
 256                          // From 100 words and more, it decays, to e.g. 0.5 at 500 words and 0.3 at 1000 words.
 257                          $focus = min(1, .01 + 3.5 / (2 + count($results[0]) * .015));
 258                      }
 259                      $tagwords++;
 260                      // Too many words inside a single tag probably mean a tag was accidentally left open.
 261                      if (count($tagstack) && $tagwords >= 15) {
 262                          $tagstack = array();
 263                          $score = 1;
 264                      }
 265                  }
 266              }
 267          }
 268          $tag = !$tag;
 269      }
 270  
 271      $res = array();
 272  
 273      if (isset($results[0]) && count($results[0]) > 0) {
 274          $res = $results[0];
 275          arsort($res, SORT_NUMERIC);
 276      }
 277  
 278      return $res;
 279  }
 280  
 281  ///
 282  /// Some helper functions (should be considered private)
 283  ///
 284  
 285  /**
 286   * Splits a string into tokens
 287   */
 288  function tokenise_split($text, $stop_words, $overlap_cjk, $join_numbers) {
 289      static $last = NULL;
 290      static $lastsplit = NULL;
 291  
 292      if ($last == $text) {
 293          return $lastsplit;
 294      }
 295      // Process words
 296      $text = tokenise_simplify($text, $overlap_cjk, $join_numbers);
 297      $words = explode(' ', $text);
 298      // Limit word length to 50
 299      array_walk($words, 'tokenise_truncate_word');
 300  
 301      // We have stop words, apply them
 302      if (is_array($stop_words) && !empty($stop_words)) {
 303          // Normalise them
 304          $simp_stop_words = explode(' ', tokenise_simplify(implode(' ', $stop_words), $overlap_cjk, $join_numbers));
 305          // Extract from the list
 306          $words = array_diff($words, $simp_stop_words);
 307      }
 308      // Save last keyword result
 309      $last = $text;
 310      $lastsplit = $words;
 311  
 312      return $words;
 313  }
 314  
 315  /**
 316   * Simplifies a string according to indexing rules.
 317   */
 318  function tokenise_simplify($text, $overlap_cjk, $join_numbers) {
 319  
 320      // Decode entities to UTF-8
 321      $text = core_text::entities_to_utf8($text, true);
 322  
 323      // Lowercase
 324      $text = core_text::strtolower($text);
 325  
 326      // Simple CJK handling
 327      if ($overlap_cjk) {
 328          $text = preg_replace_callback('/['. PREG_CLASS_CJK .']+/u', 'tokenise_expand_cjk', $text);
 329      }
 330  
 331      // To improve searching for numerical data such as dates, IP addresses
 332      // or version numbers, we consider a group of numerical characters
 333      // separated only by punctuation characters to be one piece.
 334      // This also means that searching for e.g. '20/03/1984' also returns
 335      // results with '20-03-1984' in them.
 336      // Readable regexp: ([number]+)[punctuation]+(?=[number])
 337      if ($join_numbers) {
 338          $text = preg_replace('/(['. PREG_CLASS_NUMBERS .']+)['. PREG_CLASS_PUNCTUATION .']+(?=['. PREG_CLASS_NUMBERS .'])/u', '\1', $text);
 339      } else {
 340      // Keep all the detected numbers+punctuation in a safe place in order to restore them later
 341          preg_match_all('/['. PREG_CLASS_NUMBERS .']+['. PREG_CLASS_PUNCTUATION . PREG_CLASS_NUMBERS .']+/u', $text, $foundseqs);
 342          $storedseqs = array();
 343          foreach (array_unique($foundseqs[0]) as $ntkey => $value) {
 344              $prefix = (string)(count($storedseqs) + 1);
 345              $storedseqs[START_DELIM.$prefix.CENTER_DELIM.$ntkey.END_DELIM] = $value;
 346          }
 347          if (!empty($storedseqs)) {
 348              $text = str_replace($storedseqs, array_keys($storedseqs), $text);
 349          }
 350      }
 351  
 352      // The dot, underscore and dash are simply removed. This allows meaningful
 353      // search behaviour with acronyms and URLs.
 354      $text = preg_replace('/[._-]+/', '', $text);
 355  
 356      // With the exception of the rules above, we consider all punctuation,
 357      // marks, spacers, etc, to be a word boundary.
 358      $text = preg_replace('/['. PREG_CLASS_SEARCH_EXCLUDE .']+/u', ' ', $text);
 359  
 360      // Restore, if not joining numbers, recover the original strings
 361      if (!$join_numbers) {
 362          if (!empty($storedseqs)) {
 363              $text = str_replace(array_keys($storedseqs), $storedseqs, $text);
 364          }
 365      }
 366  
 367      return $text;
 368  }
 369  
 370  /**
 371   * Basic CJK tokeniser. Simply splits a string into consecutive, overlapping
 372   * sequences of characters (MINIMUM_WORD_SIZE long).
 373   */
 374  function tokenise_expand_cjk($matches) {
 375  
 376      $str = $matches[0];
 377      $l = core_text::strlen($str);
 378      // Passthrough short words
 379      if ($l <= MINIMUM_WORD_SIZE) {
 380          return ' '. $str .' ';
 381      }
 382      $tokens = ' ';
 383      // FIFO queue of characters
 384      $chars = array();
 385      // Begin loop
 386      for ($i = 0; $i < $l; ++$i) {
 387          // Grab next character
 388          $current = core_text::substr($str, 0, 1);
 389          $str = substr($str, strlen($current));
 390          $chars[] = $current;
 391          if ($i >= MINIMUM_WORD_SIZE - 1) {
 392              $tokens .= implode('', $chars) .' ';
 393              array_shift($chars);
 394          }
 395      }
 396      return $tokens;
 397  }
 398  
 399  /**
 400   * Helper function for array_walk in search_index_split.
 401   * Truncates one string (token) to MAXIMUM_WORD_SIZE
 402   */
 403  function tokenise_truncate_word(&$text) {
 404  
 405      $text = core_text::substr($text, 0, MAXIMUM_WORD_SIZE);
 406  }