Last Updated：2025/12/04
(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.
音声機能が動作しない場合はこちらをご確認ください
See correct answer
Knuth-Morris-Pratt algorithm
Edit Histories（0）
Source Word
Knuth-Morris-Pratt algorithm
Proper noun
(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.
Japanese Meaning
Knuth-Morris-Prattアルゴリズムは、文字列探索において、あるテキスト内から指定されたパターン文字列の出現箇所を効率的に検索する線形時間アルゴリズムです。 / このアルゴリズムは、不一致が生じた場合にパターン文字列自体の情報を利用して次の比較位置を決定することで、検査する候補箇所の数を削減し、効率的な文字列探索を実現します。
Sense（1）
(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.
（ canonical ）
