Loading...
Please wait, while we are loading the content...
Similar Documents
An efficient all-paths parsing algorithm for natural languages
| Content Provider | Semantic Scholar |
|---|---|
| Author | Tomita, Masaru |
| Copyright Year | 1984 |
| Abstract | An extended L R parsing algorithm is introduced and its application to natural language processing is d iscussed. Unlike the standard LR, our algorithm is capable of handling arbitrary context-free phrase structure grammars including ambiguous grammars, while most of the LR parsing efficiency is preserved. When an input sentence is ambiguous, it p roduces all possible parses in an efficient manner with the idea of a "graph-st ructured stack." Comparisons with other parsing methods are made. Th is research was sponsored by the Defense Advanced Research Projects A g e n c y ( D O D ) , A R P A Order N o . 3597, monitored by the Air Force Avionics Laboratory Under Contract F33615-81 -K-1539. T h e views and conclus ions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the Defense Advanced Research Projects A g e n c y or the U S Government . |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://repository.cmu.edu/cgi/viewcontent.cgi?article=2527&context=compsci |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
