[lojban] Re: jimpe: Language Processing in Lojban

[Philip Newton <lojban-out@lojban.org>]

On Fri, 30 Jul 2004 12:04:37 -0400, Rob Speer <rspeer@mit.edu> wrote:
> But if anyone has suggestions on how to determine which terminators are
> elidable (for example, how does Nora's random sentence generator do it?) that
> would be really helpful for the project.

You could have a look at jbofihe; its source code is available, and it
has a mode called "show elidable terminators" which will tell you
which terminators in a given text are elidable - if several
combinations are possible, it will tell you all of them.

For example:

$ jbofihe.exe -se
broda le nu brode le brodi ku kei ku le brodo vau
^Z
The words 'ku kei ku'
 (from line 1 col 28 to line 1 col 35)
could be safely reduced to any of these minimal patterns:
  Pattern 1 :  kei
  Pattern 2 :  ku ku

You could omit the word 'vau' (at line 1 col 47)

(0[broda {<(1le [nu {brode <le brodi ku>} kei] ku)1 (1le brodo)1> vau}])0


mu'o mi'e .filip.
-- 
Philip Newton <philip.newton@gmail.com>