Maximum Matching Algorithm

• Greedy
• Starts with first character
• Searches for the longest word in list starting with this character. If match is found, boundary is marked