Julie Beth Lovins

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
Julie Beth Lovins
Born (1945-10-19)October 19, 1945
Died January 16, 2018(2018-01-16) (aged 72)
Mountain View, California
Citizenship US
Alma mater Brown University
University of Chicago
Known for Computational linguistics
Scientific career
Fields Computational linguistics

Julie Beth Lovins was 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]

Biography[edit]

Lovins attended Brown University for her undergraduate degree.[3] She received the inaugural Bloch Fellowship in 1970 from the Linguistic Society of America to attend graduate school.[4] Lovins obtained her MA in 1970 and PhD in 1973 from the University of Chicago. Following her PhD, she spent a year working as a linguist-at-large at a University of Tokyo language research institute and as an English conversation teacher.[3] She then joined the faculty at Tsuda College as a professor of English and linguistics, where she taught for seven years.[5] She published an article about her work developing the first stemming algorithm through the Research Laboratory of Electronics at MIT.[6] A revision of her thesis on loanwords and the phonological structure of Japanese was published in 1975 by the Indiana University Linguistics Club.[7] She moved to Mountain View, California in 1979, and later to Old Mountain View in 1981 with her partner and later husband Greg Fowler, who unexpectedly died in 2016.[8][9]

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. ^ a b "Brown Alumni Monthly". 74 (9). July 1974: 51. Retrieved 6 June 2017. 
  4. ^ "Linguistic Institute Fellowships". Linguistic Society of America. Retrieved 6 June 2017. 
  5. ^ "Reinventing Energy in China". Asia Society. Retrieved 6 June 2017. 
  6. ^ Lovins, Julie (1968). "Development of a Stemming Algorithm" (PDF). Mechanical Translation and Computational Linguistics. 11 (1 & 2): 22–31. 
  7. ^ Lovins, Julie (1975). "Loanwords and the phonological structure of Japanese". Linguistics Club: 163. 
  8. ^ Rowell, Velva (March 2008). "A few minutes with Julie Lovins". OMVNA Newsletter. 20 (2). Retrieved 6 June 2017. 
  9. ^ "Remembering Greg Fowlerby Roger Petersen - The blind californian". 2016 SVCB In Touch. Retrieved 6 June 2017.