||. But I don't think we can derive that big is a synonym of huge from such
an index.
Well, you can if you invert it:
0. Have an arbitrary "meaning" counter set to 0.
1. The first pair are new, so you increment your meaning counter and create
set #1 containing the first pair.
2. When subsequent p
P.S. What you suggest can be used as adjacency graph, and synonyms can be
found through good old Breath First Search on it to find a presence/absence
of path between two words.
On Saturday, April 10, 2021 at 4:04:41 AM UTC+2 dsblak...@gmail.com wrote:
> In practice I would probably just build a
Thanks Blake, the map of sets was my first intuition too. But I don't think
we can derive that big is a synonym of huge from such an index. If you look
at the example input.
On Saturday, April 10, 2021, Blake Watson wrote:
> In practice I would probably just build a map, word : #setofsynonyms an
In practice I would probably just build a map, word : #setofsynonyms and
whenever a synonym was added [a b], I would add b to a's set and a to b's
set.
Or, even more likely, a vector, because "a" is probably a homonym (if we're
talking English) and if "a" is "bank", I need one set of synonyms for
miniKanren has been ported by David Nolen as well and is part of the core
set of Clojure libraries:
https://github.com/clojure/core.logic
On Sunday, August 19, 2012 5:42:15 PM UTC-4, David Nolen wrote:
>
> On Fri, Aug 17, 2012 at 11:45 PM, Benjamin Chi
> >
> wrote:
> > Hi Jim. Where is that l
On Fri, Aug 17, 2012 at 11:45 PM, Benjamin Chi wrote:
> Hi Jim. Where is that located? Thanks.
>
http://github.com/jduey/mini-kanren
--
You received this message because you are subscribed to the Google
Groups "Clojure" group.
To post to this group, send email to clojure@googlegroups.com
Note t
Hi Jim. Where is that located? Thanks.
On Sunday, May 25, 2008 10:28:29 PM UTC-4, jim wrote:
>
> I just uploaded a file to the files area that implements a logic
> programming system from the book "The Reasoned Schemer" in Clojure.
>
> This book is a sequel to "The Little Schemer" and I was havi
No. That's one of the improvements I would make if I get back to
working on it again.
Jim
On Mar 26, 1:37 pm, Sophie wrote:
>
> Is it aware of all Clojure structures, including maps etc?
--
You received this message because you are subscribed to the Google
Groups "Clojure" group.
To post to th
Really nice!
Is it aware of all Clojure structures, including maps etc?
--
You received this message because you are subscribed to the Google
Groups "Clojure" group.
To post to this group, send email to clojure@googlegroups.com
Note that posts from new members are moderated - please be patient w
As well as optimizing compilers, there are many knowledge bases
available for prolog. Most people with a practical application that
needs an expert system are probably far more invested in that
knowledge base (the prolog code is a 'knowledge base') than in
anything else.
--
You received this mess
I've got to say that I'm not a logic programming guru. Mostly I just
see the promise there. The observation about graph search came from
the book "Simply Logical" that I linked to at the end, I believe. I
certainly didn't originate it.
If you check out Oleg's page, you'll find a lot of papers abou
On 23.03.2010, at 18:26, Quzanti wrote:
> I say that because my first thought is if you could build a logic
> language on top of LISP then would prolog be needed as the other AI
> language?
Why do we need the hundreds of programming languages we have? We don't. It's
just that different people ha
Very interesting write up.
What advantages would prolog have over such a language. Or if we are
trying to move beyond language wars - what styles of logic programming
would be more natural in either one or the other?
I say that because my first thought is if you could build a logic
language on to
On Feb 24, 3:28 pm, Chouser wrote:
> On Tue, Feb 24, 2009 at 1:18 PM, Michel S. wrote:
>
> > Kanren / Mini Kanren (Mini is the version in Reasoned Schemer) are MIT-
> > licensed:
>
> >http://kanren.sourceforge.net/#Availability
>
> > so even a port is alright.
>
> The problem is that to be inc
On Tue, Feb 24, 2009 at 1:18 PM, Michel S. wrote:
>
> Kanren / Mini Kanren (Mini is the version in Reasoned Schemer) are MIT-
> licensed:
>
> http://kanren.sourceforge.net/#Availability
>
> so even a port is alright.
The problem is that to be included in contrib, it needs to be the
original work
Good to know. Thanks.
Michel S. wrote:
> On Feb 24, 11:03 am, Rich Hickey wrote:
> Kanren / Mini Kanren (Mini is the version in Reasoned Schemer) are MIT-
> licensed:
>
> http://kanren.sourceforge.net/#Availability
>
> so even a port is alright. When I took Dan Friedman's class based on
> the b
On Feb 24, 11:03 am, Rich Hickey wrote:
> On Feb 24, 9:56 am, jim wrote:
>
> > One stepping stone to getting my parenscript-like javascript generator
> > released is to get the logic programming module released. A couple of
> > months ago, I implemented the system from "The Reasoned Schemer"
Hadn't thought of that. There are two parts, the unification part and
the implementation of the operators. In the interest of time and
learning, I originally did a port of both parts. What I've since done
is re-implement the operators, so that's a totally original
implementation using lazy sequ
On Feb 24, 9:56 am, jim wrote:
> One stepping stone to getting my parenscript-like javascript generator
> released is to get the logic programming module released. A couple of
> months ago, I implemented the system from "The Reasoned Schemer" in
> Clojure and posted it to the files section. I
19 matches
Mail list logo
