波特词干算法(国外英文资料).docVIP

波特词干算法(国外英文资料) Potter-type algorithm It is located in the natural language processing In English, a word is often a variant of another word: happy = happiness, which is called happiness (stem). In information retrieval systems, we often do one thing at a time, and is in the process of Term standardization, to extract the stem (stemming), namely the removal of the English word segmentation transformation at the end of the form. The most widely used, moderately complex, suffix divestment algorithm is the Porter Stemmer. See the official website. The more popular retrieval systems include Lucene, Whoosh, and other dry filters. A brief history: In 1979, Dr. Martin Porter, a computer lab at the university of Cambridge, England, invented the potter lexical algorithm. The potter lexical algorithm was proposed as part of a large IR project. Its original paper was: C.J. van Rijsbergen, S.E. Robertson and M.F. Porter, 1980. New models in probabilistic information retrieval. London: British Library Research and Development Report, no. 5587. The original port stem extraction algorithm was written in the BCPL language. The author publishes a version of the language on his website, where the version of C is the most authoritative version written by the author. Potter stems device is suitable for the research work involves the extraction of stem IR, its experimental results are repeatable, the implication is that, porter stemming the output is deterministic and is not random. (there is also a randomized, advanced lexical extraction algorithm, which is more accurate but also more complex.) Stemming algorithms cannot reach 100% accuracy, because language word itself changes, there are many exceptions cannot be summarized to the general rule. Using the stem extraction algorithm can help improve IR performance. On the official website of the potter-stem algorithm, there is a version of each language (which is actually a translation of the C standard). You will be able to download the