Many search problems are commonly solved with combinatoric algorithms that unnecessarily duplicate and serialize work at considerable computational expense. There are techniques available that can eliminate redundant computations and perform remaining operations concurrently, effectively reducing the branching factors of these algorithms. This thesis applies these techniques to the problem of parsing natural language. The result is an efficient programming language that can reduce some of the expense associated with principle-based parsing and other search problems. The language is used to implement various natural language parsers, and the improvements are compared to those that result from implementing more deterministic theories of language processing.
| Identifer | oai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/6785 |
| Date | 01 January 1994 |
| Creators | Marcken, Carl de |
| Source Sets | M.I.T. Theses and Dissertation |
| Language | en_US |
| Detected Language | English |
| Format | 114 p., 277344 bytes, 1249579 bytes, application/octet-stream, application/pdf |
| Relation | AITR-1453 |
Page generated in 0.0015 seconds