Graal Forums - Programming Exercise #2

Graal Forums (https://forums.graalonline.com/forums/index.php)

- NPC Scripting (https://forums.graalonline.com/forums/forumdisplay.php?f=8)

- - Programming Exercise #2 (https://forums.graalonline.com/forums/showthread.php?t=78351)

PHP Code:


		
			

/* Loops through a given wordlist
    
    First checks if the current word in the wordlist
    contains the letters the checking word does

    then checks the length of the current
    word and the checking word
*/
function findanagram(word) {
  temp.wordlist = getwordlist();
  temp.matches = "";
  for(temp.currentword : wordlist) {
    temp.y = "";
    temp.cword = uppercase(currentword);
    temp.word2 = uppercase(word);
    // Checking 
    for(temp.i = 0; i < cword.length(); i++) {
      if (word2.pos(cword.charat(i)) > -1) y @= "y";
      else y @= "n";
    }
    if (y.pos("n") == -1) { // Checking purposes
      temp.locw = cword.trim().length(); // length of currentword (for loop)
      temp.low = word2.trim().length(); // length of word (params)
      if (locw == low) {// if length of both comparing words are the same
        if (currentword != word) matches @= currentword @", ";
      }
    }
  }
  if (matches.length() > 0) { 
    return matches;
  }
}
// Edit this to return the wordlist used
function getwordlist() {
  temp.list.loadlines("temp/wordlist.txt");
  return list;
}

And you need to set maxlooplimit if your wordlist count is higher then the loop limit :o

Edit getwordlist() at the bottom to return the wordlist used. I used a wordlist which I uploaded to temp (if anyone wants to try with that I can rar it and attach, but you might need to edit it (graal doesn't like to loop through 317k words :()) :O

And.. don't hurt me if this isn't a good anagram finder :(

Quote:

Originally Posted by Chompy (Post 1369943)

And.. don't hurt me if this isn't a good anagram finder :(

For words longer than 9 unique letters this is "eh, it's 'okay'."

In a perfect world, we could have a dictionary in a sort of hash table:

NPC Code:

function anagrams( word )

  sort letters in word;

  calculate hashkey from letters;

  return hashtable[hashkey];

TADAA

Quote:

Originally Posted by Tolnaftate2004 (Post 1369973)

For words longer than 9 unique letters this is "eh, it's 'okay'."

In a perfect world, we could have a dictionary in a sort of hash table:

NPC Code:

function anagrams( word )

  sort letters in word;

  calculate hashkey from letters;

  return hashtable[hashkey];

TADAA

thats almost what i was looking for!

Quote:

Originally Posted by Kristi (Post 1370080)

thats almost what i was looking for!

You want the hash algorithm? I'm thinking a hash table of about 30^26 elements would do the job. :P

I'm guessing this hasn't been touched long enough no one will add to this.
I would have presorted a file of all known words with the letters arranged in alphabetical order, then just saved that and used it until the end of time.
example line from file:
aanst=santa,satan,etc
then when given a word, sort it and look it up (very fast).
now if someone wants to take the best shot coding the sorting of the word file and the look up in gscript...

Quote:

Originally Posted by Kristi (Post 1371489)

This isn't exactly how you described it, using a less efficient method, but it works decently fast for what it does.

http://forums.graalonline.com/forums...ad.php?t=81856

Quote:

Originally Posted by Tigairius (Post 1423903)

This isn't exactly how you described it, using a less efficient method, but it works decently fast for what it does.

http://forums.graalonline.com/forums...ad.php?t=81856

From what I can see it's a lot slower (something to the order of number-of-words-in-the-dictionary slower).
edit: I just watched the video and it makes me think that it might be slower than that even...