254 search results - page 15 / 51 » Efficient Transformation-Based Parsing |
189
click to vote
ACL
1998
15 years 8 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...
171
click to vote
COLING
1994
15 years 8 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...
183
click to vote
ACL
2010
15 years 5 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...
183
click to vote
COLING
1992
15 years 8 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...
174
Voted
AAAI
1994
15 years 8 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...