You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository has been archived by the owner on Feb 26, 2021. It is now read-only.
Right now we handle routine names very literally. You have to say pretty much the exact name. There's no aliases (which are mostly meant to fix common transcription errors), no stopwords, no repeated words, and no slots.
So I'd propose we compile routines into phrase matchers. We could really just use the compiler we have now, and then if someone wants to be fancy (using groups and alternates) they can. But more importantly, I'd like to compile all stopwords into (stopword |). That is, stopwords are optional, though allowed (and favored for scoring).
This also opens up manually inserting a slot, and using that as a substitution.
The text was updated successfully, but these errors were encountered:
Right now we handle routine names very literally. You have to say pretty much the exact name. There's no aliases (which are mostly meant to fix common transcription errors), no stopwords, no repeated words, and no slots.
So I'd propose we compile routines into phrase matchers. We could really just use the compiler we have now, and then if someone wants to be fancy (using groups and alternates) they can. But more importantly, I'd like to compile all stopwords into
(stopword |)
. That is, stopwords are optional, though allowed (and favored for scoring).This also opens up manually inserting a slot, and using that as a substitution.
The text was updated successfully, but these errors were encountered: