3.3 Rule-Based - Githubissues

pmanion0 / cs224n-pa3

Team Repo for Stanford's CS224n Programming Assignment #3

0 stars 0 forks source link

3.3 Rule-Based #4

Open pmanion0 opened 9 years ago

pmanion0 commented 9 years ago

Tasks:

[ ] Carry-over BetterBaseline @theforager
[ ] Implement Hobbs Rule @theforager
[ ] Implement Strict Head Matching @jeasenrys
[ ] Implement Relaxed Head Matching @jeasenrys
[ ] Implement (some) Precise Construct Matching @jeasenrys
[ ] Implement Standard Pronoun Matching (e.g. he, she) @jeasenrys
[ ] Implement Reflexive Pronoun Matching (e.g. himself) @theforager

See this paper for details

pmanion0 commented 9 years ago

This is the layout of the Stanford rule-based algorithm:

• Exact Match • Precise Constructs (appositives, predicate nominatives, ...) • Strict Head Matching • Strict Head Matching - Variant 1 • Strict Head Matching - Variant 2 • Relaxed Head Matching • Pronouns