Algorithm for matching partially filled words
Posted
by adnanhb
on Stack Overflow
See other posts from Stack Overflow
or by adnanhb
Published on 2010-04-02T06:41:22Z
Indexed on
2010/04/02
6:43 UTC
Read the original article
Hit count: 376
algorithm
Hello All,
I am writing a game which when given a partially filled word, searches a dictionary and returns all the matching words. To that effect, I am trying to find an algorithm that can be used for the said purpose. For example, given - - a -, the algorithm will search a dictionary for all the words which have length 4 and have 'a' as the third letter.
Is there such an algorithm already? If not, can somebody given a rough idea of how to design such an algorithm?
Thanks in Advance.
© Stack Overflow or respective owner