Report Top Up a Node Prev Next Up a Map TOC Node Index File Index Page Bottom
PROXIMITY : Algorithm : Modified indiv_rand_rels (Again) published Sun, Apr 21, 2002 - 13:19 EDT

Modified indiv_rand_rels (Again)



The previous modification preferred basic level information to non-basic leve information. I thought that it would be helpful to have as much information as possible, so I modified this function to list all possession information that could be found.


Old indiv_rand_rels

;--------------------------------------------------------------------------
;
;	function: indiv_rand_rels
;	input:  a noun to be defined
;	output:	a list of those things which possess any object of type 
;		Note: needs to be refined/expanded.
;
;  modified: stn 2002
;    -- added non-basic case  
;--------------------------------------------------------------------------
(defun indiv_rand_rels (noun)
  (cond ((setq part1 
	   #3! ((find (compose lex- class- ! member possessor- ! rel lex) ~noun)))
	 (list 'a noun 'can 'belong 'to 'a part1))
	((setq part1 #3! ((find (compose lex- object2- ! object1 possessor- rel lex) ~noun
				(compose lex- object2- ! rel) "ISA")))
	 (list 'a noun 'can 'belong 'to 'a part1))
	 ))    

New indiv_rand_rels

;--------------------------------------------------------------------------
;
;	function: indiv_rand_rels
;	input:  a noun to be defined
;	output:	a list of those things which possess any object of type 
;		Note: needs to be refined/expanded.
;
;  modified: stn 2002
;    -- added non-basic case
;    -- changed to return data from all matched cases -- not just first
;--------------------------------------------------------------------------
(defun indiv_rand_rels (noun)
  (list 'a noun 'can 'belong 'to 'a 
; find possessors of all forms and make a list of them
	(append
	 #3! ((find (compose lex- class- ! member possessor- ! rel lex) ~noun))
	 #3! ((find (compose lex- object2- ! object1 possessor- rel lex) ~noun
		    (compose lex- object2- ! rel) "ISA")))
  ))    

Although this new function recognizes both basic level and non-basic level information, it prefers basic-level information to non-basic level information. Therefore when both passage 2 and passage 3 are run through the algorithm, only the information that "a proximity can belong to a satellite" is found, not "a proximity can belong to a (cave, satellite)".


Node authored by Scott Napieralski

PROXIMITY : Algorithm : Modified indiv_rand_rels (Again) published Sun, Apr 21, 2002 - 13:19 EDT
Report Top Up a Node Prev Next Up a Map TOC Node Index File Index Page Top