Automatic detection of pseudocodes in scholarly documents using machine learning

Suppawong Tuarob, Sumit Bhatia, Prasenjit Mitra, C. Lee Giles

Research output: Contribution to journalConference article

25 Citations (Scopus)

Abstract

A significant number of scholarly articles in computer science and other disciplines contain algorithms that provide concise descriptions for solving a wide variety of computational problems. For example, Dijkstra's algorithm describes how to find the shortest paths between two nodes in a graph. Automatic identification and extraction of these algorithms from scholarly digital documents would enable automatic algorithm indexing, searching, analysis and discovery. An algorithm search engine, which identifies pseudocodes in scholarly documents and makes them searchable, has been implemented as a part of the CiteSeerX suite. Here, we illustrate the limitations of start-of-the-art rule based pseudocode detection approach, and present a novel set of machine learning based techniques that extend previous methods.

Original languageEnglish (US)
Article number6628716
Pages (from-to)738-742
Number of pages5
JournalProceedings of the International Conference on Document Analysis and Recognition, ICDAR
DOIs
StatePublished - Dec 11 2013
Event12th International Conference on Document Analysis and Recognition, ICDAR 2013 - Washington, DC, United States
Duration: Aug 25 2013Aug 28 2013

Fingerprint

Learning systems
Search engines
Computer science

All Science Journal Classification (ASJC) codes

  • Computer Vision and Pattern Recognition

Cite this

@article{009db61999314ce988a9d0317b24d929,
title = "Automatic detection of pseudocodes in scholarly documents using machine learning",
abstract = "A significant number of scholarly articles in computer science and other disciplines contain algorithms that provide concise descriptions for solving a wide variety of computational problems. For example, Dijkstra's algorithm describes how to find the shortest paths between two nodes in a graph. Automatic identification and extraction of these algorithms from scholarly digital documents would enable automatic algorithm indexing, searching, analysis and discovery. An algorithm search engine, which identifies pseudocodes in scholarly documents and makes them searchable, has been implemented as a part of the CiteSeerX suite. Here, we illustrate the limitations of start-of-the-art rule based pseudocode detection approach, and present a novel set of machine learning based techniques that extend previous methods.",
author = "Suppawong Tuarob and Sumit Bhatia and Prasenjit Mitra and Giles, {C. Lee}",
year = "2013",
month = "12",
day = "11",
doi = "10.1109/ICDAR.2013.151",
language = "English (US)",
pages = "738--742",
journal = "Proceedings of the International Conference on Document Analysis and Recognition, ICDAR",
issn = "1520-5363",

}

TY - JOUR

T1 - Automatic detection of pseudocodes in scholarly documents using machine learning

AU - Tuarob, Suppawong

AU - Bhatia, Sumit

AU - Mitra, Prasenjit

AU - Giles, C. Lee

PY - 2013/12/11

Y1 - 2013/12/11

N2 - A significant number of scholarly articles in computer science and other disciplines contain algorithms that provide concise descriptions for solving a wide variety of computational problems. For example, Dijkstra's algorithm describes how to find the shortest paths between two nodes in a graph. Automatic identification and extraction of these algorithms from scholarly digital documents would enable automatic algorithm indexing, searching, analysis and discovery. An algorithm search engine, which identifies pseudocodes in scholarly documents and makes them searchable, has been implemented as a part of the CiteSeerX suite. Here, we illustrate the limitations of start-of-the-art rule based pseudocode detection approach, and present a novel set of machine learning based techniques that extend previous methods.

AB - A significant number of scholarly articles in computer science and other disciplines contain algorithms that provide concise descriptions for solving a wide variety of computational problems. For example, Dijkstra's algorithm describes how to find the shortest paths between two nodes in a graph. Automatic identification and extraction of these algorithms from scholarly digital documents would enable automatic algorithm indexing, searching, analysis and discovery. An algorithm search engine, which identifies pseudocodes in scholarly documents and makes them searchable, has been implemented as a part of the CiteSeerX suite. Here, we illustrate the limitations of start-of-the-art rule based pseudocode detection approach, and present a novel set of machine learning based techniques that extend previous methods.

UR - http://www.scopus.com/inward/record.url?scp=84889575897&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84889575897&partnerID=8YFLogxK

U2 - 10.1109/ICDAR.2013.151

DO - 10.1109/ICDAR.2013.151

M3 - Conference article

AN - SCOPUS:84889575897

SP - 738

EP - 742

JO - Proceedings of the International Conference on Document Analysis and Recognition, ICDAR

JF - Proceedings of the International Conference on Document Analysis and Recognition, ICDAR

SN - 1520-5363

M1 - 6628716

ER -