Next: Suffix Table
Up: No Title
Previous: Finding Words
- find_word works by working through a word one letter at a time.
- When trying to recognise prevailed, for example, it will
eventually have to recognise [e,d]. At this point it should
be the case that
there is a lexical entry for prevail at this point in the tree. With
one small modification we can make the system recognise that [e,d] is amongst the possible
suffixes.
To achieve this is to add the following clause to find_word
find_word(Ending,Tree,Result+Suffix) :-
suffix(Ending,Suffix),
find_word([],Tree,Result).
Mike Rosner
Mon Feb 14 08:45:31 MET 2000