Spelling flexible find

ID: laaabbefkghdmbmpaiddindkppmacaol

Could be malicious

Supported Languages

🇺🇸English

Extension Info & Metadata

Status
Removed
Version
2.0
Size
0.05 MB
Rating
0.0/5
Reviews
0
Users
0
Type
Extension
Updated
Aug 31, 2016
Category
Productivity Tools
Price
Free
Featured
No
Visibility
Listed
Mature
No
By Google
No
Trusted
No

Publisher Contextual Analysis

Author
elias.ellisonView Profile
MX records exist
Yes
Domain exists
Yes
Is disposable
No
Is role-based
No
Mailbox exists
Yes
Website
Visit
Total Extensions
1
Active
0
Obsolete
1
Listed
1
Unlisted
0
Total Users
0

You reached today's free scan limit (3/3 unique extensions).

Upgrade for full visibility.

Spelling flexible find allows you to find results on a web page within a bound of spelling differences (levenshtein-edit distance).…

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.

Extracted Data

You reached today's free scan limit (3/3 unique extensions).

Upgrade for full visibility.

URLs
5
IPv4
0
IPv6
0

URLs

View the external URLs this extension communicates with to understand its network activity and data interactions.

You reached today's free scan limit (3/3 unique extensions).

Upgrade for full visibility.

stackoverflow.com/questions/985272/selecting-text-in-an-element-akin-to-highlighting-with-your-mousehttp://stackoverflow.com/questions/985272/selecting-text-in-an-element-akin-to-highlighting-with-your-mouse
james.padolsey.com-http://james.padolsey.com
unlicense.org/UNLICENSEhttp://unlicense.org/UNLICENSE
clients2.google.com/service/update2/crxhttps://clients2.google.com/service/update2/crx
getbootstrap.com/2.3.2/assets/img/glyphicons-halflings.pnghttp://getbootstrap.com/2.3.2/assets/img/glyphicons-halflings.png

You reached today's free scan limit (3/3 unique extensions).

Upgrade for full visibility.

No IP addresses found

Version History

You reached today's free scan limit (3/3 unique extensions).

Upgrade for full visibility.

Browse and explore files within this extension package

You reached today's free scan limit (3/3 unique extensions).

Upgrade for full visibility.