Julie Beth Lovins

From Wikipedia, the free encyclopedia
Jump to: navigation, search
Julie Beth Lovins
Born United States
Citizenship US
Fields Computational linguistics
Alma mater University of Chicago
Known for Computational linguistics

Julie Beth Lovins is a computational linguist who wrote the first stemming algorithm for word matching.[1]

It is a single pass, context sensitive stemmer, which removes endings based on the longest-match principle. The stemmer was the first to be published and was extremely well developed considering the date of its release and has been the main influence on a large amount of the future work in the area. -Adam G., et al[2]

Lovins obtained her Ph.D. in 1973 from the University of Chicago. She has published an article about the development of stemming algorithm through the Elecronic Systems Laboratory at MIT, Cambridge.[3] A revision of her thesis on loanwords and the phonological structure of Japanese was published in 1975 by the Indiana University Linguistics Club.[4]

References[edit]

  1. ^ "What is Lovins Stemming?". The Lovins Stemmer. Lancaster University. Archived from the original on 1 May 2010. Retrieved 26 May 2011. 
  2. ^ Adam G., Asimakis K., Bouras C., Poulopoulos V. (2010). "An Efficient Mechanism for Stemming and Tagging: The Case of Greek Language.". Knowledge-Based and Intelligent Information and Engineering Systems. KES 2010. Lecture Notes in Computer Science. 6278: 389-397. 
  3. ^ Lovins, Julie (1968). "Development of a Stemming Algorithm" (PDF). Mechanical Translation and Computational Linguistics. 11 (1 & 2): 22-31. 
  4. ^ Lovins, Julie (1975). "Loanwords and the phonological structure of Japanese". Linguistics Club: 163.