<html><head><meta http-equiv="Content-Type" content="text/html charset=utf-8"></head><body style="word-wrap: break-word; -webkit-nbsp-mode: space; -webkit-line-break: after-white-space;" class="">Hi Olga and Francis,<div class=""><br class=""></div><div class="">If what you want to do is define certain generic lexemes that apply to all words, you do not need a POS tagger at all.  You will need to enable token mapping, but not necessarily write any token mapping rules.  Next you need to create some lexical entries whose TDL status is "generic-lex-entry".  Each one of these will get instantiated on every token, so some caution will be wise.  The token feature structure gets unified into a grammar-defined path into the lexeme it licenses, so the explosion can be controlled by making constraints at that path.  When POS tagging is used, the POS info lives on the token feature structures, and typical unknown-word-aware DELPH-IN grammars use constraints on generic lexical entries’ tokens’ POS values to select which generic lexical entry applies in which POS situations.  You can also use the so-called "lexical filtering" stage to throw out some generic (or native if you want) lexical entries.  See the ERG’s lfr.tdl for examples (Dan uses this to discard generic lexemes proposed by the tagger in situations where the grammar has native lexical coverage).</div><div class=""><br class=""></div><div class="">If you find that you need help getting some portions of this airborne, let me know.</div><div class=""><br class=""></div><div class="">Regards,</div><div class="">Woodley</div><div class=""><br class=""><div><blockquote type="cite" class=""><div class="">On Jan 10, 2017, at 9:28 PM, Francis Bond <<a href="mailto:bond@ieee.org" class="">bond@ieee.org</a>> wrote:</div><br class="Apple-interchange-newline"><div class=""><div dir="ltr" class="">There is some discussion here (for PET):<div class=""><a href="http://moin.delph-in.net/PetInput" class="">http://moin.delph-in.net/PetInput</a><br class=""></div><div class=""><br class=""></div><div class="">the chart mapping approach also works for ACE.</div><div class=""><br class=""></div><div class="">You have to use an external POS tagger (which you could fake if all unknown words get the same POS).</div><div class=""><br class=""></div><div class="">We have this working for Zhong and Jacy (and I think INDRA).  I would be happy to walk you through it if you promise to enhance the documentation :-).</div><div class=""><br class=""></div></div><div class="gmail_extra"><br class=""><div class="gmail_quote">On Tue, Jan 10, 2017 at 4:57 PM, Olga Zamaraeva <span dir="ltr" class=""><<a href="mailto:olzama@uw.edu" target="_blank" class="">olzama@uw.edu</a>></span> wrote:<br class=""><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div dir="ltr" class="">Dear Developers,<div class=""><br class=""></div><div class="">I would like to parse some text (with ACE) using a small grammar and I am likely to encounter stems that I do not have in the lexicon. My understanding is that it is possible to add a generic lexical entry for e.g. "verb", and analyze some of the unknown words morphologically this way. I am looking for any documentation/advice on how this is done. Would anyone be able to point me to anything?</div><div class=""><br class=""></div><div class=""><br class=""></div><div class="">Thank you,</div><div class="">Olga</div></div> </blockquote></div><br class=""><br clear="all" class=""><div class=""><br class=""></div>-- <br class=""><div class="gmail_signature" data-smartmail="gmail_signature">Francis Bond <<a href="http://www3.ntu.edu.sg/home/fcbond/" target="_blank" class="">http://www3.ntu.edu.sg/home/fcbond/</a>><br class="">Division of Linguistics and Multilingual Studies<br class="">Nanyang Technological University<br class=""></div> </div> </div></blockquote></div><br class=""></div></body></html>