Search results
From MaRDI portal
- Publication Date of Publication Type Practical Earley Parsing 2003-08-07 Paper https://portal.mardi4nfdi.de/entity/Q4707976 2003-06-12 Paper Exploiting...10 bytes (18 words) - 04:10, 9 December 2023
- Date of Publication Type Natural language parsing 2021-11-12 Paper A derivational model of discontinuous parsing 2021-07-21 Paper Non-self-embedding linear...10 bytes (19 words) - 14:33, 8 December 2023
- 2015-08-24 Paper On parsing optimality for dictionary-based text compression -- the \texttt{Zip} case 2014-08-13 Paper Note on the greedy parsing optimality for...10 bytes (17 words) - 15:00, 10 December 2023
- marker classes, and local/global segmentation/Parsing algorithms 2007-02-12 Paper Local and global parsing with functional (F)X-bar theory and SCD linguistic...10 bytes (16 words) - 05:10, 9 December 2023
- sets in an acyclic digraph 2012-09-13 Paper Recognition is not parsing - SPPF-style parsing from cubic recognisers 2010-01-15 Paper Algorithms for generating...10 bytes (16 words) - 23:27, 11 December 2023
- de/entity/Q3174300 2011-10-12 Paper PARSING UNCERTAIN CONTEXT-FREE LANGUAGES BY GENETIC ALGORITHMS 2004-10-06 Paper Fast systolic parsing of context free languages...10 bytes (16 words) - 16:54, 12 December 2023
- Publication Date of Publication Type Some observations on LR-like parsing with delayed reduction 2010-03-24 Paper Fast parallel recognition of LR language...10 bytes (16 words) - 01:35, 13 December 2023
- Paper Parallel parsing on the connection machine 1989-01-01 Paper SL parses the LR languages 1988-01-01 Paper Recursive descent parsing using implementation...10 bytes (19 words) - 16:09, 12 December 2023
- Misspecification Effects 2018-12-03 Paper Robust Parsing Using Dynamic Programming 2010-05-07 Paper Error-repair parsing schemata 2010-03-09 Paper Implementation...10 bytes (17 words) - 18:07, 12 December 2023
- sets in an acyclic digraph 2012-09-13 Paper Recognition is not parsing - SPPF-style parsing from cubic recognisers 2010-01-15 Paper Algorithms for generating...10 bytes (18 words) - 23:27, 11 December 2023
- FINITE AUTOMATA 2008-05-20 Paper Formal Translation Directed by Parallel LLP Parsing 2008-03-07 Paper Borders and Finite Automata 2007-09-06 Paper Finding Common...10 bytes (16 words) - 12:40, 28 January 2024
- de/entity/Q3484338 1989-01-01 Paper Correctness of an extended operator-precedence parsing algorithm 1987-01-01 Paper https://portal.mardi4nfdi.de/entity/Q3681932...10 bytes (19 words) - 10:13, 13 December 2023
- for database queries 1997-02-27 Paper Chart parsing of scattered context grammars 1994-05-24 Paper Parsing and generation with static discontinuity grammars...10 bytes (16 words) - 16:20, 9 December 2023
- From Ambiguous Regular Expressions to Deterministic Parsing Automata 2015-09-23 Paper BSP: A Parsing Tool for Ambiguous Regular Expressions 2015-09-23 Paper...10 bytes (16 words) - 17:21, 11 December 2023
- gadts: System F with first-class equality proofs 2012-01-13 Paper Combinator Parsing: A Short Tutorial 2009-07-28 Paper Web Cube 2009-03-11 Paper Linear, bounded...10 bytes (19 words) - 16:20, 12 December 2023
- 2022-12-09 Paper Hyperedge replacement with rendezvous 2022-11-02 Paper Graph Parsing as Graph Transformation 2022-09-01 Paper Hybrid tree automata and the yield...10 bytes (16 words) - 18:21, 9 December 2023
- Publication Date of Publication Type Parsing as semantically guided constraint solving: the role of ontologies 2018-08-06 Paper https://portal.mardi4nfdi...10 bytes (16 words) - 14:54, 28 January 2024
- Publication Date of Publication Type Parsing schemata and correctness of parsing algorithms 1998-08-13 Paper https://portal.mardi4nfdi.de/entity/Q4714447...10 bytes (16 words) - 10:11, 24 September 2023
- Artificial Intelligence 2005-08-17 Paper A graph unification machine for NL parsing 2004-08-06 Paper https://portal.mardi4nfdi.de/entity/Q4530048 2002-05-07...10 bytes (17 words) - 12:53, 12 December 2023
- grammars 1988-01-01 Paper Parallel parsing of programming languages 1987-01-01 Paper A new parallel algorithm for parsing arithmetic infix expressions 1987-01-01...10 bytes (16 words) - 17:23, 12 December 2023
