PARALLEL PROCESSING OF NATURAL LANGUAGE (ARTIFICIAL INTELLIGENCE, X-BAR THEORY, SYNTACTIC ANALYSIS, PARSING)
Salvato in:
| Pubblicato in: | ProQuest Dissertations and Theses (1986) |
|---|---|
| Autore principale: | |
| Pubblicazione: |
ProQuest Dissertations & Theses
|
| Soggetti: | |
| Accesso online: | Citation/Abstract Full Text - PDF |
| Tags: |
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 303505815 | ||
| 003 | UK-CbPIL | ||
| 020 | |a 979-8-206-37919-8 | ||
| 035 | |a 303505815 | ||
| 045 | 0 | |b d19860101 | |
| 084 | |a 66569 |2 nlm | ||
| 100 | 1 | |a CHANG, HUI OLIVIA | |
| 245 | 1 | |a PARALLEL PROCESSING OF NATURAL LANGUAGE (ARTIFICIAL INTELLIGENCE, X-BAR THEORY, SYNTACTIC ANALYSIS, PARSING) | |
| 260 | |b ProQuest Dissertations & Theses |c 1986 | ||
| 513 | |a Dissertation/Thesis | ||
| 520 | 3 | |a Two types of parallel natural language processing are studied in this work: (1) the parallelism between syntactic and non-syntactic processing and, (2) the parallelism within syntactic processing. It is recognized that a syntactic category can potentially be attached to more than one node in the syntactic tree of a sentence. Even if all the attachments are syntactically well-formed, non-syntactic factors such as semantic and pragmatic consideration may require one particular attachment. Syntactic processing must synchronize and communicate with non-syntactic processing. Two syntactic processing algorithms are proposed for use in a parallel environment: Early's algorithm and the LR(k) algorithm. Conditions are identified to detect the syntactic ambiguity and the algorithms are augmented accordingly. It is shown that by using non-syntactic information during syntactic processing, backtracking can be reduced, and the performance of the syntactic processor is improved. For the second type of parallelism, it is recognized that one portion of a grammar can be isolated from the rest of the grammar and be processed by a separate processor. A partial grammar of a larger grammar is defined. Parallel syntactic processing is achieved by using two processors concurrently: the main processor (mp) and the auxiliary processor (ap). The auxiliary processor processes/accepts a substring in the input that is generated by the partial grammar. The main processor is responsible for processing the rest of the input and for interprocessor communication. The LR(k) algorithm is augmented to the effect that the main processor can take advantage of the processing result of the auxiliary processor. It is shown that the performance of the proposed parallel processing is supported by many of the syntactic constraints in natural languages. In addition, by recognizing the divisibility of the grammar, parallel parsing supports partial semantic interpretation during the course of the processing and is useful for constructing fault-tolerant NLP. | |
| 653 | |a Linguistics | ||
| 773 | 0 | |t ProQuest Dissertations and Theses |g (1986) | |
| 786 | 0 | |d ProQuest |t ProQuest Dissertations & Theses Global | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/303505815/abstract/embedded/6A8EOT78XXH2IG52?source=fedsrch |
| 856 | 4 | 0 | |3 Full Text - PDF |u https://www.proquest.com/docview/303505815/fulltextPDF/embedded/6A8EOT78XXH2IG52?source=fedsrch |