search for: worded

I am working with some large text files (up to 16 GBytes). I am interested in extracting the words and counting each time each word appears in the text. I have written a very simple R program by following some suggestions and examples I found online. If my input file is 1 GByte, I see that R uses up to 11 GBytes of memory when executing the program on a 64-bit system running CentOS 6.3. Why is

Hey Everyone, I have a function test the is failing (despite the fact the function actually works in the application). I was looking for some debug advice on how to find my problem. Here is the test: def test_should_delete_word assert_equal ''published'', words(:one).status debugger delete :destroy, :id => words(:one).to_param assert_equal

In my app i have word model, words_controller and want create new action for word model. I create new method ''test'' in words_controller, and adds: resources :words do member do put ''test'' end end in routes.rb my rake routes output: test_word PUT /words/:id/test(.:format) {:action=>"test", :controller=>"words"}

Dear useRs, I have written a very simple function to compute some probabilities on words (function is below). The function includes a which() statement applied to a vector of characters (word.split): sapply (word.split, function(x) which(letters==x)). This statement worked as expected when used outside the global function : > word <- "hello" > (word.split <-

Hi everyone! I think I stumbled over a bug in the latest R 2.9.2 patched for OS X: > R version 2.9.2 Patched (2009-09-24 r49861) > i386-apple-darwin9.8.0 When I try to sort latin1-encoded character vectors, R sometimes crashes with a segmentation fault. I'm running OS X 10.5.8 and have observed this behaviour both with the i386 and x86_64 builds, in the R.app GUI as well as on

Colleagues, I am using R (2.9.2, all platforms) to search for a complicated text string using regular expressions. I would appreciate any help you can provide. The string consists of the following elements: SOMEWORDWITHNOSPACES any number of spaces and/or tabs ( any number of spaces and/or tabs integer any number of spaces and/or tabs ) Examples include: WORD ( 123 ) WORD(1 )

How to make it work with paginator (kaminari)? MySQL and full text search: Words (id, word) @words = Word.find_by_sql(["SELECT id, word, MATCH (word) AGAINST (?) AS Score FROM words WHERE MATCH (word) AGAINST (?) ORDER BY Score Desc, word!=?", params[:search],params[:search],params[:search]]) I can''t add .page(params[:page]).per(5) to the end of "find_by_sql()" so

Hi, attached are patches that improve decoding speed a bit. The first patch improves the bit scan macro used for decoding unary values, the second one adds a GCC inline assembly for bswap and the third patch replaces the read_rice_block function. In my testing it turned out to be even faster than the _ia32_bswap function. If the code produced by MSVC is faster as well, I'd suggest to remove

I am trying to graphically represent a large set of data who's result is not strictly uniform. http://n4.nabble.com/file/n961629/egraph_rules_list_2.png The scatter plot to the left has all of the data rising in steps however I know that there are cases within my data that do not fit the dotted line. temp<-edat[edat$R1SC>0,,]

Hi all. I just got openssh 2.5.1p1 and when I installed it, it's man pages doesn't seem to be formatted right. I'm on Solaris 8. Here is how it looks: man ssh Reformatting page. Please Wait... done (Secure Shell) is a program for logging into a remote machine and for executing commands on a remote machine. It is intended to replace rlogin and rsh, and provide secure encrypted

I want to load about 14000 words (a subset of /usr/share/dict/words) into a MySQL table in a migration: class CreateWords < ActiveRecord::Migration def self.up create_table :words, :force => true do |t| t.column :word, :string end say_with_time ''loading words...'' do words = File.join(RAILS_ROOT, ''db'',

Dear all, I have a word frequency list from a corpus (say, in .csv), where the first column is a word and the second is the occurrence frequency of that word in the corpus. Is it possible to obtain a Burt table (a table crossing all words with each other, i.e., where rows and columns are the words) from that frequency list with R? I'm exploring the "ca" package but I'm

I have Samba running as a PDC and it works perfectly, until that is, a Win 2000 user authenticated by the PDC and with a profile on the Samba server wants to access Word and then after a minute or so Word crashes, I got the same result with a Redhat PDC and also with an SME server distro. Informed suggestions other than dump Word are very welcome... John Russell Digital Media Lab University of

Hi Steven, Thank you for the help. I get an error though when i do this : >lit<-read.csv("litologija.csv", sep=";", dec=".") >sent <-data.frame(sentence=lit$Opis,stringsAsFactors=FALSE) >str(sent) >sentV<-rep(sent,10) >str(sentV) >first=second=third=fourth=fifth=sixth=seventh=eighth=ninth=tenth<-vector(length=10) >DF

Dear useRs, I have used using the excellent mgcv package (version 1.7-12) to create a generalized additive model (gam) including random effects - represented with s(...,bs="re") - on the basis of dialect data. My model contains two random-effect factors (Word and Key - the latter representing a speaker) and I have added both random intercepts and various random slopes for these

I am trying to do a search for a crazy problem. Anyways, the search can only contain one word and the database it''s searching contains one word per row. Basically if someone tries to search for a word I want to find the closest match. Ex: If someone types "cat" and "cat" is not in my database, but "bat" is, how could I select bat? Also, if someone

Hi, I'm trying to write a general-purpose "lexicon" class and associated methods for storing and accessing information about large numbers of specific words (e.g., their frequencies in different genres). Crucial to making such a class practically useful is to get hashing working correctly so that information about specific words can be accessed quickly. But I've never really

--- src/libFLAC/include/private/bitmath.h | 2 +- 1 files changed, 1 insertions(+), 1 deletions(-) diff --git a/src/libFLAC/include/private/bitmath.h b/src/libFLAC/include/private/bitmath.h index 61b0e03..d32b1a7 100644 --- a/src/libFLAC/include/private/bitmath.h +++ b/src/libFLAC/include/private/bitmath.h @@ -42,7 +42,7 @@ #endif /* Will never be emitted for MSVC, GCC, Intel compilers */

Hi Everyone, I'm new to programming R and have accomplished my goal, but feel that there is probably a more efficient way of coding this. I'd appreciate any guidance that a more advanced programmer can provide. My goal -- I would like to find the length of the longest word in a string containing many words separated by spaces. How I did it -- I was able to find the length of the

Hi all, I am trying to create word document in ruby using WIN32OLE. as.. require ''win32ole'' word = WIN32OLE.new("Word.Application") word.visible = true word.documents.add selection = word.selection word.Selection.TypeText "This is some text." ... .. . Can we set header and footer to document? I want to generate a document such that its header contains an