| Two
Methods of Pattern Matching |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1. | Hard Matching |
||||||||||||
| – | Rule induction |
||||||||||||
| – | Generalizing
training instances into regular |
||||||||||||
| expression
represented rules |
|||||||||||||
| – | Performing slot
by slot matching |
||||||||||||
| 2. | Soft Matching |
||||||||||||
| – | Hidden Markov
Models (HMM) |
||||||||||||
| – | Soft pattern
matching for definitional QA |
||||||||||||
| (Cui et al., 2004) |
|||||||||||||
