116 search results - page 18 / 24 » An Efficient Parsing Algorithm for Tree Adjoining Grammars |
103
Voted
EUROCAST
2007
Springer
15 years 3 months ago
2007
Springer
abstract Parsing schemata [4] provide a formal, simple and uniform way to describe, analyze and compare different parsing algorithms. The notion of a parsing schema comes from cons...
76
Voted
ACL
2004
15 years 1 months ago
2004
This paper shows how finite approximations of long distance dependency (LDD) resolution can be obtained automatically for wide-coverage, robust, probabilistic Lexical-Functional G...
DAS
2010
Springer
15 years 2 months ago
2010
Springer
We describe a component of a document analysis system for constructing ontologies for domain-specific web tables imported into Excel. This component automates extraction of the Wa...
110
click to vote
IFIP12
2007
15 years 1 months ago
2007
In this paper an efficient architecture for natural language processing is presented, implemented in hardware using FPGAs (Field Programmable Gate Arrays). The system can receive s...
AAAI
1994
15 years 29 days 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...