Re: SIL Toolbox and IPA Unicode 1.0
From: | Jeremy Kleier <jhereg9333@...> |
Date: | Thursday, September 2, 2004, 13:16 |
Amanda Babcock Furrow wrote:
>Short of me learning Python and reading Kura source, does anybody know
>where I can find an algorithm to parse text into known morphemes? How
>do Toolbox and its ilk do it?
I haven't seen this properly addressed and I'm something of a volunteer
evangelist (but I'll try to restrain myself). If you are familiar with any
programming language, you can probably learn Python in an afternoon (go
through the tutorial that comes with the distribution). If you haven't
programmed anything before, then, in all honesty, Python is probably the
best place to start. I'll personally extend my help to anyone who has
questions or would like help in the endeavor.
As a side note, I have been developing Python code (using Tkinter for the
GUI) to build help utilities for my conlang. At first, I used Excel to
handle the expansion from stems into full words by appending the affixes,
but I found that too restrictive about how the affixes were actually
applied, it was too difficult to make Excel handle exceptions, on the other
hand, Python lets me write fairly simple code for the same exceptions.
Just my two cents...
Jeremy Kleier
_________________________________________________________________
Get ready for school! Find articles, homework help and more in the Back to
School Guide! http://special.msn.com/network/04backtoschool.armx