50 search results - page 7 / 10 » Coordination in Tree Adjoining Grammars: Formalization and I... |
ACL
1998
13 years 8 months ago
1998
This paper describes a wide-coverage Japanese grammar based on HPSG. The aim of this work is to see the coverage and accuracy attainable using an underspecified grammar. Underspec...
BIRTHDAY
1992
Springer
13 years 11 months ago
1992
Springer
A context-free grammar is a single-tree grammar (STG) if every nonterminal symbol has at most one production rule whose right hand side contains nonterminal symbols. Various prope...
SAS
2001
Springer
13 years 11 months ago
2001
Springer
This paper describes the precise speci cation, design, analysis, implementation, and measurements of an e cient algorithm for solving regular tree grammar based constraints. The p...
CPP
2011
12 years 7 months ago
2011
Parsing text to identify grammatical structure is a common task, especially in relation to programming languages and associated tools such as compilers. Parsers for context-free g...
SAS
1999
Springer
13 years 11 months ago
1999
Springer
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...