Loading...
Please wait, while we are loading the content...
Similar Documents
Technical Correspondence: The Extraction Of A Minimum Set Of Semantic Primitives From A Monolingual Dictionary Is NP-Complete
| Content Provider | Semantic Scholar |
|---|---|
| Author | Dailey, David P. |
| Copyright Year | 1986 |
| Abstract | Within the last 15 years, a variety of unsolved problems of interest primarily to operations researchers, computer scientists, and mathematicians have been demonstrated to be equivalent in the sense that a solution to any of them would yield a solution to all of them. This class of problems, known as NP-complete, contains many long-standing problems of scheduling, routing, and resource allocation. This note contains a demonstration that a problem of interest to applied linguistics also belongs to this class - namely, the process of extracting a minimum set of semantic primitives from a monolingual dictionary is NP-complete, implying that the task is currently computationally insoluble. |
| Starting Page | 306 |
| Ending Page | 307 |
| Page Count | 2 |
| File Format | PDF HTM / HTML |
| Volume Number | 12 |
| Alternate Webpage(s) | http://wing.comp.nus.edu.sg/~antho/J/J86/J86-4003.pdf |
| Alternate Webpage(s) | http://ucrel.lancs.ac.uk/acl/J/J86/J86-4003.pdf |
| Alternate Webpage(s) | http://www.aclweb.org/anthology/J/J86/J86-4003.pdf |
| Alternate Webpage(s) | http://aclweb.org/anthology/J/J86/J86-4003.pdf |
| Alternate Webpage(s) | http://aclweb.org/anthology//J/J86/J86-4003.pdf |
| Alternate Webpage(s) | http://acl.ldc.upenn.edu/J/J86/J86-4003.pdf |
| Alternate Webpage(s) | http://aclweb.org/anthology/J86-4003 |
| Alternate Webpage(s) | http://anthology.aclweb.org/J/J86/J86-4003.pdf |
| Alternate Webpage(s) | http://www.aclweb.org/anthology/J86-4003 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |