Abbreviation expansion based on learned weights

Details Abbreviation expansion based on learned weights Abbreviation expansion based on learned weights

2006-10-04

2010-12-07

Albertalli, Brian L (Department: 2626)

Data processing: speech signal processing, linguistics, language

Linguistics

Natural language

C704S010000, C704S270100

Reexamination Certificate

active

07848918

ABSTRACT:
A method and system for identifying expansions of abbreviations using learned weights is provided. An abbreviation system generates features for various expansions of an abbreviation and generates a score indicating the likelihood that an expansion is a correct expansion of the abbreviation. A expansion with the same number of words as letters in the abbreviation is more likely in general to be a correct expansion than an expansion with more or fewer words. The abbreviation system calculates a score based on a weighted combination of the features. The abbreviation system learns the weights for the features from training data of abbreviations, candidate expansions, and scores for the candidate expansions.

REFERENCES:
patent: 5623406 (1997-04-01), Ichbiah
patent: 5634084 (1997-05-01), Malsheen et al.
patent: 6314399 (2001-11-01), Deligne et al.
patent: 6385629 (2002-05-01), Sundaresan et al.
patent: 6678415 (2004-01-01), Popat et al.
patent: 6934767 (2005-08-01), Jellinek
patent: 6966030 (2005-11-01), Ashford et al.
patent: 7028038 (2006-04-01), Pakhomov
patent: 7089188 (2006-08-01), Logan et al.
patent: 7136876 (2006-11-01), Adar et al.
patent: 7236923 (2007-06-01), Gupta
patent: 7536297 (2009-05-01), Byrd et al.
patent: 2002/0152064 (2002-10-01), Dutta et al.
Gudes, “Abbreviation Expansion in Schema Matching andWeb Integration”, Proceedings of the IEEE/WIC/ACM International Conference on Web Intelligence, Feb. 2004.
Terada et al., “Automatic expansion of abbreviations by using context and character information”, Information Processing and Management 40, pp. 31-45, 2004.
Xu et al., “A Machine Learning Approach to Recognizing Acronyms and Their Expansion”, Proceedings of the Fourth International Conference on Machine Learning and Cybernetics, Aug. 18-21, 2005.
Zhang, “An Introduction to Support Vector Machines and Other Kernel-Based Learning Methods”, AI Magazine, vol. 22, No. 2, 2001.
Acronym Dictionary, http://www.acronymdictionary.co.uk/acronymae.html, [last accessed May 24, 2007].
Acronym Finder, http://www.acronymfinder.com, [last accessed May 24, 2007].
Acronym Guide, http://www.acronym-guide.com/, [last accessed May 24, 2007].
Beigbeder, Michel and Annabelle Mercier, “An Information Retrieval Model Using the Fuzzy Proximity Degree of Term Occurences,” SAC'05, Mar. 13-17, 2005, Santa Fe, New Mexico, © 2005 ACM.
Brown, Peter F. et al., “A Statistical Approach to Machine Translation,” Computational Linguistics, vol. 16, No. 2, Jun. 1990, pp. 79-85.
Church, Kenneth Ward, “A Stochastic Parts Program and Noun Phrase Parser for Unrestricted Text,” 2nd Conference on Applied Natural Language Processing, 1988, pp. 136-143.
Clarke, Charles L. A. et al., “Shortest Substring Ranking (MultiText Experiments for TREC-4),” 4th Text Retrieval Conference, 1995.
Deligne, Sabine and Frederic Bimbot, “Language Modeling by Variable Length Sequences: Theoretical Formulation and Evaluation of Multigrams,” ICASSP'95, pp. 169-172, © 1995 IEEE.
Hawking, David and Paul Thistlewaite, “Proximity Operators—So Near and Yet So Far,” Dec. 6, 1995, 4th Text Retrieval Conference, 1995.
Jones, S. et al., “Peeling the Onion: Okapi System Architecture and Software Design Issues,” Journal of Documentation, vol. 53, No. 1, Jan. 1997, pp. 58-68.
Kernighan, Mark D. et al., “A Spelling Correction Program Based on a Noisy Channel Model,” 13th International Conference on Computational Linguistics, 1990, pp. 205-210.
Larkey, Leah S. et al., “Acrophile: An Automated Acronym Extractor and Server,” Digital Libraries, San Antonio, Texas, © 2000 ACM, pp. 205-214.
Pustejovsky, James et al., “Linguistic Knowledge Extraction from Medline: Automatic Construction of an Acronym Database,” MedInfo, 2001, http://medstract.org/papers/bioinformatics.pdf.
Rasolofo, Yves and Jacques Savoy, “Term Proximity Scoring for Keyword-Based Retrieval Systems,” Advances in Information Retrieval: 25th European Conference on IR Research, ECIR, 2003, Italy, © Springer-Verlag Berlin Heidelberg 2003, pp. 207-218.
Shen, Dou et al., “Text Classification Improved through Automatically Extracted Sequences,” Proceedings of the 22nd International Conference on Data Engineering, 2006.
Smola, Alex J., GMD and Bernhard Scholkopf, GMD, “A Tutorial on Support Vector Regression,” NeuroCOLT2 Technical Report Series, NC2-TR-1998-030, Oct. 1998.
Srihari, Rohini K. and Charlotte M. Baltus, “Combining Statistical and Syntactic Methods in Recognizing Handwritten Sentences,” In AAAI Symposium: Probabilistic Approaches to Natural Language, 1992, pp. 121-127.
The Canonical Abbreviation/Acronym List, http://www.astro.umd.edu/˜marshall/abbrev.html, [last accessed May 24, 2007].
Toole, Janine, “A Hybrid Approach to the Identification and Expansion of Abbreviations,” 2000, http://scholar.google.com/scholar?hl=en&lr=&q=cache:0lfRYRpPaKkJ:data.cstr.ed.ac.uk/internal/library/proceedings/2000/riao2000/Thursday/61DO2.pdf+acronym+expansion.
WWWAAS, http://www.ucc.ie/cgi-bin/acronym, [last accessed May 24, 2007].
Yi, Jeonghee and Neel Sundaresan, “Mining the Web for Acronyms Using the Duality of Patterns and Relations,” WIDM99, Kansas City, MO, © ACM 1999, pp. 48-52.

Affiliated with

Also associated with

Rating

Abbreviation expansion based on learned weights does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Abbreviation expansion based on learned weights, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Abbreviation expansion based on learned weights will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4168289