<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>String on Sawyer Zheng's Blog</title><link>https://elated-raman-42e0c2.netlify.app/tags/string/</link><description>Recent content in String on Sawyer Zheng's Blog</description><generator>Hugo</generator><language>zh-cn</language><lastBuildDate>Fri, 05 Jan 2024 11:37:47 +0800</lastBuildDate><atom:link href="https://elated-raman-42e0c2.netlify.app/tags/string/index.xml" rel="self" type="application/rss+xml"/><item><title>Unicode</title><link>https://elated-raman-42e0c2.netlify.app/post/notes/python/unicode/</link><pubDate>Fri, 10 Feb 2023 00:00:00 +0000</pubDate><guid>https://elated-raman-42e0c2.netlify.app/post/notes/python/unicode/</guid><description>&lt;div id="outline-container-headline-1" class="outline-2"&gt;
&lt;h2 id="headline-1"&gt;
工具
&lt;/h2&gt;
&lt;div id="outline-text-headline-1" class="outline-text-2"&gt;
&lt;ol&gt;
&lt;li&gt;
&lt;p&gt;unicodedata 模块&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;python 官方模块， unicode 字符集处理工具&lt;/li&gt;
&lt;/ul&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;p&gt;unicodeit 模块&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;&lt;a href="https://github.com/svenkreiss/unicodeit"&gt;GitHub - svenkreiss/unicodeit: Converts LaTeX tags to unicode: \mathcal{H} → …&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;p&gt;生成 unicode 字符的网站&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;&lt;a href="https://fsymbols.com/generators/encool/"&gt;Cool text generator Encool ℰη¢◎◎ʟ&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;p&gt;命令行 terminal 输出宽度&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;&lt;a href="https://github.com/jquast/wcwidth"&gt;GitHub - jquast/wcwidth: Python library that measures the width of unicode st…&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;p&gt;希腊字母声调符号&lt;/p&gt;</description></item><item><title>Edit Distance 编辑距离</title><link>https://elated-raman-42e0c2.netlify.app/post/notes/text/edit_distance/</link><pubDate>Mon, 17 Jun 2019 00:00:00 +0000</pubDate><guid>https://elated-raman-42e0c2.netlify.app/post/notes/text/edit_distance/</guid><description>&lt;div id="outline-container-headline-1" class="outline-2"&gt;
&lt;h2 id="headline-1"&gt;
sites
&lt;/h2&gt;
&lt;div id="outline-text-headline-1" class="outline-text-2"&gt;
&lt;div id="outline-container-headline-2" class="outline-3"&gt;
&lt;h3 id="headline-2"&gt;
Levenshtein_distance
&lt;/h3&gt;
&lt;div id="outline-text-headline-2" class="outline-text-3"&gt;
&lt;p&gt;&lt;a href="https://en.wikipedia.org/wiki/Levenshtein_distance"&gt;https://en.wikipedia.org/wiki/Levenshtein_distance&lt;/a&gt;&lt;/p&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;div id="outline-container-headline-3" class="outline-3"&gt;
&lt;h3 id="headline-3"&gt;
Wagner–Fischer algorithm
&lt;/h3&gt;
&lt;div id="outline-text-headline-3" class="outline-text-3"&gt;
&lt;p&gt;&lt;a href="https://en.wikipedia.org/wiki/Wagner"&gt;https://en.wikipedia.org/wiki/Wagner&lt;/a&gt;%E2%80%93Fischer_algorithm&lt;/p&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;div id="outline-container-headline-4" class="outline-3"&gt;
&lt;h3 id="headline-4"&gt;
求两个序列/字符串的相似度（Levenshtein）
&lt;/h3&gt;
&lt;div id="outline-text-headline-4" class="outline-text-3"&gt;
&lt;p&gt;&lt;a href="https://blog.csdn.net/qq_37788558/article/details/78780785"&gt;https://blog.csdn.net/qq_37788558/article/details/78780785&lt;/a&gt;&lt;/p&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;div id="outline-container-headline-5" class="outline-3"&gt;
&lt;h3 id="headline-5"&gt;
中文详细叫教程
&lt;/h3&gt;
&lt;div id="outline-text-headline-5" class="outline-text-3"&gt;
&lt;p&gt;&lt;a href="https://www.zhihu.com/question/315634571/answer/620984468"&gt;https://www.zhihu.com/question/315634571/answer/620984468&lt;/a&gt;&lt;/p&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;</description></item></channel></rss>