Statistical semantics

History

The term statistical semantics was first used by Warren Weaver in his well-known paper on machine translation.[1] He argued that word sense disambiguation for machine translation should be based on the co-occurrence frequency of the context words near a given target word. The underlying assumption that "a word is characterized by the company it keeps" was advocated by J.R. Firth.[2] This assumption is known in linguistics as the distributional hypothesis.[3] Emile Delavenay defined statistical semantics as the "statistical study of meanings of words and their frequency and order of recurrence".[4] "Furnas et al. 1983" is frequently cited as a foundational contribution to statistical semantics.[5] An early success in the field was latent semantic analysis.

Applications

Research in statistical semantics has resulted in a wide variety of algorithms that use the distributional hypothesis to discover many aspects of semantics, by applying statistical techniques to large corpora:

  • Measuring the similarity in word meanings[6][7][8][9]
  • Measuring the similarity in word relations [10]
  • Modeling similarity-based generalization[11]
  • Discovering words with a given relation[12]
  • Classifying relations between words[13]
  • Extracting keywords from documents[14][15]
  • Measuring the cohesiveness of text[16]
  • Discovering the different senses of words[17]
  • Distinguishing the different senses of words[18]
  • Subcognitive aspects of words[19]
  • Distinguishing praise from criticism[20]

Statistical semantics focuses on the meanings of common words and the relations between common words, unlike text mining, which tends to focus on whole documents, document collections, or named entities (names of people, places, and organizations). Statistical semantics is a subfield of computational semantics, which is in turn a subfield of computational linguistics and natural language processing.

Many of the applications of statistical semantics (listed above) can also be addressed by lexicon-based algorithms, instead of the corpus-based algorithms of statistical semantics. One advantage of corpus-based algorithms is that they are typically not as labour-intensive as lexicon-based algorithms. Another advantage is that they are usually easier to adapt to new languages than lexicon-based algorithms. However, the best performance on an application is often achieved by combining the two approaches.[21]

gollark: ddg! rust "tokio"
gollark: Tokio is on crates.io.
gollark: I would probably just limit it to sending people through cheap metal detectors before they board, or something.
gollark: It does not. But there are other defenses against that which have been implemented.
gollark: It's actually just a jobs program for vaguely sociopathic idiots.

See also

References
  1. Weaver 1955
  2. Firth 1957
  3. Sahlgren 2008
  4. Delavenay 1960
  5. Furnas et al. 1983
  6. Lund, Burgess & Atchley 1995
  7. Landauer & Dumais 1997
  8. McDonald & Ramscar 2001
  9. Terra & Clarke 2003
  10. Turney 2006
  11. Yarlett 2008
  12. Hearst 1992
  13. Turney & Littman 2005
  14. Frank et al. 1999
  15. Turney 2000
  16. Turney 2003
  17. Pantel & Lin 2002
  18. Turney 2004
  19. Turney 2001
  20. Turney & Littman 2003
  21. Turney et al. 2003

Sources
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.