Spelling flexible find
大小:50.71KiB版本:v 2.0更新时间:2021-12-21
Spelling flexible find allows you to find results on a web page within a bound of spelling differences (levenshtein-edit distance).…
Spelling flexible find 的使用方法详解,最全面的教程
Spelling flexible find 描述:
用户数:0
分类:搜索工具插件
扩展大小:50.71 KiB
最后更新时间:2021-12-21
版本:v 2.0
Spelling flexible find 插件简介:
这是来自Chrome商店的 Spelling flexible find 浏览器插件,您可以在当前页面下载它的最新版本安装文件,并安装在Chrome、Edge等浏览器上。
Spelling flexible find插件下载方法/流程:
点击下载按钮,关注“扩展迷Extfans”公众号并获取验证码,在网页弹窗中输入验证码,即可下载最新安装文件。
Spelling flexible find插件安装教程/方法:
(1)将扩展迷上下载的安装包文件(.zip)解压为文件夹,其中类型为“crx”的文件就是接下来需要用到的安装文件
(2) 从设置->更多工具->扩展程序 打开扩展程序页面,或者地址栏输入 Chrome://extensions/ 按下回车打开扩展程序页面
(3) 打开扩展程序页面的“开发者模式”
(4) 将crx文件拖拽到扩展程序页面,
完成安装如有其它安装问题,
请扫描网站底部二维码与客服联系如有疑问请参考:
https://www.extfans.com/installation/Spelling flexible find allows you to find results on a web page within a bound of spelling differences (levenshtein-edit distance).
This can be useful to find results on the page even if they're mizzpelled, to find results if you're unsure how a word is spelled, or a combination of the two.
I recommend setting a shortcut to spelling flexible find under control-shift.
Usage:
Spelling flexible find is meant to find single words. It use space, exclamation marks, periods, commas, colons, and semi-colons as regex to indicate a new word. For a detailed explanation, see the bottom of this description.
Spelling flexible find uses many of the same controls as the chrome page find, so it should be intuitive.
Enter: go to next result
Shift-enter: go to previous result
Click on the plus and minus buttons to edit the allowed distance of spelling differences. Plus is more lenient, and minus is less. 0 indicates that a word must be the same exact string you have searched for, or your string must be a prefix to that word.
Clicking on the web page will hide this extension, and keep the current highlighting. If you wish to remove the highlighting, first clear the search bar, then continue.
Why does it only find a single word ?
If the extension doesn't use delimiting characters, then any subsection of any text is potentially a word. With 100 characters, there are 5050 different possible strings. Put more generally, for an n length string there are O(n^2) different possible words.
Further, finding the Levenshtein distance between two words is computationally intensive (O(n^2)). Not computationally intensive enough to make this extension infeasible, but infeasible enough that performing on all possible word combinations in a string would be infeasible (and O(n^3)).
You can enter multiple words, and that string will be searched the same, but the text candidates to match it up against will not contain any of the delimiting characters.