Sciweavers

33 search results - page 5 / 7
» Compacting the Penn Treebank Grammar
Sort
View
LREC
2010
121views Education» more  LREC 2010»
13 years 8 months ago
Disambiguating Compound Nouns for a Dynamic HPSG Treebank of Wall Street Journal Texts
The aim of this paper is twofold. We focus, on the one hand, on the task of dynamically annotating English compound nouns, and on the other hand we propose disambiguation methods ...
Valia Kordoni, Yi Zhang 0003
IWPT
2001
13 years 8 months ago
Automatic Grammar Partitioning for Syntactic Parsing
Natural language processing technologies offer ease-of-use of computers for average users, and easeof-access to on-line information. Natural language, however, is complex, and the...
Po-Chui Luk, Fuliang Weng, Helen Meng
COLING
2002
13 years 7 months ago
Lenient Default Unification for Robust Processing within Unification Based Grammar Formalisms
This paper describes new default unification, lenient default unification. It works efficiently, and gives more informative results because it maximizes the amount of information ...
Takashi Ninomiya, Yusuke Miyao, Jun-ichi Tsujii
ACL
2001
13 years 8 months ago
Improvement of a Whole Sentence Maximum Entropy Language Model Using Grammatical Features
In this paper, we propose adding long-term grammatical information in a Whole Sentence Maximun Entropy Language Model (WSME) in order to improve the performance of the model. The ...
Fredy A. Amaya, José-Miguel Benedí
IJCNLP
2004
Springer
14 years 22 days ago
Iterative CKY Parsing for Probabilistic Context-Free Grammars
This paper presents an iterative CKY parsing algorithm for probabilistic contextfree grammars (PCFG). This algorithm enables us to prune unnecessary edges produced during parsing,...
Yoshimasa Tsuruoka, Jun-ichi Tsujii