Methods for Parallelizing Search Paths in Phrasing

Title: en_US Methods for Parallelizing Search Paths in Phrasing
Creator: en_US Marcken, Carl de
Date: 2004-10-20T19:54:58Z
Date Available: 2004-10-20T19:54:58Z
Date Issued: en_US 1994-01-01
Identifier: en_US AITR-1453
uri: http://hdl.handle.net/1721.1/6785
Abstract: en_US 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.
Extent: en_US 114 p.; 277344 bytes; 1249579 bytes
Format: application/octet-stream; application/pdf
Language: en_US
Relation: en_US AITR-1453
Subject: en_US parallel search; en_US parsing; en_US generate and test