From mboxrd@z Thu Jan 1 00:00:00 1970 Received: (from majordomo@localhost) by pauillac.inria.fr (8.7.6/8.7.3) id NAA13308; Wed, 9 Apr 2003 13:34:13 +0200 (MET DST) X-Authentication-Warning: pauillac.inria.fr: majordomo set sender to owner-caml-list@pauillac.inria.fr using -f Received: from concorde.inria.fr (concorde.inria.fr [192.93.2.39]) by pauillac.inria.fr (8.7.6/8.7.3) with ESMTP id NAA13370 for ; Wed, 9 Apr 2003 13:34:12 +0200 (MET DST) Received: from fichte.ai.univie.ac.at (fichte.ai.univie.ac.at [131.130.174.156]) by concorde.inria.fr (8.11.1/8.11.1) with ESMTP id h39BYBX18873 for ; Wed, 9 Apr 2003 13:34:11 +0200 (MET DST) Received: from fichte.ai.univie.ac.at (markus@localhost.ai.univie.ac.at [127.0.0.1]) by fichte.ai.univie.ac.at (8.12.3/8.12.3/Debian-6.3) with ESMTP id h39BY5gN022033; Wed, 9 Apr 2003 13:34:05 +0200 Received: (from markus@localhost) by fichte.ai.univie.ac.at (8.12.3/8.12.3/Debian-6.3) id h39BY4dH022030; Wed, 9 Apr 2003 13:34:04 +0200 Date: Wed, 9 Apr 2003 13:34:04 +0200 From: Markus Mottl To: Yang Shouxun Cc: caml-list@inria.fr Subject: Re: [Caml-list] stack overflow Message-ID: <20030409113404.GB21649@mail4.ai.univie.ac.at> Mail-Followup-To: Yang Shouxun , caml-list@inria.fr References: <200304091045.25094.yangsx@fltrp.com> <20030409081451.GA18772@mail4.ai.univie.ac.at> <200304091723.30890.yangsx@fltrp.com> Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Disposition: inline In-Reply-To: <200304091723.30890.yangsx@fltrp.com> User-Agent: Mutt/1.3.28i Organization: Austrian Research Institute for Artificial Intelligence X-Spam: no; 0.00; caml-list:01 shouxun:01 isomorphism:01 context-free:99 annotated:01 ulimit:01 aifad:01 retrieval:99 implemented:01 computed:01 closure:01 int:01 overflow:02 signatures:02 mottl:02 Sender: owner-caml-list@pauillac.inria.fr Precedence: bulk On Wed, 09 Apr 2003, Yang Shouxun wrote: > My training data contain statistical values for word combinations (or > collocations) extracted from a corpus. The number is indeed very large. Funny, I am currently also applying my tool to NLP (natural language processing): because of the isomorphism between context-free grammars and algebraic datatyes, it is possible to learn propositions about derivation trees (or even more general: learn non-recursive functions). The problem there is rather the size of CFG extracted from a large, annotated corpus for German (many, many thousands of productions), which really looks messy. > I've learned this style in Scheme. Yet I feel paralyzed when trying to write > in it to build trees. The type declaration may make my point clearer. > --8<-- > type dtree = Dnode of dnode | Dtree of (dnode * int * dtree list) > --8<-- > The problems are that unless the next call returns, the tree is not complete > yet and it may have several calls on itself. But that's what the closure is for: it abstracts away the subtree that still needs to be computed. > I'm running Debian unstale. I checked just now on my laptop and "ulimit -s" > reurned "unlimited". I suppose the desktop that actually ran the program was > similarly configured. Given that you already run into problems for comparatively small sizes, I suppose that you are using the byte-code interpreter? Its builtin stack space is 256KB, i.e. 64K-words. > I also downloaded your AIFAD and had a cursive look at it. I found it > does not handle continuous attributes yet and your design goal is quite > different from mine. So I wrote mine from scratch and called it DTLR > (Decision Tree Learner for Retrieval). Yes, I haven't yet implemented handling of continuous attributes, because I am aiming at an even more general system, where you can specify abstract algebras (signatures) that describe how to handle values of some abstract types, i.e. not only continuous (numeric) values. I have already done so separately in another project, but wasn't very satisfied with the design. Furthermore, I'd like to integrate it into AIFAD. > If you are interested, I can send a copy to you tomorrow. It does not > implement all the features I planned, without documentation except some > comments, but it is enough for my own needs right now. That would be great! - Thanks! Regards, Markus -- Markus Mottl http://www.oefai.at/~markus markus@oefai.at ------------------- To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/ Beginner's list: http://groups.yahoo.com/group/ocaml_beginners