[developers] Parsing a profile with ace

Emily M. Bender ebender at uw.edu
Thu Jan 8 03:16:32 CET 2015


Thanks, Mike.

On Wed, Jan 7, 2015 at 6:14 PM, Michael Wayne Goodman <
goodmami at u.washington.edu> wrote:

> Yes, you can use Art: http://sweaglesw.org/linguistics/libtsdb/art
>
> $ art -a $ACECOMMAND path/to/profile
>
> The input profile is not a skeleton, but an empty instantiated
> profile. Use the bundled mkprof command to create an empty profile
> from a skeleton.
>
> ACECOMMAND is a string with the command that calls ACE. It might look like
> this:
>
> ACECOMMAND="path/to/ace -g path/to/compiled/grammar.dat"
>
> We've found out recently that you can pipe commands in that string,
> which we use for preprocessing:
>
> ACECOMMAND="preprocessor | ace ..."
>
> There's more info at the Art website and ACE's
> (http://sweaglesw.org/linguistics/ace/). Hope that helps
>
> On Thu, Jan 8, 2015 at 10:02 AM, Emily M. Bender <ebender at uw.edu> wrote:
> > Thanks, Mike.  Looks like those directions involve invoking ace via [incr
> > tsdb()] and assume the logon tree.  I can give that shot tomorrow on
> campus,
> > but for now I'm working with Ubuntu+LKB (so without the full logon
> > environment).  I thought there was a lighter-weight way of processing
> > profiles with ace and storing the results?
> >
> > Emily
> >
> > On Wed, Jan 7, 2015 at 5:57 PM, Michael Wayne Goodman
> > <goodmami at u.washington.edu> wrote:
> >>
> >> The URL might be only accessibly within NTU. I attach the text file.
> >>
> >> On Thu, Jan 8, 2015 at 9:52 AM, Emily M. Bender <ebender at uw.edu> wrote:
> >> > Thanks for the quick reply, Sanghoun! Unfortunately, that URL isn't
> >> > working
> >> > for me ... does it work for you?
> >> >
> >> > Google Chrome could not load the webpage because 172.21.174.40 took
> too
> >> > long
> >> > to respond. The website may be down, or you may be experiencing issues
> >> > with
> >> > your Internet connection.
> >> >
> >> > On Wed, Jan 7, 2015 at 5:44 PM, Sanghoun Song <sanghoun at uw.edu>
> wrote:
> >> >>
> >> >> Dear Emily,
> >> >>
> >> >> 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!
> >> >>
> >> >> http://172.21.174.40/grameng/data/fftb_dan.txt
> >> >>
> >> >> Sanghoun
> >> >>
> >> >> On Thu, Jan 8, 2015 at 9:38 AM, Emily M. Bender <ebender at uw.edu>
> wrote:
> >> >>>
> >> >>> Dear Woodley (cc: developers),
> >> >>>
> >> >>> 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?
> >> >>>
> >> >>> Thanks,
> >> >>> Emily
> >> >>>
> >> >>> --
> >> >>> Emily M. Bender
> >> >>> Professor, Department of Linguistics
> >> >>> Check out CLMS on facebook! http://www.facebook.com/uwclma
> >> >>
> >> >>
> >> >>
> >> >>
> >> >> --
> >> >> ====================================
> >> >> Sanghoun Song
> >> >> Ph.D. in Computational Linguistics | http://corpus.mireene.com
> >> >> NTU Computational Linguistics Lab. | http://compling.hss.ntu.edu.sg
> >> >> ====================================
> >> >
> >> >
> >> >
> >> >
> >> > --
> >> > Emily M. Bender
> >> > Professor, Department of Linguistics
> >> > Check out CLMS on facebook! http://www.facebook.com/uwclma
> >>
> >>
> >>
> >> --
> >> -Michael Wayne Goodman
> >
> >
> >
> >
> > --
> > Emily M. Bender
> > Professor, Department of Linguistics
> > Check out CLMS on facebook! http://www.facebook.com/uwclma
>
>
>
> --
> -Michael Wayne Goodman
>



-- 
Emily M. Bender
Professor, Department of Linguistics
Check out CLMS on facebook! http://www.facebook.com/uwclma
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.delph-in.net/archives/developers/attachments/20150107/73af8f9a/attachment-0001.html>


More information about the developers mailing list