Classification of Input document or text in
different Indian IT laws using Machine
Learning Techniques
Akshay Paliwal , Rupam Saxena and Tamanna Sharma
Jaypee Institute of Information Technology
Abstract - In this paper , we study how section
classification can help individuals to
understand various acts and laws that can be
applied on a legal document using n grams
model. Due to the exponential growth of
information there is a need for automated tools,
which can process and understand such texts.
Our model will allow users to use a legal
document such as an FIR and find the legal
section broken by the accused ,thus helping a
naive person to understand law.
Index Terms - Document classification;
Information extraction ; Classifiers
INTRODUCTION
Classifying legal documents is an important issue
faced by organizations and individuals, and it
necessitates the need to devise mechanisms that
intelligently classify and deal with the problem.
Text classification is an example of supervised
machine learning task since a labelled data set
containing text documents and their labels is used
for train a classifier. An end-to-end text
classification pipeline is composed of three main
components:
1. Data set Preparation:The first step is the
Data set Preparation step which includes the
process of loading a data set and performing basic
preprocessing. The data set is then splitted into
train and validation sets.
2. Feature Engineering:The next step is the
Feature Engineering in which the raw data set is
transformed into flat features which can be used in
a machine learning model. This step also includes
the process of creating new features from the
existing data.
3.Model Training:The final step is the Model
Building step in which a machine learning model
is trained on a labelled data set.
4.Improve Performance of Text Classifier:In this
article, we will also look at the different ways to
improve the performance of text classifiers.
Our model will take a legal text as an input and
then classify different Indian it laws applicable on
it using machine learning and finding the accuracy
of different algorithms used for classifying the
legal text.
We will be focusing on classifying the sections of
laws applicable on a document using Random
Forest and Neural network.
 PROBLEM STATEMENT
Classification of input document or a text file in
different Indian IT laws using Machine Learning
Techniques.
An input legal document will be classified on
different sections of IT laws it would come under.
METHODOLOGY
This section describes the methodology created to
extract the required information from the PDF
files, Data extraction and classify the documents.
I. DATA EXTRACTION
Data extraction is used for extracting data from
the web. Here we are using data extraction to
creat3 a data set upon which we will train our
model for prediction of laws
All data used in the research is available on the
Creating a data set for our classifier by scraping
data from the site "INDIAN KANOON.ORG".
II. DATA PREPROCESSING
The text data cannot be directly input into our
proposed model so it needs to be preprocessed
before using the data obtained by web scraping.
Data preprocessing will include removal of
punctuations , extra white spaces present in the
text special characters and leave only alpha
numeric values. Also all data must be converted
into lower case.
III.FEATURE EXTRACTION
Before training the model we need to design the
features to obtain score of different text present in
legal document. . As all legal documents have a
fixed format therefore it is possible for our model
to classify under w hich sections the legal
document can be classified.
Features are based on the sections in the
constitution.
N-grams - Using this method text documents are
divided into character sets (sub strings) of length n
in so much as the first. Second sub string contains
all characters of the document from 2nd to (n+1)-
th inclusive. This principle is used throughout the
whole text document, the last substring containing
characters from (k−n+1)-th to k-th, where k is the
number of characters in the text document. This
process is applied to each text document and a
dictionary of unique substrings (considered as
terms) of length n (n-grams) is generated.
Character sets is one of several ways to use n-
grams sub string contains all the characters of the
documents from the 1st to n- th inclusive.
IV. TEXT CLASSIFIERS
We are using two algorithms to classify the legal
text and hence identifying under which section of
laws it comes under.
1.Random forest algorithm - is a supervised
classification algorithm. We can see it from its
name, which is to create a forest by some way and
make it random. There is a direct relationship
between the number of trees in the forest and the
results it can get: the larger the number of trees,
the more accurate the result . Random forests are a
way of averaging multiple deep decision trees,
trained on different parts of the same training set,
with the goal of reducing the variance.
The training algorithm for random forests applies
the general technique of bootstrap aggregating, or
bagging, to tree learners. This bootstrapping
procedure leads to better model performance
because it decreases the variance of the model,
without increasing the bias. This means that while
the predictions of a single tree are highly sensitive
to noise in its training set, the average of many
trees is not, as long as the trees are not correlated.
Simply training many trees on a single training set
would give strongly correlated trees (or even the
same tree many times, if the training algorithm is
deterministic); bootstrap sampling is a way of de-
correlating the trees by showing them different
training sets. . Random forests differ in only one
way from this general scheme: they use a modified
tree learning algorithm that selects, at each
candidate split in the learning process, a random
subset of features.
input and the output layer corresponding to words
of the given input vector by looking up in the
tables owned by learning nodes. The output layer
generates the categorical scores indicating
memberships of the string vector in categories as
the output.

Suppose we have a calibration set C = {C1,….,Cn}

with Ci≡ (xi,yi) and an independent test case
C0with predictor x0, the following steps can be
carried out:

Sample the calibration set C with

replacement to generate bootstrap
resamples B1,…,BM

For each re sample Bm, m = 1, …, M, grow a Figure 1. The architecture of neural network
regression tree Tm. For predicting the test case C0 classifier
with covariate x0, the predicted value by the whole
RF is obtained by combining the results given by
individual trees.
The problem can be written as Text categorization is defined as follows.
1.The number of the input nodes should be
1M∑Mm=1f^∗m(x0). identical to the dimension of string vectors
representing documents. This layer receives an
input vector given as a string vector, so each node
corresponds to each word in the string vector.
2. Neural network - The proposed neural network
2.The number of the learning nodes should be
follows Perceptron in that synaptic weights are
identical to the number of predefined categories.
connected directly between the input layer and the
Nodes of this layer own tables corresponding to
output layer, and the weights are updated only
predefined categories, and determine weights
when each training example is misclassified. The
between the input and output layer, to each word
learning layer given as an additional layer to the
in the input vector.
input and the output layer is different from the
3. The number of the output nodes should be
hidden layer of back propagation with respect to
identical to the number of predefined categories.
its role. The learning layer determines synaptic
weights between the input and the output layer by
This layer generates categorical scores as the
referring to the tables owned by learning nodes.
output, and they correspond to predefined
The learning of neural network classifier refers to
categories.
the process of optimizing weights stored in the
tables the architecture of the neural network. It
consists of the three layers: input layer, output
layer, and learning layer. The input layer receives
an input vector given as a string vector. The MODEL DESIGN
learning layer determines weights between the

The classification process consists of three steps
that are shown in Fig. 2.
Figure 2. Process of text classification
1. Web scraping for Desired Data: Creating a
data set for our classifier by scraping data from the
site "INDIAN KANOON.ORG".
2. Cleaning and Preprocessing Data: Data is
cleaned and preprocessed that is all symbols, extra
spaces and unwanted signs are removed.
3.Text Selection: All the useful text is selected
from the document.
4.Tokenization: Data is tokenized, filtered and
stemmed in order to create a unique list of stems
and their frequencies.
5.Model Train: Training the data using various
classification techniques.
Critical review of research papers
In order to implement “Classification of Input
document or text in different Indian IT laws using
Machine Learning Techniques ” effectively we
studied various research papers that matched with
the requirements of our topic. We extensively
covered papers that talked about data cleaning and
preprocessing ,different types of text classifiers.
We now understand that one algorithm alone
cannot fulfill our requirement .At different levels
we are using multiple
algorithms to get more refined and accurate data.
In order to match strings we are using Lcs
Algorithm and then applying N gram algorithm
for designing features which will be used to train
our model. We gathered deeper knowledge of
already known classification techniques (KNN
and NAÏVE BAYES) and have found that moving
to higher classification algorithms gives better
results. We use two algorithms – First by Random
Forest Classifier and second using Convolution
neural networks.
Furthermore we plan to work upon improving the
results and accuracy of these algorithms by
studying the various new models and
advancements that are happening in the fields of
these algorithms.
CONCLUSION
Finally we developed a model which can classify a
legal document and identify the different legal
section applicable on it.
Classification of legal text will help in decreasing
the human effort of scrolling down each legal
document for finding the constitutional sections
that apply to it. It will be of great help to
lawyers,policeman(for filing charge sheets) and
layman (to cross check what their legal advisers
says is correct).The main idea is to implement a
commercially available legal tool to help classify
documents according to the constitutional section.
ACKNOWLEDGMENT
The authors would like to thank Dr. Bharat Gupta ,
our project supervisor, for fruitful discussion on
information extraction and research methods
which helped us to complete the project.
REFERENCES
[1] M. Krendzelak and F. Jakab, Text
Categorization with Machine Learning and
Hierarchical Structures,IEEE International
conference on Computer Science 2016
[2] Kankawin Kowsrihawat and Peerapon
Vateekul ,An Information Extraction Framework
for Legal Documents:a Case Study of Thai
Supreme Court Verdicts IEEE Joint Conference
on Computer Science and Software Engineering
2015
[3]Haiyi Zhang and Di Li, Naïve Bayes Text
Classifier ,IEEE International Conference on
Granular Computing 2007
[4]Lingzhong Wang and Xia Li ,An improved
KNN algorithm for text classification: ,IEEE
International Conference on Information,
Networking and Automation 2010.
[5]Lin Li, Linlong Xiao, Nanzhi Wang, Guocai
Yang Text Classification Method Based on
Convolution Neural Network,3rd IEEE
International Conference on Computer and
Communications 2017.
[6]R, Krishnamoorthy ,S. Sreedhar Kumar,
Basavaraj Neelagund, A New Approach for Data
Cleaning Process, IEEE International Conference
on Recent Advances and Innovations in
Engineering(2014)
[7]Fengxi Song, Qinglong Chen, Zhongwei
Guo ,Xiumei Gao, Mathematical Analysis on
Weight Vectors in Text Classification, IEEE at
Third Global Congress on Intelligent System
2012.
[8]Guo Aizhang,Yang Tao, Based on Rough Sets
and the Associated Analysis of KNN Text
Classification Research ,IEEE International
Conference on Recent Advances and Innovations
in Engineering 2014
[9]Neethu KS , Jyothis TS , Jithin dev , Text
Classification Using KM-ELM Classifieir,
International Conference on Circuit, Power and
Computing Technologies [ICCPCT] 2016
[10]Sotarat Thammaboosadee, An elements-based
multi-stage charges identification model for
textual criminal cases, Third Global Congress on
Intelligent Systems,2016
[11]Octavia-Maria S¸ulea, Marcos Zampieri,
ShervinMalmasi, Mihaela Vela, Liviu P. Dinu,
Josef van Genabith, Exploring the Use of Text
Classification in the Legal Domain, German
Research Center for Artificial Intelligence IEEE
2017.
[12]Feng He and Xiaoqing Ding, Improving Naive
Bayes Text Classifier Using Smoothing
Methods , Springer-Verlag Berlin Heidelberg
2007.
[13]Leo Rizky Julian, Friska Natalia, The Use of
Web Scrapping In Computer Parts and Assembly
Price Comparison , IEEE Conference for
Departments of Information System 2010.
[14]ZengminGeng, Jujian Zhang, Xuefei Li,
Jianxia Du, Research on Domain-specific Text
Classifier,World Congress on Computer Science
and Information Engineering 2009.
[15] Yinglong Diao, Ke-yan Liu, XiaoliMeng,
Xueshun Ye, Kaiyuan He , A Big Data Online
Cleaning Algorithm Based on Dynamic Outlier
Detection,International Conference on Cyber-
Enabled Distributed Computing and Knowledge
Discovery 2015.
[16]Jiamei Liu,Suping Wu , Research on Longest
Common Subsequence Fast Algorithm 2016
[17]Ghulam Mujtaba, Liyana Shuib, Ram Gopal
Raj, Nahid Majeed and Mohammed Ali Al-gar-
adi, Email Classification Research Trends: Review
and Open Issues 2017
[18]Juan C. Rendón-Miranda, Julia Y. Arana-
Llanes, Juan G.González-Serna and Nimrod
González-Franco, Automatic classification of
scientific papers in PDF for populating ontologies,
IEEE International Conference 2016
[19]Ying Li, Sharon Lipsky Gorman, Noémie
Elhadad , Section Classification in Clinical Notes
using Supervised Hidden Markov Model 2016
[20]Vytautas Mickevicius,Tomas Krilavicius
Vaidas Morkevicius ,Classification of Short Legal
Lithuanian Texts IEEE International Conference
2016
[21]Nguyen Truong Son, Nguyen Le Minh, Ho
Bao Quoc, Akira Shimazu,Recognizing logical
parts in legal texts using neural architecture,Eighth
International Conference on Knowledge and
Systems Engineering (KSE)
[22]Zhang Yongan, She Guiqing, Research on
Proofreading System of Judicial Documents Based
on N-gram Model ,Economics & Management
School of Beijing University of Technology
[23]Gaurav Kawade Santosh Sahu Sachin
Upadhye Nilesh Korde Manish Motghare, An
Analysis on Computation of Longest Common
Subsequence Algorithm , Department of Computer
Application
Shri Ramdeobaba College of Engineering and
Management
[24]Cai-zhi Liu, Yan-xiu Sheng, Zhi-qiang Wei1
And Yong-Quan Yang ,Research of Text
Classification Based on Improved TF-IDF
Algorithm, College of Information Science &
Engineering, Ocean University of China, Qingdao,
China
[25]Liliya Demidova, Maksim Egin,Improving the
Accuracy of the SVM Classification using the
Parzen & classifier , Ryazan State Radio
Engineering University, Gagarin Str., 59/1,
Ryazan, Russian Federation
[26]Muhammad Diaphan Nizam Arusada, Novi
Amalia Santika Putri, Training Data Optimization
Strategy for Multiclass Text Classification,School
of Economics and Business
Telkom University Bandung, Indonesia
[27]Sveinn R. Joelsson, Jon Atli Benediktsson and
Johannes R. Sveinsson, feature selection for
morphological feature extraction using random
forests ,Department of Electrical and Computer
Engineering, University of Iceland
[28]Yuan Xie, Tao Zhang, Feature Extraction
Based on DWT and CNN for Rotating Machinery
Fault Diagnosis ,Department of Automation,
School of Information Science and Technology,
Tsinghua University, Beijing
[29]M.Priya, Dr.R.Kalpana and T.Srisupriya,
Hybrid Optimization Algorithm Using N Gram
Based Edit Distance ,International Conference on
Communication and Signal Processing
[30]Yan-Shi Dong, Ke-Song Han, A Comparison
of Several Ensemble Methods for Text
Categorization , Shanghai Jiao Tong University,
Motorola Labs, China Research Center
AUTHOR INFORMATION
Akshay Paliwal, student of Jaypee Institute of
Information Technology – Computer Science
Engineering, 15103006.
Rupam Saxena, student of Jaypee Institute of
Information Technology – Computer Science
Engineering, 15103019.
Tamanna Sharma, student of Jaypee Institute of
Information Technology – Computer Science
Engineering, 15103027.