Lecture 8. Suffix trees for NLP — различия между версиями

Материал из Wiki - Факультет компьютерных наук
Перейти к: навигация, поиск
(‎Taxonomy re�nement)
(‎Profound �ltering)
Строка 23: Строка 23:
 
== Reference graph ==
 
== Reference graph ==
  
−
== Profound �ltering ==
+
== Profound filtering ==
  
 
== Implementation ==
 
== Implementation ==

Версия 01:54, 24 августа 2015

Text (collection) representation model

Suffix tree

Annotated suffix tree

Annotated suffix tree construction

Annotated suffix tree scoring

Applications of AST

Spam filtering

Unsupervised text categorization

Text summarization

Taxonomy refinement

German compound splitting

Reference graph

Profound filtering

Implementation

Источник — «http://wiki.cs.hse.ru/index.php?title=Lecture_8._Suffix_trees_for_NLP&oldid=16954»