Challenge: Parsing & Representing Unrestricted Text
Challenge: Parsing & Representing Unrestricted Text
Goal
- Acquire correct knowledge from unrestricted text.
Approach
- Incrementally Extend Machine Parsability
- Parsing
- Framework: Reversible Parser-Generator Pairs
- Bootstrap: Learn from corpora, but converge faster by designing a better abstract parser model.
- Reference
- Background Knowledge: Bootstrap from machine parsable text.
- Divide & Conquer: Decompose Deliberative Reference.
- Inference: Generalized Structure Mapping