Recognizing acronyms and their definitions
International Journal on Document Analysis and Recognition (IJDAR)Published 1 May 1999
Kazem Taghva, Jeff Gilbreth
Citations122
SJR quartileQ1
SJR score0.83
SNIP1.96
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
An automatic method for finding acronyms and their definitions in free text based on an inexact pattern matching algorithm applied to text surrounding the possible acronym shows both high recall and precision.
Abstract
This paper introduces an automatic method for finding acronyms and their definitions in free text. The method is based on an inexact pattern matching algorithm applied to text surrounding the possible acronym. Evaluation shows both high recall and precision for a set of documents randomly selected from a larger set of full text documents.
Keywords
Computer ScienceBiochemistry, Genetics and Molecular Biology
Communications of the ACMA fast algorithm for computing longest common subsequences
692 Citations1977James Hunt, Thomas G. Szymanski
An algorithm for finding the longest common subsequence of two sequences of length n which has a running time of O((r + n) log n), where r is the total number of ordered pairs of positions at which the two sequences match.
W. B. Saunders Company eBooksLex—a lexical analyzer generator
618 Citations1990Michael Lesk, Elisabeth Brandão Schmidt
This manual will only discuss generating analyzers in C on the UNIX system, which is the only supported form of Lex under UNIX Version 7.0, and is designed to simplify interfacing with Yacc, for those with access to this compiler-compiler system.
The use of phrases and structured queries in information retrieval
265 Citations1991W. Bruce Croft, Howard R. Turtle +1 more
The results show that using phrases in this way can improve performance, and that phrases that are automatically extracted from a natural language query perform nearly as well as manually selected phrases.
Cornell University eBooksExperiments in Automatic Phrase Indexing For Document Retrieval: A Comparison of Syntactic and Non-Syntactic Methods
185 Citations1987Joel L. Fagan
A 78-year-old man with palpitations, dizziness, and presyncope was referred to the authors' institution for evaluation and a diagnosis of right ventricular dysplasia was made, and the patient underwent an electrophysiological study to evaluate hisPalpitations and Presyncope.
Digital Scholarship - UNLV (University of Nevada Reno)Results of applying probabilistic IR to OCR text
67 Citations1994Kazem Taghva, Julie Borsack +1 more
Medical Entomology and ZoologyInformation retrieval by text skimming
39 Citations1989Michael L. Mauldin
F scERRET is described: a full text, conceptual information retrieval system that uses a partial understanding of its texts to provide greater precision and recall performance than keyword search techniques.
Creating segmented databases from free text for text retrieval
38 Citations1991Lisa F. Rau, Paul S. Jacobs
A system that uses natural language text processing to derive keywords from free ted news siorles, separat,e these kegwords into segments, and awtomatica!iy butld a segmented database, as well as reduced cost.
International Journal of Pattern Recognition and Artificial IntelligencePOST-EDITING THROUGH APPROXIMATION AND GLOBAL CORRECTION
17 Citations1995Kazem Taghva, Julie Borsack +2 more
A new automatic spelling correction program to deal with OCR generated errors and among the misspellings discovered by this algorithm, about 87% were corrected.
A textual object management system
12 Citations1992Scott Deerwester, Keith Waclena +1 more
The system described in this paper is a programming tool for managing textual objects that provides a great deal of flexibility, giving access to very complex document structure, with a large number of constituent kinds of textual objects.
