Computational properties of environment-based disambiguation
| dc.creator | Schuler, William | |
| dc.date | 2001-06-07 | |
| dc.date.accessioned | 2026-07-07T03:17:12Z | |
| dc.date.available | 2026-07-07T03:17:12Z | |
| dc.description | The standard pipeline approach to semantic processing, in which sentences are morphologically and syntactically resolved to a single tree before they are interpreted, is a poor fit for applications such as natural language interfaces. This is because the environment information, in the form of the objects and events in the application's run-time environment, cannot be used to inform parsing decisions unless the input sentence is semantically analyzed, but this does not occur until after parsing in the single-tree semantic architecture. This paper describes the computational properties of an alternative architecture, in which semantic analysis is performed on all possible interpretations during parsing, in polynomial time. | |
| dc.description | 8 pages, published in Proceedings of the 39th Annual Meeting of the ACL 2001 | |
| dc.identifier | https://arxiv.org/abs/cs/0106011 | |
| dc.identifier | http://arxiv.org/abs/cs/0106011 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/30633 | |
| dc.subject | Computation and Language | |
| dc.subject | Human-Computer Interaction | |
| dc.subject | I.2.7; H.5.2 | |
| dc.title | Computational properties of environment-based disambiguation | |
| dc.type | text |