rake-text 1.0.1

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: e1fcb875e8a81148b9d549f6b4745d891daf0526
+  data.tar.gz: 4927d7e77f3b4913b2f9752040a6a7e12f251b0f
+SHA512:
+  metadata.gz: bb9a3b526573090ae0c0ed26ebc09cf5599c6388b764fa500cdbabf6f5bfbccff01afd6d831f9d7c63eb3a43852e7e5f4afcdb2142dac2aa3019adc3d47e3c19
+  data.tar.gz: 5c9304e25a04afc1db23fe4cd07cd3bd578aedfe60de774e314b712e73abfecdfd4ddf6898fc114b7aafa515dc8ddb5e45a8d40a45ad2771a6118aa77a121700

data/LICENSE.md

@@ -0,0 +1,5 @@
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

data/data/stoplists/default.stoplist

@@ -0,0 +1,572 @@
+#stop word list from SMART (Salton,1971).  Available at ftp://ftp.cs.cornell.edu/pub/smart/english.stop
+a
+a's
+able
+about
+above
+according
+accordingly
+across
+actually
+after
+afterwards
+again
+against
+ain't
+all
+allow
+allows
+almost
+alone
+along
+already
+also
+although
+always
+am
+among
+amongst
+an
+and
+another
+any
+anybody
+anyhow
+anyone
+anything
+anyway
+anyways
+anywhere
+apart
+appear
+appreciate
+appropriate
+are
+aren't
+around
+as
+aside
+ask
+asking
+associated
+at
+available
+away
+awfully
+b
+be
+became
+because
+become
+becomes
+becoming
+been
+before
+beforehand
+behind
+being
+believe
+below
+beside
+besides
+best
+better
+between
+beyond
+both
+brief
+but
+by
+c
+c'mon
+c's
+came
+can
+can't
+cannot
+cant
+cause
+causes
+certain
+certainly
+changes
+clearly
+co
+com
+come
+comes
+concerning
+consequently
+consider
+considering
+contain
+containing
+contains
+corresponding
+could
+couldn't
+course
+currently
+d
+definitely
+described
+despite
+did
+didn't
+different
+do
+does
+doesn't
+doing
+don't
+done
+down
+downwards
+during
+e
+each
+edu
+eg
+eight
+either
+else
+elsewhere
+enough
+entirely
+especially
+et
+etc
+even
+ever
+every
+everybody
+everyone
+everything
+everywhere
+ex
+exactly
+example
+except
+f
+far
+few
+fifth
+first
+five
+followed
+following
+follows
+for
+former
+formerly
+forth
+four
+from
+further
+furthermore
+g
+get
+gets
+getting
+given
+gives
+go
+goes
+going
+gone
+got
+gotten
+greetings
+h
+had
+hadn't
+happens
+hardly
+has
+hasn't
+have
+haven't
+having
+he
+he's
+hello
+help
+hence
+her
+here
+here's
+hereafter
+hereby
+herein
+hereupon
+hers
+herself
+hi
+him
+himself
+his
+hither
+hopefully
+how
+howbeit
+however
+i
+i'd
+i'll
+i'm
+i've
+ie
+if
+ignored
+immediate
+in
+inasmuch
+inc
+indeed
+indicate
+indicated
+indicates
+inner
+insofar
+instead
+into
+inward
+is
+isn't
+it
+it'd
+it'll
+it's
+its
+itself
+j
+just
+k
+keep
+keeps
+kept
+know
+knows
+known
+l
+last
+lately
+later
+latter
+latterly
+least
+less
+lest
+let
+let's
+like
+liked
+likely
+little
+look
+looking
+looks
+ltd
+m
+mainly
+many
+may
+maybe
+me
+mean
+meanwhile
+merely
+might
+more
+moreover
+most
+mostly
+much
+must
+my
+myself
+n
+name
+namely
+nd
+near
+nearly
+necessary
+need
+needs
+neither
+never
+nevertheless
+new
+next
+nine
+no
+nobody
+non
+none
+noone
+nor
+normally
+not
+nothing
+novel
+now
+nowhere
+o
+obviously
+of
+off
+often
+oh
+ok
+okay
+old
+on
+once
+one
+ones
+only
+onto
+or
+other
+others
+otherwise
+ought
+our
+ours
+ourselves
+out
+outside
+over
+overall
+own
+p
+particular
+particularly
+per
+perhaps
+placed
+please
+plus
+possible
+presumably
+probably
+provides
+q
+que
+quite
+qv
+r
+rather
+rd
+re
+really
+reasonably
+regarding
+regardless
+regards
+relatively
+respectively
+right
+s
+said
+same
+saw
+say
+saying
+says
+second
+secondly
+see
+seeing
+seem
+seemed
+seeming
+seems
+seen
+self
+selves
+sensible
+sent
+serious
+seriously
+seven
+several
+shall
+she
+should
+shouldn't
+since
+six
+so
+some
+somebody
+somehow
+someone
+something
+sometime
+sometimes
+somewhat
+somewhere
+soon
+sorry
+specified
+specify
+specifying
+still
+sub
+such
+sup
+sure
+t
+t's
+take
+taken
+tell
+tends
+th
+than
+thank
+thanks
+thanx
+that
+that's
+thats
+the
+their
+theirs
+them
+themselves
+then
+thence
+there
+there's
+thereafter
+thereby
+therefore
+therein
+theres
+thereupon
+these
+they
+they'd
+they'll
+they're
+they've
+think
+third
+this
+thorough
+thoroughly
+those
+though
+three
+through
+throughout
+thru
+thus
+to
+together
+too
+took
+toward
+towards
+tried
+tries
+truly
+try
+trying
+twice
+two
+u
+un
+under
+unfortunately
+unless
+unlikely
+until
+unto
+up
+upon
+us
+use
+used
+useful
+uses
+using
+usually
+uucp
+v
+value
+various
+very
+via
+viz
+vs
+w
+want
+wants
+was
+wasn't
+way
+we
+we'd
+we'll
+we're
+we've
+welcome
+well
+went
+were
+weren't
+what
+what's
+whatever
+when
+whence
+whenever
+where
+where's
+whereafter
+whereas
+whereby
+wherein
+whereupon
+wherever
+whether
+which
+while
+whither
+who
+who's
+whoever
+whole
+whom
+whose
+why
+will
+willing
+wish
+with
+within
+without
+won't
+wonder
+would
+would
+wouldn't
+x
+y
+yes
+yet
+you
+you'd
+you'll
+you're
+you've
+your
+yours
+yourself
+yourselves
+z
+zero

data/data/stoplists/fox.stoplist

@@ -0,0 +1,426 @@
+#From "A stop list for general text" Fox 1989
+a
+about
+above
+across
+after
+again
+against
+all
+almost
+alone
+along
+already
+also
+although
+always
+among
+an
+and
+another
+any
+anybody
+anyone
+anything
+anywhere
+are
+area
+areas
+around
+as
+ask
+asked
+asking
+asks
+at
+away
+b
+back
+backed
+backing
+backs
+be
+because
+became
+become
+becomes
+been
+before
+began
+behind
+being
+beings
+best
+better
+between
+big
+both
+but
+by
+c
+came
+can
+cannot
+case
+cases
+certain
+certainly
+clear
+clearly
+come
+could
+d
+did
+differ
+different
+differently
+do
+does
+done
+down
+downed
+downing
+downs
+during
+e
+each
+early
+either
+end
+ended
+ending
+ends
+enough
+even
+evenly
+ever
+every
+everybody
+everyone
+everything
+everywhere
+f
+face
+faces
+fact
+facts
+far
+felt
+few
+find
+finds
+first
+for
+four
+from
+full
+fully
+further
+furthered
+furthering
+furthers
+g
+gave
+general
+generally
+get
+gets
+give
+given
+gives
+go
+going
+good
+goods
+got
+great
+greater
+greatest
+group
+grouped
+grouping
+groups
+h
+had
+has
+have
+having
+he
+her
+herself
+here
+high
+higher
+highest
+him
+himself
+his
+how
+however
+i
+if
+important
+in
+interest
+interested
+interesting
+interests
+into
+is
+it
+its
+itself
+j
+just
+k
+keep
+keeps
+kind
+knew
+know
+known
+knows
+l
+large
+largely
+last
+later
+latest
+least
+less
+let
+lets
+like
+likely
+long
+longer
+longest
+m
+made
+make
+making
+man
+many
+may
+me
+member
+members
+men
+might
+more
+most
+mostly
+mr
+mrs
+much
+must
+my
+myself
+n
+necessary
+need
+needed
+needing
+needs
+never
+new
+newer
+newest
+next
+no
+non
+not
+nobody
+noone
+nothing
+now
+nowhere
+number
+numbered
+numbering
+numbers
+o
+of
+off
+often
+old
+older
+oldest
+on
+once
+one
+only
+open
+opened
+opening
+opens
+or
+order
+ordered
+ordering
+orders
+other
+others
+our
+out
+over
+p
+part
+parted
+parting
+parts
+per
+perhaps
+place
+places
+point
+pointed
+pointing
+points
+possible
+present
+presented
+presenting
+presents
+problem
+problems
+put
+puts
+q
+quite
+r
+rather
+really
+right
+room
+rooms
+s
+said
+same
+saw
+say
+says
+second
+seconds
+see
+seem
+seemed
+seeming
+seems
+sees
+several
+shall
+she
+should
+show
+showed
+showing
+shows
+side
+sides
+since
+small
+smaller
+smallest
+so
+some
+somebody
+someone
+something
+somewhere
+state
+states
+still
+such
+sure
+t
+take
+taken
+than
+that
+the
+their
+them
+then
+there
+therefore
+these
+they
+thing
+things
+think
+thinks
+this
+those
+though
+thought
+thoughts
+three
+through
+thus
+to
+today
+together
+too
+took
+toward
+turn
+turned
+turning
+turns
+two
+u
+under
+until
+up
+upon
+us
+use
+uses
+used
+v
+very
+w
+want
+wanted
+wanting
+wants
+was
+way
+ways
+we
+well
+wells
+went
+were
+what
+when
+where
+whether
+which
+while
+who
+whole
+whose
+why
+will
+with
+within
+without
+work
+worked
+working
+works
+would
+x
+y
+year
+years
+yet
+you
+young
+younger
+youngest
+your
+yours
+z

data/lib/rake_text.rb

@@ -0,0 +1,3 @@
+require_relative 'rake_text/version'
+require_relative 'rake_text/engine'
+require_relative 'rake_text/stoplist'

data/lib/rake_text/engine.rb

@@ -0,0 +1,122 @@
+module RakeText
+  class Engine
+    @stoplist = nil
+
+    def initialize(stoplist_file = '')
+      @stoplist = Stoplist.new(stoplist_file)
+    end
+
+    def sentences(text)
+      # Get words from the text
+      words = text.split(/[.!?,;:\t\-"\(\)']/).map { |word| word.strip.downcase }
+
+      # Remove empty
+      words = words.select { |x| x != '' }
+
+      # Return the words
+      return words
+    end
+
+    def phrases(sentences)
+      # Hold phrases for output
+      phrases = Array.new
+
+      # Loop through the sentences
+      sentences.each do |sentence|
+        # Remove the stop-words
+        sentence = sentence.gsub(@stoplist.pattern, '|').split('|')
+
+        # Split into phrases
+        temp = sentence.map { |x| x.strip.downcase }
+
+        # Remove empty phrases
+        temp = temp.reject { |x| x.empty? }
+
+        # Add to output
+        phrases.concat(temp)
+      end
+
+      # Return the phrases
+      return phrases
+    end
+
+    def words(text)
+      # Split the string into words
+      words = text.split(/[\P{L}+]/)
+
+      # Clean the words
+      words = words.map { |x| x.strip.downcase }
+
+      # Remove empty words
+      words = words.reject { |x| x.empty? }
+
+      # Return the words
+      return words
+
+    end
+
+    def word_scores(phrases)
+      # Hold output
+      frequency = Hash.new(0)
+      degree = Hash.new(0)
+      score = Hash.new(0)
+
+      # Loop through the phrases
+      phrases.each do |phrase|
+        # Get words
+        words = words(phrase)
+
+        # Loop words
+        words.each do |word|
+          frequency[word] += 1
+          degree[word] += words.length
+        end
+      end
+
+      # Calculate store
+      frequency.each do |word, counter|
+        score[word] = (degree[word] + counter) / (counter * 1.0)
+      end
+
+      # Return the score
+      return score
+    end
+
+    def phrase_scores(phrases)
+      # Get word scores
+      word_scores = word_scores(phrases)
+
+      # Hold candidates
+      candidates = Hash.new(0)
+
+      # Loop phrases
+      phrases.each do |phrase|
+        # Get words
+        words = words(phrase)
+
+        # Loop words and get scores
+        words.each { |word| candidates[phrase] += word_scores[word] }
+      end
+
+      # Return the candidates
+      return candidates
+    end
+
+    def analyse(text, min_score = 0)
+      # Get sentences
+      sentences = sentences(text)
+
+      # Get phrases
+      phrases = phrases(sentences)
+
+      # Get phrase-scores
+      phrase_scores = phrase_scores(phrases)
+
+      # Delete phrases with too low scores
+      return phrase_scores.reject { |key, value| value < min_score }
+    end
+
+    private :sentences, :phrases, :words, :word_scores, :phrase_scores
+    attr_reader :stoplist
+  end
+end

data/lib/rake_text/stoplist.rb

@@ -0,0 +1,54 @@
+module RakeText
+  class Stoplist
+
+    def initialize(file_path = '')
+      unless file_path.empty?
+        self.load_file(file_path)
+      else
+        self.load_default
+      end
+    end
+
+    def load_default
+      self.load_file(File.join( File.dirname(__FILE__), '../../data/stoplists/default.stoplist'))
+    end
+
+    def load_fox
+      self.load_file(File.join( File.dirname(__FILE__), '../../data/stoplists/fox.stoplist'))
+    end
+
+    def clear
+      @words = []
+    end
+
+    def add(word)
+      @words.push(word)
+    end
+
+    def load_file(file_path)
+      # Reset word array
+      @words = []
+
+      # Open the file
+      file = File.new(file_path)
+
+      # Loop the files contents
+      while (line = file.gets)
+        # Check if it's a comment
+        if line.strip[0] == '#' then next end
+
+        # Loop the words on the line
+        line.split(/ /).each { |word| @words.push(word.strip) }
+      end
+    end
+
+    def words
+      return @words
+    end
+
+    def pattern
+      pattern = @words.map {|word| '\\b' + word + '\\b'}.join('|')
+      return Regexp.new(pattern, Regexp::IGNORECASE)
+    end
+  end
+end

data/lib/rake_text/version.rb

@@ -0,0 +1,3 @@
+module RakeText
+  VERSION = '1.0.1'
+end

data/test/test_rake_text.rb

@@ -0,0 +1,29 @@
+require 'minitest/autorun'
+require 'rake_text'
+
+class RakeTextTest < MiniTest::Unit::TestCase
+  def setup
+    @rake = RakeText::Engine.new
+    @text = 'Compatibility of systems of linear constraints over the set of natural numbers. Criteria of compatibility of a system of linear Diophantine equations, strict inequations, and nonstrict inequations are considered. Upper bounds for components of a minimal set of solutions and algorithms of construction of minimal generating sets of solutions for all types of systems are given. These criteria and the corresponding algorithms for constructing a minimal supporting set of solutions can be used in solving all the considered types of systems and systems of mixed types.'
+  end
+
+  def test_stoplist_builtin_default
+    assert_equal(@rake.stoplist.words.length, 571)
+  end
+
+  def test_stoplist_builtin_fox
+    @rake.stoplist.load_fox
+    assert_equal(@rake.stoplist.words.length, 425)
+  end
+
+  def test_stoplist_load
+    @rake.stoplist.load_file(File.join( File.dirname(__FILE__), '../data/stoplists/default.stoplist'))
+    assert_equal(@rake.stoplist.words.length, 571)
+  end
+
+  def test_analyse
+    @rake.stoplist.load_default
+    result = @rake.analyse(@text, 11)
+    assert_equal(result, {'linear diophantine equations' => 11.5, 'minimal generating sets' => 11.666666666666666})
+  end
+end

metadata

@@ -0,0 +1,53 @@
+--- !ruby/object:Gem::Specification
+name: rake-text
+version: !ruby/object:Gem::Version
+  version: 1.0.1
+platform: ruby
+authors:
+- Felix Lindström
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2015-05-07 00:00:00.000000000 Z
+dependencies: []
+description: Process text and calculate RAKE.
+email:
+- felix.lindstrom@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- README.md
+- LICENSE.md
+- data/stoplists/default.stoplist
+- data/stoplists/fox.stoplist
+- lib/rake_text/engine.rb
+- lib/rake_text/stoplist.rb
+- lib/rake_text/version.rb
+- lib/rake_text.rb
+- test/test_rake_text.rb
+homepage: https://github.com/felixlindstrom/rake-ruby
+licenses: []
+metadata: {}
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 2.0.14
+signing_key: 
+specification_version: 4
+summary: Process text and calulcate RAKE.
+test_files:
+- test/test_rake_text.rb