\_sh v3.0 244 Interlinear text \id Word Formula Samples \c For more information, see Shoebox Help \c 1. Choose Search on the Help menu \c 2. Type: Word Formulas \c 3. Choose Display \c Word formulas automatically select the correct parse (containing the correct homograph—noun plural suffix) \c 1. Click tigers in the \t field \c 2. Choose the Interlinearize (show all parses) command on the Tools menu \c 3. Notice the invalid parse \c 4. Click the Formulas button \t tigers \m tiger -s \g Felis_tigris -pl \p n -nsuf \c Truly ambiguous (both noun and verb) \c Formulas eliminate two invalid parses \t bears bears \m bear -s bear -s \g Ursidae -pl hold_up -3s \p n -nsuf v -vsuf \c Each morpheme has a homograph \c Formulas eliminate the invalid parses \t bearers \m bear -er -s \g hold_up -vnzr -pl \p v -vsuf -nsuf \c Basic Shoebox parsing features, such as the morphophonemic alteration for -ize (described using \a and \u fields in the lexical database) are compatible with use of formulas to select the correct parse. \t philosophizes \m philosophy -ize -s \g learning -nvzr -3s \p n -nsuf -vsuf \c When matching this word's parse, word formula patterns containing the symbols NounStem and VerbStem are used repeatedly—this is called recursion. \t computerization \m compute -er -ize -tion \g calculate -vnzr -nvzr -vnzr \p v -vsuf -nsuf -vsuf \c According to the "longest match" principle, because flower is in the lexical database, Shoebox doesn't produce the potential invalid parse flow -er. Therefore, the formulas aren't even needed to eliminate it. \t flower \m flower \g plant \p n \c Because there is only one parse, which happens to be correct, it doesn't matter that it doesn't match any formula \t admirable \m admire -able \g think_highly -vadjzr \p v -vsuf \c To select the correct parse, another word formula pattern is needed to match v followed by vadjzr \t bearable \m bear -able \g hold_up -vadjzr \p v -vsuf