"Knuth-Morris-Pratt algorithm" meaning in English

{
  "etymology_text": "The algorithm was conceived in 1970 by Donald Knuth and Vaughan Pratt, and independently by James H. Morris.",
  "forms": [
    {
      "form": "the Knuth-Morris-Pratt algorithm",
      "tags": [
        "canonical"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "def": "1"
      },
      "expansion": "the Knuth-Morris-Pratt algorithm",
      "name": "en-proper noun"
    }
  ],
  "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": [
        "A linear-time algorithm that searches for occurrences of one text string within another, employing the observation that when a mismatch occurs, the search string itself embodies sufficient information to determine where the next match could begin, thus reducing the number of possible match locations that must be checked."
      ],
      "id": "en-Knuth-Morris-Pratt_algorithm-en-name-z9z9fdnk",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "linear-time",
          "linear time"
        ],
        [
          "search",
          "search"
        ],
        [
          "occurrence",
          "occurrence"
        ],
        [
          "text",
          "text"
        ],
        [
          "string",
          "string"
        ],
        [
          "mismatch",
          "mismatch"
        ]
      ],
      "raw_glosses": [
        "(computing theory) A linear-time algorithm that searches for occurrences of one text string within another, employing the observation that when a mismatch occurs, the search string itself embodies sufficient information to determine where the next match could begin, thus reducing the number of possible match locations that must be checked."
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "wikipedia": [
        "Knuth-Morris-Pratt algorithm"
      ]
    }
  ],
  "word": "Knuth-Morris-Pratt algorithm"
}

{
  "etymology_text": "The algorithm was conceived in 1970 by Donald Knuth and Vaughan Pratt, and independently by James H. Morris.",
  "forms": [
    {
      "form": "the Knuth-Morris-Pratt algorithm",
      "tags": [
        "canonical"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "def": "1"
      },
      "expansion": "the Knuth-Morris-Pratt algorithm",
      "name": "en-proper noun"
    }
  ],
  "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": [
        "A linear-time algorithm that searches for occurrences of one text string within another, employing the observation that when a mismatch occurs, the search string itself embodies sufficient information to determine where the next match could begin, thus reducing the number of possible match locations that must be checked."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "linear-time",
          "linear time"
        ],
        [
          "search",
          "search"
        ],
        [
          "occurrence",
          "occurrence"
        ],
        [
          "text",
          "text"
        ],
        [
          "string",
          "string"
        ],
        [
          "mismatch",
          "mismatch"
        ]
      ],
      "raw_glosses": [
        "(computing theory) A linear-time algorithm that searches for occurrences of one text string within another, employing the observation that when a mismatch occurs, the search string itself embodies sufficient information to determine where the next match could begin, thus reducing the number of possible match locations that must be checked."
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "wikipedia": [
        "Knuth-Morris-Pratt algorithm"
      ]
    }
  ],
  "word": "Knuth-Morris-Pratt algorithm"
}