1 resultado para C language
em Massachusetts Institute of Technology
Filtro por publicador
- KUPS-Datenbank - Universität zu Köln - Kölner UniversitätsPublikationsServer (1)
- Aberdeen University (1)
- Aberystwyth University Repository - Reino Unido (2)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (5)
- Adam Mickiewicz University Repository (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (1)
- Aquatic Commons (3)
- Archive of European Integration (1)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (3)
- Aston University Research Archive (7)
- Biblioteca de Teses e Dissertações da USP (3)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (4)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (2)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (3)
- Biodiversity Heritage Library, United States (1)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (5)
- Brock University, Canada (2)
- Bucknell University Digital Commons - Pensilvania - USA (1)
- Bulgarian Digital Mathematics Library at IMI-BAS (4)
- Cambridge University Engineering Department Publications Database (1)
- CentAUR: Central Archive University of Reading - UK (62)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (7)
- CORA - Cork Open Research Archive - University College Cork - Ireland (1)
- Dalarna University College Electronic Archive (5)
- Deakin Research Online - Australia (31)
- Digital Archives@Colby (1)
- Digital Commons at Florida International University (12)
- DRUM (Digital Repository at the University of Maryland) (1)
- Duke University (1)
- Helda - Digital Repository of University of Helsinki (11)
- Illinois Digital Environment for Access to Learning and Scholarship Repository (1)
- Indian Institute of Science - Bangalore - Índia (21)
- Instituto Politécnico do Porto, Portugal (2)
- Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul (1)
- Massachusetts Institute of Technology (1)
- Memoria Académica - FaHCE, UNLP - Argentina (2)
- Ministerio de Cultura, Spain (18)
- National Center for Biotechnology Information - NCBI (4)
- Portal de Revistas Científicas Complutenses - Espanha (5)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (27)
- Queensland University of Technology - ePrints Archive (452)
- ReCiL - Repositório Científico Lusófona - Grupo Lusófona, Portugal (1)
- Repositório Científico da Universidade de Évora - Portugal (2)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (2)
- Repositorio de la Universidad de Cuenca (1)
- Repositório Institucional da Universidade Estadual de São Paulo - UNESP (1)
- Repositorio Institucional de la Universidad de Málaga (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (29)
- Repositorio Institucional UNISALLE - Colombia (1)
- Repositorio Institucional Universidad de Medellín (1)
- School of Medicine, Washington University, United States (1)
- South Carolina State Documents Depository (1)
- Universidad Politécnica de Madrid (20)
- Universidade Complutense de Madrid (2)
- Universidade Federal do Pará (2)
- Universidade Federal do Rio Grande do Norte (UFRN) (11)
- Universidade Metodista de São Paulo (4)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (1)
- Université de Lausanne, Switzerland (3)
- Université de Montréal, Canada (1)
- University of Connecticut - USA (1)
- University of Michigan (105)
- University of Queensland eSpace - Australia (29)
- University of Southampton, United Kingdom (1)
- WestminsterResearch - UK (4)
Resumo:
The computer science technique of computational complexity analysis can provide powerful insights into the algorithm-neutral analysis of information processing tasks. Here we show that a simple, theory-neutral linguistic model of syntactic agreement and ambiguity demonstrates that natural language parsing may be computationally intractable. Significantly, we show that it may be syntactic features rather than rules that can cause this difficulty. Informally, human languages and the computationally intractable Satisfiability (SAT) problem share two costly computional mechanisms: both enforce agreement among symbols across unbounded distances (Subject-Verb agreement) and both allow ambiguity (is a word a Noun or a Verb?).