Sciweavers

45 search results - page 3 / 9
» A Unification-Based Parser for Relational Grammar
Sort
View
ACL
1994
13 years 6 months ago
Relating Complexity to Practical Performance in Parsing with Wide-Coverage Unification Grammars
The paper demonstrates that exponential complexities with respect to grammar size and input length have little impact on the performance of three unification-based parsing algorit...
John Carroll
IWPT
2001
13 years 6 months ago
High Precision Extraction of Grammatical Relations
A parsing system returning analyses in the form of sets of grammatical relations can obtain high precision if it hypothesises a particular relation only when it is certain that th...
John Carroll, Ted Briscoe
ACL
1998
13 years 6 months ago
Know When to Hold 'Em: Shuffling Deterministically in a Parser for Nonconcatenative Grammars
Nonconcatenative constraints, such as the shuffle relation, are frequently employed in grammatical analyses of languages that have more flexible ordering of constituents than Engl...
Robert T. Kasper, Mike Calcagno, Paul C. Davis
NAACL
2010
13 years 3 months ago
Chart Mining-based Lexical Acquisition with Precision Grammars
In this paper, we present an innovative chart mining technique for improving parse coverage based on partial parse outputs from precision grammars. The general approach of mining ...
Yi Zhang 0003, Timothy Baldwin, Valia Kordoni, Dav...
ICTAI
2003
IEEE
13 years 10 months ago
Extracting Biochemical Interactions from MEDLINE Using a Link Grammar Parser
Many natural language processing approaches at various complexity levels have been reported for extracting biochemical interactions from MEDLINE. While some algorithms using simpl...
Jing Ding, Daniel Berleant, Jun Xu, Andy W. Fulmer