Proceedings Eighth Symposium on String Processing and Information Retrieval最新文献_第3页

A subquadratic algorithm for cluster and outlier detection in massive metric data 海量度量数据中聚类和离群点检测的次二次算法

Proceedings Eighth Symposium on String Processing and Information Retrieval Pub Date : 1900-01-01 DOI: 10.1109/SPIRE.2001.10018

Edgar Chávez

引用次数: 0

Relating web characteristics with link based web page ranking 将网页特征与基于链接的网页排名联系起来

Proceedings Eighth Symposium on String Processing and Information Retrieval Pub Date : 1900-01-01 DOI: 10.1109/SPIRE.2001.989734

Ricardo Baeza-Yates, C. Castillo

引用次数: 43

On-line construction of symmetric compact directed acyclic word graphs 对称紧致有向无环字图的在线构造

Proceedings Eighth Symposium on String Processing and Information Retrieval Pub Date : 1900-01-01 DOI: 10.1109/SPIRE.2001.989743

Shunsuke Inenaga, H. Hoshino, A. Shinohara, M. Takeda, S. Arikawa

引用次数: 12

Using edit distance in point-pattern matching 在点模式匹配中使用编辑距离

Proceedings Eighth Symposium on String Processing and Information Retrieval Pub Date : 1900-01-01 DOI: 10.1109/SPIRE.2001.989751

V. Makinen

{"title":"Using edit distance in point-pattern matching","authors":"V. Makinen","doi":"10.1109/SPIRE.2001.989751","DOIUrl":"https://doi.org/10.1109/SPIRE.2001.989751","url":null,"abstract":"Edit distance is a powerful measure of similarity in string matching, measuring the minimum amount of insertions, deletions, and substitutions to convert a string into another string. This measure is ofte. contrasted with time warping in speech processing, that measures how close two trajectories are by allowing compression and expansion operations on time scale. Erne warping can be easily generalized to measure the similarity between ID point-patterns (ascending lists of real values), as the diference between ith and (i l ) th points in a point-pattern can be considered as the value of a trajectory at the time i. Howeve< we show that edit distance is more natural choice, and derive a measure by calculating the minimum amount of space needed to insert and delete between points to convert a point-pattern into another. We show that this measure defines a metric. We also define a substitution operation such that the distance calculation automatically separates the points into matching and mismatching points. The algorithms are based on dynamic programming. The main motivation for these methods is two and higher dimensional point-pattern matching, and therefore we generalize these methods into the 2 0 case, and show that this generalization leads to an NP-complete problem. There is also applications for the I D case; we discuss shortly the matching of tree ring sequences in dendrochronology.","PeriodicalId":107511,"journal":{"name":"Proceedings Eighth Symposium on String Processing and Information Retrieval","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127863073","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

On compression of parse trees 关于解析树的压缩

Proceedings Eighth Symposium on String Processing and Information Retrieval Pub Date : 1900-01-01 DOI: 10.1109/SPIRE.2001.989759

J. Tarhio

引用次数: 10

Of maps bigger than the empire 比帝国还大的地图

Proceedings Eighth Symposium on String Processing and Information Retrieval Pub Date : 1900-01-01 DOI: 10.1109/SPIRE.2001.989732

A. Apostolico

引用次数: 4

Semantic labeling - unveiling the main components of meaning of free-text 语义标注——揭示自由文本意义的主要成分

Proceedings Eighth Symposium on String Processing and Information Retrieval Pub Date : 1900-01-01 DOI: 10.1109/SPIRE.2001.10027

Y. Zieman, R. Salas

{"title":"Semantic labeling - unveiling the main components of meaning of free-text","authors":"Y. Zieman, R. Salas","doi":"10.1109/SPIRE.2001.10027","DOIUrl":"https://doi.org/10.1109/SPIRE.2001.10027","url":null,"abstract":"An experimentally proven methodology for computing semantic labels for natural language and its use in semantic processing of text is described. A combinatorial model of the conceptual space is created where semantic labels result as combinations ofprimary or atomic concepts called Semantic Factors. The set of about 2,500 Semantic Factors is defined. The basic semantic element of a language is a morpheme-type element (s-morpheme), the minimalpart ofa language that bears its own meaning. All s-morphemes in the Knowledge Base (about 15,000 for English) are labeled. The label for a phrase (its ¿Concept Codel7 results as a combination of the labels for the smorphemes constituting it. Algorithms are designed to identify the s-morphemes in a phrase and to generate the phrase¿s Concept Code. The matching procedure compares Concept Codes and identifies conceptually close ones - those sharing a maximal number of Semantic Factors. Similarity is identified here as a match between the Concept Codes of two Text objects. Since a Concept Code is essentially language independent, this technology is appropriate for implementation in cross-language applications. An example is described of an application in the bio-medical domain, where documents of a database of more than 12 million titles are being successfully retrieved in about 50% of the queries normally rejected by traditional search methods.","PeriodicalId":107511,"journal":{"name":"Proceedings Eighth Symposium on String Processing and Information Retrieval","volume":"190 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132747928","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1