brute force technique in language processing

n_amuktha's Avatar
Newbie Member
wats this brute force technique in language processing using c??help me out..... :confused
0
pradeep's Avatar, Join Date: Apr 2005
Team Leader
Brute-force search consists of systematically enumerating every possible solution of a problem until a solution is found, or all possible solutions have been exhausted. For example, an anagram problem can be solved by enumerating all possible combinations of words with the same number of letters as the desired phrase, and checking one by one whether the words make a valid anagram.
0
n_amuktha's Avatar
Newbie Member
Quote:
Originally Posted by pradeep
Brute-force search consists of systematically enumerating every possible solution of a problem until a solution is found, or all possible solutions have been exhausted. For example, an anagram problem can be solved by enumerating all possible combinations of words with the same number of letters as the desired phrase, and checking one by one whether the words make a valid anagram.
thanks a lot..is there any program to this technique??
0
n_amuktha's Avatar
Newbie Member
hi.....and thanks a lot.....is there a program implementing this technique????
0
pradeep's Avatar, Join Date: Apr 2005
Team Leader
There is no generic brute-force program, i guess. What's your purpose?
0
wagmare's Avatar, Join Date: May 2008
Go4Expert Member
hi.
i just joined an embedding company and they provide me some tasks and one of it is this anagram ... i try hard but unable so i kindly request u to help me find all the possible combinations of the inputed string.
0
pradeep's Avatar, Join Date: Apr 2005
Team Leader
For solving anagrams, you'll need a word list! Then you'll need to try all possible combinations of the inputed word against the word list.