pub struct SimplifyPIAT;
Expand description
Simplify attributing indefinite pronouns without determiner (PIAT)
Simplifies lemmas of this class to some baseform (preliminary) based on matching lowercased prefixes of the forms. The rules are applied in the given order
“keinerlei” -> “keinerlei” “einig*” -> “einig” “etlich*” -> “etlich” “irgendein*” -> “irgendein” “irgendwelch*” -> “irgendwelch” “jedwed*” -> “jedwed” “kein*” -> “kein” “manch*” -> “manch” “wenig*” -> “wenig”
Trait Implementations
sourceimpl Transform for SimplifyPIAT
impl Transform for SimplifyPIAT
fn transform(&self, graph: &dyn DependencyGraph, node: usize) -> String
Auto Trait Implementations
impl RefUnwindSafe for SimplifyPIAT
impl Send for SimplifyPIAT
impl Sync for SimplifyPIAT
impl Unpin for SimplifyPIAT
impl UnwindSafe for SimplifyPIAT
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more