一个自然语言处理的Java开源工具包。LingPipe目前已有很丰富的功能，包括主题分类（Top Classification）、命名实体识别（Named Entity Recognition）、词性标注（Part-of Speech Tagging）、句题检测（Sentence Detection）、查询拼写检查（Query Spell Checking）、兴趣短语检测（Interseting Phrase Detection）、聚类（Clustering）、字符语言建模（Character Language Modeling）、医学文献下载/解析/索引（MEDLINE Download, Parsing and Indexing）、数据库文本挖掘（Database Text Mining）、中文分词（Chinese Word Segmentation）、情感分析（Sentiment Analysis）、语言辨别（Language Identification）等API。
上传时间： 2013-12-04
上传用户：15071087253
This is an implementation of double-array structure for representing trie, as proposed by Junichi Aoe [1]. Trie is a kind of digital search tree, an efficient Indexing method with O(1) time complexity for searching. Comparably as efficient as hashing, trie also provides flexibility on incremental matching and key spelling manipulation. This makes it ideal for lexical analyzers, as well as spelling dictionaries. See the details of the implementation at [2]: http://linux.thai.net/~thep/datrie/datrie.html Historically, this was first implemented as C++ classes in a library called midatrie [2], but later simplified and rewritten from scratch in C.
标签： implementation double-array representing structure
上传时间： 2013-12-10
上传用户：shinesyh
This library implements the KLT Tracking algorithm [2004] for Feature Tracking in Video useful in computer vision tasks like object recognition, image Indexing, tracking and structure from motion. This implementation uses programmable Graphics Hardware to achieve considerable speedup in the running time of the GPU-based implementation.
标签： Tracking implements algorithm Feature
上传时间： 2013-12-10
上传用户：trepb001
This library implements the KLT Tracking algorithm [2004] for Feature Tracking in Video useful in computer vision tasks like object recognition, image Indexing, tracking and structure from motion. This implementation uses programmable Graphics Hardware to achieve considerable speedup in the running time of the GPU-based implementation.
标签： Tracking implements algorithm Feature
上传时间： 2013-12-19
上传用户：WMC_geophy
Collection of key-value pairs. TDictionary represents a generic collection of key-value pairs. This class provides a mapping from a collection of keys to a collection of values. When you create a TDictionary object, you can specify various combinations of initial capacity, equality operation, and initial content. You can add a key that is associated with a corresponding value with the Add or AddOrSetValue methods. You can remove entries with Remove or Clear, which removes all key-value pairs. Adding or removing a key-value pair and looking up a key are efficient, close to O(1), because keys are hashed. A key must not be nil (though a value may be nil) and there must be an equality comparison operation for keys. You can test for the presence or keys and values with the TryGetValue, ContainsKey and ContainsValue methods. The Items property lists all Count dictionary entries. You can also set and get values by Indexing the Items property. Setting the value this way overwrites any existing value. The class TObjectDictionary inherits from TDictionary and provides an automatic mechanism for freeing objects removed from dictionary entries.
标签： Delphi 泛型
上传时间： 2015-07-01
上传用户：mirage
