pub enum Styling {
Casual,
SemiCasual,
SemiFormal,
Formal,
}Expand description
The register the transcript is rewritten into.
A closed set: the card documents a value outside the trained sets as one of the two ways to get garbled output, so the set is enforced here rather than trusted to callers.
The four are not a gradient. Measured, Formal declines comma insertions
and a grammar fix that SemiFormal applies, so the card’s “formal is
semi-formal with contractions expanded” is wrong and there is no
dialling this a little further in either direction.
Variants§
Casual
Lowercase throughout, apostrophes stripped, colloquialisms kept. Measured to mangle technical terms, rendering MMAP as “mmapped here”.
SemiCasual
Keeps the speaker’s phrasing; sentence starts stay lowercase.
SemiFormal
Standard written English, colloquialisms smoothed. The only value measured to insert commas the transcript did not have.
Formal
As SemiFormal, with contractions expanded.
Implementations§
Trait Implementations§
impl Copy for Styling
Source§impl<'de> Deserialize<'de> for Styling
impl<'de> Deserialize<'de> for Styling
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
impl Eq for Styling
impl StructuralPartialEq for Styling
Auto Trait Implementations§
impl Freeze for Styling
impl RefUnwindSafe for Styling
impl Send for Styling
impl Sync for Styling
impl Unpin for Styling
impl UnsafeUnpin for Styling
impl UnwindSafe for Styling
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> DeserializeOwned for Twhere
T: for<'de> Deserialize<'de>,
impl<S, T> Duplex<S> for Twhere
T: FromSample<S> + ToSample<S>,
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key and return true if they are equal.