3 search results - page 1 / 1 » The Structure of Shared Forests in Ambiguous Parsing |
ACL
1989
13 years 5 months ago
1989
The Context-Free backbone of some natural language analyzers produces all possible CF parses as some kind of shared forest, from which a single tree is to be chosen by a disambigu...
COLING
1996
13 years 5 months ago
1996
The paper describes a system which uses packed parser output directly to build semantic representations. More specifically, the system takes as input Packed Shared Forests in the ...
ACL
1990
13 years 5 months ago
1990
In this paper we present a polynomial time parsing algorithm for Combinatory Categorial Grammar. The recognition phase extends the CKY algorithm for CFG. The process of generating...