254 search results - page 15 / 51 » Efficient Transformation-Based Parsing |
74
Voted
ACL
1998
14 years 11 months ago
1998
The multiplicative fragment of linear logic has found a number of applications in computational linguistics: in the "glue language" approach to LFG semantics, and in the...
COLING
1994
14 years 11 months ago
1994
A CYK-table-driven interactive relaxation parsing method of spoken Korean, integrated with the CYK-based morphological analysis is introduced. An extension of the Categorial Gramm...
ACL
2010
14 years 7 months ago
2010
Linear Context-Free Rewriting Systems (LCFRSs) are a grammar formalism capable of modeling discontinuous phrases. Many parsing applications use LCFRSs where the fan-out (a measure...
86
Voted
COLING
1992
14 years 10 months ago
1992
This paper I describes a method for chart parsing Lambek grammars. The method is of particular interest in two regards. Firstly, it allows efficient processing of grammars which u...
AAAI
1994
14 years 11 months ago
1994
We describe a new algorithm for table-driven parsing with context-free grammars designed to support efficient syntactic analysis of natural language. The algorithm provides a gene...