[Corpora-List] adaptive finite state automata (AFSA)

[Jon Awbrey]

o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o

How did evolution make the Evol Knevol jump
over the Grand Canyon between finite state
languages and non-finite state languages?

I once pursued a research program along these lines,
exploring the finite state or markov rim of the canyon
by writing a series of  programs for sequential learning
of 2-level formal languages.

Though it's not much help with the complexities of bona fide
natural languages, it did give me some insight into how much
can be done with adaptive finite state transition trees in a
real-time environment.

The crux of the matter, however, seems to reside in the more broadly
logical question about the gap between simple inductive learning and
abductive inquiry by way of hypothesis testing.

I will be travelling soon, but can look up some links to previous work
and discussions if anyone wants them.

Jon Awbrey

CC: Arisbe, CG List, Inquiry

Albretch Mueller wrote:
> 
> As we well know, there are many languages that are very similar.
> In many cases, to a large extent if not fully, they share the
> same alphabet, syntax rules and even phonemes.
> 
> So, since parsers are essentially fed text sequentially (and naturally so)
> I wonder what are the strategies developed out there for pluggable parsing
> strategies (depth or breath first), some lexicon (which does not have to
> be totally complete) and rules describing the generative possibilities
> of this lexicon.
> 
> As you could tell I am not a linguist myself, but after reading
> James Allen's Natural Lang Understanding, in which he, even if the
> theory is general, exclusively uses plenty of examples of English,
> I think such an "English Grammar file" may not be that difficult
> to device and if you do it for English I could easily imagine
> that there are such files for other NL which definitely are
> less fractured/more homogeneous.
> 
> Where can you find actual well-formed, declarative description
> of some NL grammar including language features, constrains and
> everything (possible ;-)) in XML format or Backus-Naur form or
> such in-depth theoretical studies?
> 
>  thanks
>  lbrtchx

o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o
inquiry e-lab: http://stderr.org/pipermail/inquiry/
mwb: http://www.mywikibiz.com/Directory:Jon_Awbrey
mathweb: http://www.mathweb.org/wiki/User:Jon_Awbrey
getwiki: http://www.getwiki.net/-UserTalk:Jon_Awbrey
p2p wiki: http://www.p2pfoundation.net/User:JonAwbrey
planet math: http://planetmath.org/?op=userobjs;id=15246
zhongwen wp: http://zh.wikipedia.org/wiki/User:Jon_Awbrey
ontolog: http://ontolog.cim3.net/cgi-bin/wiki.pl?JonAwbrey
http://www.altheim.com/ceryle/wiki/Wiki.jsp?page=JonAwbrey
wp review: http://wikipediareview.com/index.php?showuser=5619
o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o


_______________________________________________
Corpora mailing list
Corpora at uib.no
http://mailman.uib.no/listinfo/corpora