01

AUTOMATIC CODE
COMMENTS
GENERATION BY
AARUSHI DUA 2K20/CO/005
ABHEEK KAUSHAL 2K20/CO/017
ANUBHAV GUPTA 2K20/CO/085
02

TODAY' 1
CODE CLONE DETECTION

PRESENT 2
3
AUTOMATIC COMMENT GENERATION ALGORITHMS

COMMENT EXTRACTION

ATION 4
5
RNN BASED ALGORITHMS

COMMON NLP TOOL

INCLUDES 6 GLOBAL ENCODER

 CHALLENGES
comment generation.
The npl is weekly structured while the
programming languages are formal
languages and source code written in
them are unambiguous and structured.
This is the main challenge for the rnn
model.
There are several challenges in code
In natural language vocabulary is limited to
the most common words and the words
outside are called unknown words. While
in coding vocabulary consists of keywords,
operators and identifiers so that data set
which stores the unique tokens after
replacing numerals and string becomes
very huge.
 03

CODE CLONE
DETECTION INTRODUCTION

Code clone detection based comment generation algorithms are concerned with utilizing code
clone detection technique to find similar code in a database, and the corresponding comments
of the matched code or discussion text are viewed as comments for the target code.

ALGORITHM TOKENISATION CONFIGURATION

Token-based code clone detection tools can
achieve a time complexity of O(n ∗ m) with
token-based matching, where n is the number
of lines
of code in the input project; and m is the
number of lines of code in the database. The
token-based matching algorithms
are usually more efficient than tree-based
matching algorithms.
Tokenization of the source code is based on
the serialization of AST nodes. Utilized
Eclipse AST-Parser to obtain the AST of the
Java source code. ASTParser cannot fully
resolve variable type bindings of code
elements unless we manually compile each
project in the database, which is infeasible
because there are 1,005 Java projects in
GitHub.
The tool recognizes code clones with three
or more statements, which is a common
threshold similar to other previous work.
The tool excludes two types of statements
including return statement and switch
statement. Return statement is less
meaningful, and switch statement can have
many overlapped segments that introduce
false positives
04

JavaDoc Comment

COMMENT JavaDoc comment is delimited by

/**...*/. It only appears in front of a

EXTRACTIONSingle-line
public class, or a public/protected
method/variable.

Comment
Single-line comment starts with a
double slash (//). In the previous Block Comment
work, we were able to extract full
Block Comment: Block
sentences easily from Stack
comment is delimited by /*...*/.
Overflow posts, which is not the
It is similar to the JavaDoc
case in this work with single-line
comment except it can appear
comments.
anywhere in the source code.
05

RNN BASED
BRIEF
INTRODUCTION
ALGORITHMS
Encoder-Decoder framework In deep neural network based comment generation
systems encoder-decoder structure, also known as sequence to sequence model, is
generally exploited. In the structure of encoder-decoder, the encoder
plays the role of encoding source code into a fixed-sized
vector; and the decoder is responsible for decoding source
code vector and predicting comments for source code. The
difference among various encoder-decoder structures lies in the form of inputs and the
type of neural network
06

COMMON NLP TOOL

Part-of-Speech (POS) Tagging is used for
assigning parts of speech, such as noun, verb,
adjective, etc. to each word observed in the
target text. There are several tools available for
this, one commonly used tool is the Stanford
Log-linear Part-Of-Speech Tagger14 .
Language Parsers are used to work out the
grammatical structure of the sentence. For
example, find which words in the sentence are
subject and object to a noun or identify phrases
in sentences.
07

GLOBAL
GRAPH CONSTRUCTION - We aim to exploit the information
available at the class level. To do so, we connect the target

ENCODER
function to all other functions in the same class to form a class-
level contextual graph.

VERTEX INITIALIZATION - To encode each vertex in the graph

to a hidden vector, we apply the local encoder to each individual
function and concatenate the last hidden states in both
directions as the initial vertex representation.

Graph Attention Network - We feed the initial state of each

vertex into a GAT, which applies different weights to different
nodes when exchanging information with neighbors. In the 1th
layer of the GAT network, each vertex sends its own current
hidden state to all neighbors .
THANKYOU