“相反” Porter Stemmer 算法？
I'm looking for some way of performing the opposite of a Porter Stemmer algorithm, i.e. the string "search" would return an array "searches, searched, searching etc.."
Does something like this exist already (pref in php)?
Thank you for your help!
如果你对这篇内容有疑问，欢迎到本站社区发帖提问 参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱，如果其他用户或者作者回复了您的评论，将不能在第一时间通知您！
发布评论
评论（1）
我不确定这是否是您想要的方向，但我会获取一个字典单词文件（Mac 和 nix 机器通常在
/usr/share/dict/words）并将其加载到易于搜索的存储机制中。接下来，我将编译 后缀 列表并在 < a href="http://www.say-it-in-english.com/SomeRules.html" rel="nofollow">应用于后缀的规则。
关于提出的实际问题，我还没有发现任何这样的存在。
I'm not sure if this is the direction that you're looking to go but I would grab a file of dictionary words (Mac and nix machines usually have one at
/usr/share/dict/words) and load it into an easily searched storage mechanism.Next, I'd compile a list of suffixes and program in the rules applied to suffixes.
In regard to the actual question asked I have not found anything that exists like this already.