Scribd
Upload
74 views10 pages

Chomsky Normal Form CNF Explained

Uploaded by

ISHAN AMRIT SRIVASTAVA
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
74 views10 pages

Chomsky Normal Form CNF Explained

Uploaded by

ISHAN AMRIT SRIVASTAVA
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 10

Chomsky Normal Form (CNF) Explained

Chomsky Normal Form (CNF) is a standardized form for representing context-free grammars (CFGs). It's
widely used in natural language processing (NLP) and computational linguistics. CNF simplifies CFG analysis
and processing. This presentation will guide you through the intricacies of CNF and its applications.

Reg. No. 22BCE10382


Name: ISHAN AMRIT SRIVASTAVA
Understanding Chomsky Normal Form (CNF)
What is CNF? Key CNF Rules

Chomsky Normal Form (CNF) is a way to represent CNF requires production rules to satisfy these
context-free grammars (CFGs) where all production conditions: (1) The start symbol can produce the
rules follow specific formats. The rules in CNF make empty string (ε), (2) A non-terminal can produce
it easier to parse and analyze language. two other non-terminals, (3) A non-terminal can
produce a terminal.
Converting a CFG to CNF
1 2 3 4

Step 1: Eliminate Step 2: Remove Step 3: Eliminate Step 4: Eliminate


Start Symbol from Null, Unit, and Terminals from RHS with More
RHS Useless RHS Than Two Non-
If the start symbol (S) is If a terminal symbol
Productions terminals
on the right-hand side Eliminate productions appears on the right- If a production rule has
of any production rule, that produce the empty hand side of a more than two non-
introduce a new start string (ε), unit production rule with terminals on the right-
symbol (S1) that productions, and other non-terminals or hand side, decompose it
produces the original useless productions. terminals, replace the into a series of
start symbol (S). These productions can terminal with a new productions with only
be removed without non-terminal that two non-terminals on
affecting the language produces the terminal. the right-hand side.
generated by the
grammar.
Example: Converting a CFG to CNF

Original CFG Step 1: New Start Symbol Step 2: Remove Null Step 3: Remove Unit
Productions Productions
S → a | aA | B, S1 → S,
S1 → S, S1 → a | aA | Aa | b,
A → aBB | ε, S → a | aA | B,
S → a | aA | B, S → a | aA | Aa | b,
B → Aa | b A → aBB | ε,
A → aBB, A → aBB,
B → Aa | b
B → Aa | b | a B → Aa | b | a

Step 4: Eliminate Terminals from RHS Step 5: Eliminate RHS with More Than Two Non-terminals
S1 → a | XA | AX | b, S1 → a | XA | AX | b,

S → a | XA | AX | b, S → a | XA | AX | b,

A → XBB, A → RB,

B → AX | b | a, X → a B → AX | b | a,

X → a,

R → XB
Benefits of Chomsky
Normal Form

1 Efficient Parsing 2 Simplified Analysis


CNF simplifies parsing CNF simplifies the
algorithms, allowing for analysis of grammar
faster and more rules, making it easier
efficient processing of to understand the
language. relationships between
symbols and the
language they
generate.
3 Standardization
CNF provides a standardized representation of CFGs,
allowing for easier comparison and exchange of
grammar information.
Applications of CNF in Natural Language Proce
Speech Recognition Machine Translation Text Analysis
CNF is used in speech CNF is applied in machine CNF is employed in text
recognition systems to parse translation systems to analyze analysis tasks like sentiment
spoken language into grammatical structures in analysis, topic modeling, and
meaningful units, allowing different languages, named entity recognition,
computers to understand facilitating the translation of enabling computers to extract
spoken commands and text and speech between valuable information from text.
conversations. languages.
Advantages of Using CNF

1 Efficiency 2 Simplicity 3 Standardization


CNF grammars are more CNF grammars are simpler CNF provides a standardized
efficient to parse, leading to to analyze and understand, representation for CFGs,
faster and more efficient making them more facilitating collaboration and
language processing. manageable for linguists exchange of grammar
and computer scientists. information.
Challenges in Using CNF
1 Complexity of Conversion2 Increased Grammar Size 3 Ambiguity
Converting a CFG to CNF The conversion process may CNF conversion might
can be a complex process, lead to an increase in the introduce ambiguity in the
especially for large and number of production rules, grammar, making it difficult
complex grammars. making the grammar larger to determine the intended
and potentially less meaning of certain
efficient. sentences.
Real-World Applications of CNF

1 2 3
Voice Assistants Chatbots Machine Translation
Amazon Alexa, Google Assistant, Chatbots rely on CNF to Google Translate and DeepL
and Apple Siri utilize CNF for understand user inputs and Translator leverage CNF to
parsing spoken language and provide relevant responses, analyze grammatical structures
responding accordingly. mimicking human-like and facilitate accurate translation
conversations. between languages.
Key Takeaways and Future Directions
Chomsky Normal Form (CNF) is an invaluable tool in natural language processing, simplifying grammar
analysis and processing. While CNF presents some challenges, its benefits outweigh the drawbacks. Future
research in CNF aims to improve conversion algorithms, reduce grammar size, and address ambiguity issues.

You might also like