1. This site uses cookies. By continuing to use this site, you are agreeing to our use of cookies. Learn More.

brute force technique in language processing

Discussion in 'C' started by n_amuktha, Jan 30, 2007.

  1. n_amuktha

    n_amuktha New Member

    Joined:
    Jan 30, 2007
    Messages:
    3
    Likes Received:
    0
    Trophy Points:
    0
    wats this brute force technique in language processing using c??help me out..... :confused :confused:
     
  2. pradeep

    pradeep Team Leader

    Joined:
    Apr 4, 2005
    Messages:
    1,646
    Likes Received:
    86
    Trophy Points:
    0
    Occupation:
    Programmer
    Location:
    Kolkata, India
    Home Page:
    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.
     
  3. n_amuktha

    n_amuktha New Member

    Joined:
    Jan 30, 2007
    Messages:
    3
    Likes Received:
    0
    Trophy Points:
    0
    thanks a lot..is there any program to this technique??
     
  4. n_amuktha

    n_amuktha New Member

    Joined:
    Jan 30, 2007
    Messages:
    3
    Likes Received:
    0
    Trophy Points:
    0
    hi.....and thanks a lot.....is there a program implementing this technique????
     
  5. pradeep

    pradeep Team Leader

    Joined:
    Apr 4, 2005
    Messages:
    1,646
    Likes Received:
    86
    Trophy Points:
    0
    Occupation:
    Programmer
    Location:
    Kolkata, India
    Home Page:
    There is no generic brute-force program, i guess. What's your purpose?
     
  6. wagmare

    wagmare New Member

    Joined:
    May 14, 2008
    Messages:
    11
    Likes Received:
    0
    Trophy Points:
    0
    Occupation:
    soft.engg
    Location:
    Bangalore
    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.
     
  7. pradeep

    pradeep Team Leader

    Joined:
    Apr 4, 2005
    Messages:
    1,646
    Likes Received:
    86
    Trophy Points:
    0
    Occupation:
    Programmer
    Location:
    Kolkata, India
    Home Page:
    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.
     

Share This Page