Last Updated
：2025/11/30
Chomsky Normal Form
Noun
uncountable
Japanese Meaning
ショムスキー正規形：計算理論における文脈自由文法の一形式であり、各生成規則の右辺が単一の終端記号または二つの非終端記号のみで構成されるもの
Sense（1）
Sense（2）
(computing
theory)
A
context-free
grammar
in
which
the
right
hand
side
of
any
production
rule
consists
of
either
one
terminal
symbol
or
two
non-terminal
symbols
(neither
of
which
is
the
start
symbol)
or
the
epsilon
(i.e.
null
string)
symbol,
but
only
if
the
left
hand
side
is
the
start
symbol.
(Note:
this
is
the
full-fledged
version,
whereas
the
previous
definition
may
be
said
to
be
defining
Chomsky
reduced
form.)
Quizzes for review
(computing theory) A context-free grammar in which the right hand side of any production rule consists of either one terminal symbol or two non-terminal symbols.
音声機能が動作しない場合はこちらをご確認ください
See correct answer
Chomsky Normal Form
To simplify parsing algorithms, we first convert the grammar into Chomsky Normal Form and then run the parser.
See correct answer
To simplify parsing algorithms, we first convert the grammar into Chomsky Normal Form and then run the parser.
音声機能が動作しない場合はこちらをご確認ください
English - English
Word Edit Setting
- Users who have edit permission for words - All Users
- Screen new word creation
- Screen word edits
- Screen word deletion
- Screen the creation of new headword that may be duplicates
- Screen changing entry name
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Sentence Edit Setting
- Users who have edit permission for sentences - All Users
- Screen sentence deletion
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Quiz Edit Setting
- Users who have edit permission for quizzes - All Users
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
