Lorem Ipsum

[chiffre]

This really chrashed my brain for a few hours

then i got the solution

Code: Select all

public static void main(String[] args) {

        StringBuffer input = new StringBuffer();
        String file = "C:\\Temp\\lorem.txt";
        String eingabe;
        ArrayList<Wort> array = new ArrayList<Wort>();

        try {
            BufferedReader in = new BufferedReader(new FileReader(file));
            String zeile = null;
            while ((zeile = in.readLine()) != null) {
                input.append(zeile);
            }
        } catch (IOException e) {
            e.printStackTrace();
        }

        eingabe = input.toString();
        StringBuffer interim = new StringBuffer();
        int z = 0;
        for (int a = 0; a < eingabe.length(); a++) {
            if (Character.isLetter(eingabe.charAt(a))) {
                interim.append(eingabe.charAt(a));
            } else {
                for (Wort w : array) {
                    if (w.getName().equals(interim.toString())) {
                        w.inkrement();
                        break;
                    }
                    z++;
                }
                if (z == array.size()) {
                    array.add(new Wort(interim.toString()));
                   
                }
                z=0;
                interim.delete(0, interim.length() + 1);

            }
        }

        for (Wort w : array) {
            if(w.getAnzahl()==1)
            System.out.println(w.getName() + w.getAnzahl());
        }
}}

[teebee]

This Perl one liner does the job:

Code: Select all

perl -ple '$x{$_}++for/(\w+)/g}{($_)=grep{$x{$_}<2}keys%x' < lorem.txt

[chiffre]

This Perl one liner does the job:

Code: Select all

perl -ple '$x{$_}++for/(\w+)/g}{($_)=grep{$x{$_}<2}keys%x' < lorem.txt

poser

but perl looks like the perfect language for such stringsearch algorithms, isnt it?

[teebee]

LOL! Yes, it is indeed. However, it is said to be a write-only language. So, don't try to read my code.

[Meelo]

Not much point in writing your own at all in my opinion; why reinvent the wheel when google can give you a web page that analyzes the text for you?

[tails]

Hmm... Do you google and install every application when you can do the job with a few lines of code?

[Meelo]

No. This one just seemed to lend itself to that though. For the whole didactic string of things, I write my own programs.

[prop]

wow yay i guessed and i got answer

(..and i know how to solve though XD)

[qut]

Perhaps not the shortest, but a nice solution:

from string import maketrans
text = open("lorem.txt").read()

intab = "\n.,"
outtab = " "
trantab = maketrans(intab, outtab)

text = text.translate(trantab);

worte = text.split(" ")
for w in worte:
z = text.count(w)
if z == 1:
print w+" "+str(text.count(w))

[Masti6]

http://www.wordcounter.com/
Did the trick. And so it does for many other challenges. Just checked the last word when filtered them in order of frequency.
I don't have the knowledge to make a program do this - Yet xD
Shall somone find a solution in Python, tell me asap :D

[keiya]

Code: Select all

import string
lorem = '''omitted for obvious reasons'''

lorem = lorem.replace('/n',' ').replace(',',' ').replace('.',' ').replace(';',' ').upper()
loremwords = lorem.split()
wordcount = {}

for word in loremwords:
    if word in wordcount:
        wordcount[word] = wordcount[word] + 1
    else:
        wordcount[word] = 1

print [k for (k, v) in wordcount.iteritems() if v == 1]

There's probably a cleaner way to do it - I KNOW that my string of replaces up there could be cleaned up - but it works.

[darthm0e]

i made it this way:
cat loremipsum.txt | sed 's/[^a-zA-Z]/\n/g' |sort|uniq -c| cat > list.txt

in list.txt there will be only 1 word counted as one

[pedromalta]

Did it without programming...

Replaced all the blank spaces with a line break on kate

and then put it in alphanumeric order under openoffice.org

Then it was pretty easy to spot!

[thewino]

wow. i attempted with c++ but was stumped. looked online and found a site which counts words....
does anyone have a c++ solution for this so i can examine it? that would be great

[pedromalta]

I did one for the RPC 3280, wich counts the word with 9 letters that appear the most.

i guess with some tweeking it would fit this one too... but it's a terrible code, yet fast...

It's posted under the RPC 3280 on this forum