Lexical Chaining Algorithm

From GM-RKB
Jump to navigation Jump to search

A Lexical Chaining Algorithm is a Word-level Analysis algorithm that can solve a Lexical Chaining Task.



References

2011

  • (UCD, 2011) ⇒ http://www.csi.ucd.ie/staff/jcarthy/home/Lex.html
    • QUOTE: By considering the distribution of elements in the chain throughout the text, it is possible to determine the strength of a lexical chain, which since it encapsulates a context, corresponds to the significance of the textual context it embodies. Thus the generation of lexical chains provides a basis identifying the topical units in a document which are of obvious importance in document summarisation. Morris and Hirst were the first researchers to suggest the use of lexical chains to determine the structure of texts (Morris, 1991). In recent years a number of researchers have used lexical chains in Information Retrieval and related areas. Kazman and others used lexical chaining in an effort to index videoconference transcriptions by topic (Kazman, 1996). Stairmand used lexical chaining in the construction of both a typical IR system and a text segmentation system while Green developed the technique to automatically generate hypertext links (Stairmand, 1996; Green 1997).

2003

1998

1997

  • Green, S.J., "Automatically Generating Hypertext by Computing Semantic Similarity", Ph.D. Thesis, University of Toronto, 1997.

1996a

1996b

1991