deniskyashif/ssfst
Rewrite text in linear time.
This tool helps you automatically rewrite specific words or phrases in a given text based on a predefined set of rules. You provide a list of 'find and replace' pairs, and it processes your text, replacing all occurrences very quickly. This is ideal for anyone needing to standardize text, correct common errors, or embed consistent information across many documents.
No commits in the last 6 months. Available on npm.
Use this if you need to apply a consistent set of text transformations, like spelling corrections or linking specific terms, across a large volume of text efficiently.
Not ideal if you need to analyze text for patterns or extract information without changing it, or if your rewrite rules involve complex linguistic understanding beyond direct substitutions.
Stars
81
Forks
6
Language
JavaScript
License
MIT
Category
Last pushed
Mar 04, 2023
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/nlp/deniskyashif/ssfst"
Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.
Higher-rated alternatives
hplt-project/sacremoses
Python port of Moses tokenizer, truecaser and normalizer
Blake-Madden/OleanderStemmingLibrary
Porter stemming library (C++)
adbar/simplemma
Simple multilingual lemmatizer for Python, especially useful for speed and efficiency
htaghizadeh/PersianStemmer-Python
PersianStemmer-Python
michmech/lemmatization-lists
Machine-readable lists of lemma-token pairs in 23 languages.