Sciweavers

681 search results - page 112 / 137
» Parsing as Natural Deduction
Sort
View
ACL
1998
15 years 3 months ago
Some Properties of Preposition and Subordinate Conjunction Attachments
Determining the attachments of prepositions and subordinate conjunctions is a key problem in parsing natural language. This paper presents a trainable approach to making these att...
Alexander S. Yeh, Marc B. Vilain
ACL
1990
15 years 3 months ago
A Hardware Algorithm for High Speed Morpheme Extraction and its Implementation
This paper describes a new hardware algorithm for morpheme extraction and its implementation on a specific machine (MEX-I), as the first step toward achieving natural language par...
Toshikazu Fukushima, Yutaka Ohyama, Hitoshi Miyai
JOLLI
2006
101views more  JOLLI 2006»
15 years 1 months ago
A Note on the Expressive Power of Probabilistic Context Free Grammars
We examine the expressive power of probabilistic context free grammars (PCFGs), with a special focus on the use of probabilities as a mechanism for reducing ambiguity by filtering ...
Gabriel G. Infante López, Maarten de Rijke
AI
2002
Springer
15 years 1 months ago
QUANTUM: A Function-Based Question Answering System
Abstract In this paper, we describe our Question Answering (QA) system called QUANTUM. The goal of QUANTUM is to find the answer to a natural language question in a large document ...
Luc Plamondon, Leila Kosseim
MT
2007
91views more  MT 2007»
15 years 1 months ago
A method of creating new valency entries
Information on subcategorization and selectional restrictions is important for natural language processing tasks such as deep parsing, rule-based machine translation and automatic...
Sanae Fujita, Francis Bond