We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Article:Sentence Boundary Disambiguation: A User Friendly Approach

by Pritam Singh Negi, M.M.S. Rauthan, H.S. Dhami
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 7 - Number 8
Year of Publication: 2010
Authors: Pritam Singh Negi, M.M.S. Rauthan, H.S. Dhami
10.5120/1269-1738

Pritam Singh Negi, M.M.S. Rauthan, H.S. Dhami . Article:Sentence Boundary Disambiguation: A User Friendly Approach. International Journal of Computer Applications. 7, 8 ( October 2010), 33-37. DOI=10.5120/1269-1738

@article{ 10.5120/1269-1738,
author = { Pritam Singh Negi, M.M.S. Rauthan, H.S. Dhami },
title = { Article:Sentence Boundary Disambiguation: A User Friendly Approach },
journal = { International Journal of Computer Applications },
issue_date = { October 2010 },
volume = { 7 },
number = { 8 },
month = { October },
year = { 2010 },
issn = { 0975-8887 },
pages = { 33-37 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume7/number8/1269-1738/ },
doi = { 10.5120/1269-1738 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:55:49.146508+05:30
%A Pritam Singh Negi
%A M.M.S. Rauthan
%A H.S. Dhami
%T Article:Sentence Boundary Disambiguation: A User Friendly Approach
%J International Journal of Computer Applications
%@ 0975-8887
%V 7
%N 8
%P 33-37
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In the present work we have developed an algorithm based on maximum entropy and stop word removal modules, which works with almost 99% accuracy and have established supremacy over the existing paragraph breaker software developed by Text Mining Group, School of Computer Science, Manchester University, United Kingdom .

References
  1. Berger A. 1996. A Brief Maxent Tutorial. http://www-2.cs.cmu.edu/~aberger/maxent.html.
  2. Gillick Dan (2009) Sentence boundary detection and the problem with the U.S.(2009) Proceeding of the NAACL HLT2009:Association for computational linguistics, (short papers),241-244.Boulder,Colorado.
  3. Kiss T. and Strunk J.(2006) Unsupervised multilingual sentence boundary detection, Computational linguistics, 32(4), 485-525.
  4. Manning, C.D. and Schütze, H. (2002) Foundations of statistical natural language processing. The MIT Press, Cambridge/London.
  5. Mikheev, A. (2000). Tagging Sentence Boundaries. In Proceedings of the NAACL, pp 264-271, Seattle, WA.
  6. Palmer, D.D. & Hearst, M.A. (1997). Adaptive Multilingual Sentence Boundary Disambiguation. Computation Linguistics, 23(2), 241-269.
  7. Siminski Krzysztof (2007) Sentence boundary verification in Polish text, Computer recognition systems 2, Advances in soft computing, Springer, Vol.45/2007,493-499.
  8. Weijian, Xuan, Watson, Stanley J. and Meng Fan (2007) Tagging sentence bares to Biomedical literature, Computational linguistics and Intelligent text processing, Lect. Notes in Computer Science, Springer, No.7, Vol.4394/2007, 186-195.
Index Terms

Computer Science
Information Sciences

Keywords

Sentence Boundary Information retrieval Evaluation

Powered by PhDFocusTM