Class: Tyccl

Inherits:
Object
  • Object
show all
Defined in:
lib/tyccl.rb,
lib/tyccl/version.rb

Overview

:nodoc:all

Constant Summary collapse

VERSION = 
"0.0.2"

Class Method Summary collapse

Class Method Details

.combine_id(frame) ⇒ Object

the method #cut_id`s inverse process.



339
340
341
342
343
344
345
 
# File 'lib/tyccl.rb', line 339

def self.combine_id(frame)
  m=""
  frame.each{|seg|
    m << seg
  }
  return m
end

.compare_id(idA, idB) ⇒ Object

Given idA(string) and idB(string). Returns fisrt diffrent place of their segment, place vlaues in. if they are the same , returns 5.



350
351
352
353
354
355
356
357
358
359
 
# File 'lib/tyccl.rb', line 350

def self.compare_id(idA, idB) 
  frameA=cut_id(idA)
  frameB=cut_id(idB)
  0.upto(frameA.length-1){ |i|
    if frameA[i].eql?(frameB[i]) == false
      return i
    end
  }
  return 5
end

.cut_id(id) ⇒ Object

Given a id(string). Returns an array that contains 5 strings which are ID`s diffrent segment, like: A，a，01，A，01= .



333
334
335
336
 
# File 'lib/tyccl.rb', line 333

def self.cut_id(id)
  frame=[id[0],id[1],id[2..3],id[4],id[5..7]]
  return frame
end

.dist(wordA, wordB) ⇒ Object

Given wordA(string) and wordB(string). Returns a Struct Result_t which contains idA, idB, and shortest semantic distance(int) between wordA and wordB.



254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
 
# File 'lib/tyccl.rb', line 254

def self.dist(wordA, wordB)
  alpha=10.0/5
  shortest_Pair = Result_t.new(100,"","")
  idAs = get_ids_by_word(wordA)
  idBs = get_ids_by_word(wordB)

  idAs.each{ |idA|
    idBs.each{ |idB|
      n = compare_id(idA,idB)
        distance = (alpha*(5-n)).round
      if distance < shortest_Pair.value
        shortest_Pair.value = distance
        shortest_Pair.x_id = idA
        shortest_Pair.y_id = idB
      end
    }
  }
  return shortest_Pair
end

.gen_findstring(code, start_index) ⇒ Object

Given a word(string) and start_index(int),start_index`s value range is [0,4], corresponding Cilin(同义词词林) ID`s different segment: A，a，01，A，01=. Returns a string that is used ‘.’ to explace every char from the start_index to the string`s end.



320
321
322
323
324
325
326
327
328
 
# File 'lib/tyccl.rb', line 320

def self.gen_findstring(code, start_index)
  frame = cut_id(code)
  (start_index).upto(4){|i|
  	0.upto(frame[i].size-1){ |j|
  		frame[i][j]='.'
  	}
  }
  combine_id(frame)
end

.get_dist_by_id(idA, idB) ⇒ Object

Given idA(string) and idB(string). Returns semantic distance(int) between idA and idB, values in [0,10].



221
222
223
224
225
 
# File 'lib/tyccl.rb', line 221

def self.get_dist_by_id(idA, idB)
	alpha=10.0/5
	n = compare_id(idA,idB)
	(alpha*(5-n)).round
end

.get_equal(word) ⇒ Object

Given a word(string). Returns a two dimensional array that contains the parameter Word`s equivalent words which divided by different ID that the word matchs. If the word has no synonym, nil is returned.



175
176
177
178
179
180
181
182
183
184
185
186
187
 
# File 'lib/tyccl.rb', line 175

def self.get_equal(word)
  if has_equal?(word)
    equal_words=[]
    ids = get_ids_by_word(word)
    ids.each{ |code|
      if code[-1]=="#"
        equal_words << get_words_by_id(code)
      end
    }
    return equal_words
  end
  return nil
end

.get_id_sum ⇒ Object

Returns the total number of different ID in Cilin.



362
363
364
 
# File 'lib/tyccl.rb', line 362

def self.get_id_sum
	@IDsIndex.size
end

.get_ids_by_wildcard(wildcard) ⇒ Object

Returns a sorted array containing IDs(string) that match the parameter Wildcard(string). The wildcard characters that match any character are ‘*’ and ‘.’ such as “Aa01A..=”,“Aa**A…” If no match is found, an empty array is returned.



81
82
83
 
# File 'lib/tyccl.rb', line 81

def self.get_ids_by_wildcard(wildcard)
  @IDsTrie.wildcard(wildcard)
end

.get_ids_by_word(word) ⇒ Object

Returns an array containing IDs(string) that the parameter Word(string) matchs.

tips: the same word may have a few semantic meanings, so a word can match many IDs.



88
89
90
91
92
93
94
95
96
 
# File 'lib/tyccl.rb', line 88

def self.get_ids_by_word(word)
  m = @index[word]
	if(m==nil)
		@logger.error(word+" is an unlisted word!")
		return nil
	else
		return m
	end
end

.get_index_sum ⇒ Object

Returns the total number of different words in Cilin.



367
368
369
 
# File 'lib/tyccl.rb', line 367

def self.get_index_sum
	@index.size
end

.get_same(word) ⇒ Object

Given a word(string). Returns a two dimensional array that contains the parameter Word`s synonym which divided by different ID that the word matchs. If the word has no synonym, nil is returned.



157
158
159
160
161
162
163
164
165
166
167
168
169
 
# File 'lib/tyccl.rb', line 157

def self.get_same(word)
  if has_same?(word)
    same_words=[]
    ids = get_ids_by_word(word)
    ids.each{ |code|
      if code[-1]=="="
       same_words << get_words_by_id(code)
      end
    }
    return same_words
  end
  return nil
end

.get_sim_by_id(idA, idB) ⇒ Object

Given idA(string) and idB(string). Returns similarity(float) between idA and idB, values in [0,1].



229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
 
# File 'lib/tyccl.rb', line 229

def self.get_sim_by_id(idA, idB)
 	n = compare_id(idA,idB)
  str = idA.clone   
  if n==0
    _sim = factor[0]
  elsif n==5
    if idA[-1] == "="
      _sim = factor[5]
    elsif idA[-1] == "#"
      _sim = factor[6]
    elsif idA[-1] == "@"
      _sim = factor[5]
    end
	elsif n < 5
	  findstring=gen_findstring(str,n)
    node_num = @IDsTrie.wildcard(findstring).size
    k = (@IDsIndex[idA]-@IDsIndex[idB]).abs
    _sim = factor[n]*(Math.cos(node_num*Math::PI/180)).abs*((node_num-k+1)*1.0/node_num)
  end
  return _sim
end

.get_similar(word, level = 4) ⇒ Object

Given a word(string) and a level(int),level`s value range is [0,4], 4 is default, value of level is more bigger, the similarity between returned words and the given word is more less.

Returns a two dimensional array that contains the parameter Word`s similar words which divided by different ID that the word matchs. If the word has no similar, nil is returned.

tips: level 0,1,2,3,4 correspond Cilin(同义词词林) ID`s different segment: A，a，01，A，01=.



198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
 
# File 'lib/tyccl.rb', line 198

def self.get_similar(word, level=4)
	ids = get_ids_by_word(word)
  similar=[]
  ids.each{ |code|
    mini_similar=[]
    findstring = gen_findstring(code, level+1)
    similar_IDs=@IDsTrie.wildcard(findstring)
    similar_IDs.each{|item|
      get_words_by_id(item).each{|term|
        mini_similar << term
      }
    }
    similar << mini_similar
  }
  if similar.size > 0
  	return similar
  else
  	return nil
  end
end

.get_words_by_id(id) ⇒ Object

Given id(string) such as:“Aa01A01=” “Aa01A03#” Returns an array containing words(string) that match this id If no match is found, nil is returned.



74
75
76
 
# File 'lib/tyccl.rb', line 74

def self.get_words_by_id(id)
  @IDsTrie[id]
end

.has_equal?(word) ⇒ Boolean

Given a word(string). Test to see if the parameter Word has any equivalent word. Returns true or false.

Returns:

  • (Boolean) 


119
120
121
122
123
124
125
126
127
128
129
130
131
132
 
# File 'lib/tyccl.rb', line 119

def self.has_equal?(word)
  ids = get_ids_by_word(word)
  i=0
  flag=false
  while i < ids.size && flag==false  do
    if ids[i][-1]=="#"
      flag=true
    else
      flag=false
    end
    i+=1
  end
  return flag
end

.has_same?(word) ⇒ Boolean

Given a word(string). Test to see if the parameter Word has any synonym. Returns true or false.

Returns:

  • (Boolean) 


101
102
103
104
105
106
107
108
109
110
111
112
113
114
 
# File 'lib/tyccl.rb', line 101

def self.has_same?(word)
  ids = get_ids_by_word(word)
  i=0
  flag=false
  while i < ids.size && flag==false  do
    if ids[i][-1]=="="
      flag=true
    else
      flag=false
    end
    i+=1
  end
  return flag
end

.has_single?(word) ⇒ Boolean

Given a word(string). Test to see if the parameter Word has any ID whose corresponding words list just has only one element. Returns true or false.

Returns:

  • (Boolean) 


138
139
140
141
142
143
144
145
146
147
148
149
150
151
 
# File 'lib/tyccl.rb', line 138

def self.has_single?(word)
	ids = get_ids_by_word(word)
  i=0
  flag=false
  while i < ids.size && flag==false  do
    if ids[i][-1]=="@"
      flag=true
    else
      flag=false
    end
    i+=1
  end
  return flag
end

.sim(wordA, wordB) ⇒ Object

Given wordA(string) and wordB(string). Returns a Struct Result_t which contains the most similar Pairs wordA`s ID and wordB`s ID, and similarity(float) between idA and idB.



277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
 
# File 'lib/tyccl.rb', line 277

def self.sim(wordA, wordB)
  factor=[0.02,0.65,0.8,0.9,0.96,1,0.5]#0,1,2,3,4,5各层参数
  longest_Pair = Result_t.new(-1,"","")
  idAs = get_ids_by_word(wordA)
  idBs = get_ids_by_word(wordB)

  idAs.each{ |idA|
    idBs.each{ |idB|
      n = compare_id(idA,idB)
      str = idA.clone   
      if n==0
        _sim = factor[0]
      elsif n==5
        if idA[-1] == "="
          _sim = factor[5]
        elsif idA[-1] == "#"
          _sim = factor[6]
        elsif idA[-1] == "@"
          _sim = factor[5]
        end
    	elsif n < 5
    	  findstring=gen_findstring(str,n)
        node_num = @IDsTrie.wildcard(findstring).size
        k = (@IDsIndex[idA]-@IDsIndex[idB]).abs
        _sim = factor[n]*(Math.cos(node_num*Math::PI/180)).abs*((node_num-k+1)*1.0/node_num)
      end
      
      if _sim > longest_Pair.value
        longest_Pair.value = _sim
        longest_Pair.x_id = idA
        longest_Pair.y_id = idB
      end
    }
  }
  longest_Pair.value = ("%1.5f" % longest_Pair.value).to_f
  return longest_Pair
end