"Boyer-Moore-Horspool algorithm" meaning in English

{
  "etymology_text": "It was published by Nigel Horspool in 1980, and based on an earlier (1977) algorithm developed by Robert S. Boyer and J. Strother Moore.",
  "forms": [
    {
      "form": "the Boyer-Moore-Horspool algorithm",
      "tags": [
        "canonical"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "def": "1"
      },
      "expansion": "the Boyer-Moore-Horspool algorithm",
      "name": "en-prop"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Theory of computing",
          "orig": "en:Theory of computing",
          "parents": [
            "Computer science",
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "An algorithm for finding substrings that trades space for time in order to obtain an average-case time complexity of O(n) on random text."
      ],
      "id": "en-Boyer-Moore-Horspool_algorithm-en-name-r1RuKtJs",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "substring",
          "substring"
        ],
        [
          "time complexity",
          "time complexity"
        ]
      ],
      "raw_glosses": [
        "(computing theory) An algorithm for finding substrings that trades space for time in order to obtain an average-case time complexity of O(n) on random text."
      ],
      "synonyms": [
        {
          "word": "Horspool's algorithm"
        }
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "Boyer-Moore-Horspool algorithm"
}

{
  "etymology_text": "It was published by Nigel Horspool in 1980, and based on an earlier (1977) algorithm developed by Robert S. Boyer and J. Strother Moore.",
  "forms": [
    {
      "form": "the Boyer-Moore-Horspool algorithm",
      "tags": [
        "canonical"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "def": "1"
      },
      "expansion": "the Boyer-Moore-Horspool algorithm",
      "name": "en-prop"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English proper nouns",
        "English uncountable nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Theory of computing"
      ],
      "glosses": [
        "An algorithm for finding substrings that trades space for time in order to obtain an average-case time complexity of O(n) on random text."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "substring",
          "substring"
        ],
        [
          "time complexity",
          "time complexity"
        ]
      ],
      "raw_glosses": [
        "(computing theory) An algorithm for finding substrings that trades space for time in order to obtain an average-case time complexity of O(n) on random text."
      ],
      "synonyms": [
        {
          "word": "Horspool's algorithm"
        }
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "Boyer-Moore-Horspool algorithm"
}