Methods for Parallelizing Search Paths in Phrasing

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/6785

Full metadata record

DC Field	Value	Language
dc.creator	Marcken, Carl de	-
dc.date	2004-10-20T19:54:58Z	-
dc.date	2004-10-20T19:54:58Z	-
dc.date	1994-01-01	-
dc.date.accessioned	2013-10-09T02:46:54Z	-
dc.date.available	2013-10-09T02:46:54Z	-
dc.date.issued	2013-10-09	-
dc.identifier	AITR-1453	-
dc.identifier	http://hdl.handle.net/1721.1/6785	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	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.	-
dc.format	114 p.	-
dc.format	277344 bytes	-
dc.format	1249579 bytes	-
dc.format	application/octet-stream	-
dc.format	application/pdf	-
dc.language	en_US	-
dc.relation	AITR-1453	-
dc.subject	parallel search	-
dc.subject	parsing	-
dc.subject	generate and test	-
dc.title	Methods for Parallelizing Search Paths in Phrasing	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI