<div dir="ltr"><div><div>Dear Emily,<br><br></div>Last time, Dan gave us the instruction session of using FFTB. Here is the step-by-step instruction. I hope this will be of help!<br><br><a href="http://172.21.174.40/grameng/data/fftb_dan.txt">http://172.21.174.40/grameng/data/fftb_dan.txt</a><br><br></div>Sanghoun<br></div><div class="gmail_extra"><br><div class="gmail_quote">On Thu, Jan 8, 2015 at 9:38 AM, Emily M. Bender <span dir="ltr"><<a href="mailto:ebender@uw.edu" target="_blank">ebender@uw.edu</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div dir="ltr">Dear Woodley (cc: developers),<div><br></div><div>I have a grammar for Matsigenka which is wildly ambiguous (because it's automatically derived...) and I'd like to explore that ambiguity using FFTB. I have an [incr tsdb()] profile, but I can't find any documentation (starting from either AceTop or FftbTop) on how to create a full-forest profile with ace. Can you point me in the right direction?</div><div><br></div><div>Thanks,</div><div>Emily<span class="HOEnZb"><font color="#888888"><br clear="all"><div><br></div>-- <br><div><div dir="ltr">Emily M. Bender<br>Professor, Department of Linguistics<br>Check out CLMS on facebook! <a href="http://www.facebook.com/uwclma" target="_blank">http://www.facebook.com/uwclma</a><br></div></div> </font></span></div></div> </blockquote></div><br><br clear="all"><br>-- <br><div class="gmail_signature">====================================<br>Sanghoun Song<br>Ph.D. in Computational Linguistics | <a href="http://corpus.mireene.com" target="_blank">http://corpus.mireene.com</a><br>NTU Computational Linguistics Lab. | <a href="http://compling.hss.ntu.edu.sg" target="_blank">http://compling.hss.ntu.edu.sg</a><br>====================================</div> </div>