1 resultado para Descriptive grammars
em Indian Institute of Science - Bangalore - Índia
Filtro por publicador
- Aberdeen University (2)
- Aberystwyth University Repository - Reino Unido (1)
- Academic Research Repository at Institute of Developing Economies (5)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (1)
- Aquatic Commons (5)
- Archive of European Integration (1)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (2)
- Aston University Research Archive (7)
- 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) (1)
- Biblioteca Valenciana Digital - Ministerio de Educación, Cultura y Deporte - Valencia - Espanha (1)
- Biodiversity Heritage Library, United States (5)
- Bioline International (3)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (19)
- Boston University Digital Common (4)
- Brock University, Canada (3)
- Bucknell University Digital Commons - Pensilvania - USA (2)
- Bulgarian Digital Mathematics Library at IMI-BAS (3)
- CaltechTHESIS (1)
- Cambridge University Engineering Department Publications Database (8)
- CentAUR: Central Archive University of Reading - UK (4)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (3)
- Dalarna University College Electronic Archive (1)
- Digital Commons - Montana Tech (1)
- Digital Commons @ DU | University of Denver Research (1)
- Digital Commons at Florida International University (2)
- DigitalCommons@The Texas Medical Center (22)
- DigitalCommons@University of Nebraska - Lincoln (1)
- Digitale Sammlungen - Goethe-Universität Frankfurt am Main (4)
- Gallica, Bibliotheque Numerique - Bibliothèque nationale de France (French National Library) (BnF), France (23)
- Greenwich Academic Literature Archive - UK (3)
- Harvard University (1)
- Helda - Digital Repository of University of Helsinki (4)
- Indian Institute of Science - Bangalore - Índia (1)
- Iowa Publications Online (IPO) - State Library, State of Iowa (Iowa), United States (1)
- Massachusetts Institute of Technology (1)
- Ministerio de Cultura, Spain (1)
- National Center for Biotechnology Information - NCBI (14)
- Nottingham eTheses (1)
- Portal de Revistas Científicas Complutenses - Espanha (2)
- Publishing Network for Geoscientific & Environmental Data (2)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (18)
- Queensland University of Technology - ePrints Archive (184)
- Repositorio Académico de la Universidad Nacional de Costa Rica (1)
- Repositório Institucional da Universidade de Brasília (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (12)
- Savoirs UdeS : plateforme de diffusion de la production intellectuelle de l’Université de Sherbrooke - Canada (9)
- School of Medicine, Washington University, United States (2)
- Universidad Autónoma de Nuevo León, Mexico (7)
- Universidad de Alicante (1)
- Universidad Politécnica de Madrid (2)
- Universidade Católica Portuguesa (1)
- Universidade Complutense de Madrid (1)
- Universidade Federal do Pará (1)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (1)
- Université de Lausanne, Switzerland (1)
- Université de Montréal (5)
- Université de Montréal, Canada (18)
- Université Laval Mémoires et thèses électroniques (1)
- University of Connecticut - USA (3)
- University of Michigan (486)
- University of Queensland eSpace - Australia (9)
- University of Washington (2)
Relevância:
Resumo:
We present an algorithm for testing the suitability of an affix grammar for deterministic, one-pass, bottom-up parsing which is an improvement over the one suggested by Pohlmann [1]. The space requirements of the new algorithm are considerably less than that of Pohlmann's. We also describe an implementation of Pohlmann's algorithm and methods for improving its space requirements.
