... Combinatory Categorial Grammar
Combinatory Categorial Grammar (Ades and Steed-
man, 1982; Steedman, 2000) is an extension to
the classical Categorial Grammar (CG) of Aj-
dukiewicz (1935) and Bar-Hillel ... Proceedings of the ACL Student Research Workshop, pages 73–78,
Ann Arbor, Michigan, June 2005.
c
2005 Association for Computational Linguistics
Automatic Induction of a...
... OSTIA algorithm for learn-
ing general subsequential finite state transduc-
ers. Although OSTIA is capable of learning
arbitrary s f.s.t's in the limit, large dictionaries
of actual English ... Automatic Induction of Finite State Transducers for Simple Phonological Rules
Daniel Gildea and Daniel Jurafsky
International Computer Science Institute and
University of Calif...
... would initially require a
50,000 x 50,000 array of values (or a trian-
gular array of about half this size). With
our current hardware, the largest array we
can comfortably handle is about 100 ... they approximated this
data by just looking at the nearest NP on
each side of a particular NP. Roark and
Charniak (1998) built on that work by actu-
ally using conjunction and ap...
... learning a foreign
language.
A subcategorization frame is a statement of
what types of syntactic arguments a verb (or ad-
jective) takes, such as objects, infinitives, that-
clauses, participial ... slightly (a
few repeated typos made it in, such as
acknowl-
ege,
a few oddities such as the spelling
garontee
as a 'Cajun' pronunciation of
guarantee
and a...
... state -of- the-art machine
learning systems. Additionally, the intuitive
and linguistically motivated rules will allow
for manual adaptation of the rule set to new
domains and corpora.
1 Motivation
Information ... 35.92, and
65.55 for clinical texts, papers, and abstracts respec-
tively.
Morante and Daelemans have also developed a
metalearner for identifying the scope of negation...
... col-
lect technical terms that are related to natural lan-
guage processing, such as morphological analysis,
parsing, information retrieval, and machine transla-
tion. The target application of the method ... Automatic Collection of Related Terms from the Web
Satoshi Sato and Yasuhiro Sasaki
Graduate School of Informatics
Kyoto University
Sakyo, Kyoto, 606-8501
Japan
sato@i.kyoto-u.ac.j...
... syntactic, and semantic information, and one
operation unification on this representation.
By way of example, we present a trivial grammar for a
fragment of English with a lexicon associating ...
structs
Clearly, the bare PATR-II formalism, as it was pre-
sented in Section 2.1, is sorely inadequate for any major
attempt at building natural-language grammars because of...
... of the most influential newspaper
in mainland China. It maintains a vast database
of news stories, available to search by the public.
Among other reasons, we chose this website be-
cause its articles ... of the training stage, for each
sense, a sense vector was produced. Then we lem-
matised the test data and extracted a set of context
vectors for all instances in the same wa...
... Proceedings of the 47th Annual Meeting of the ACL and the 4th IJCNLP of the AFNLP, pages 522–530,
Suntec, Singapore, 2-7 August 2009.
c
2009 ACL and AFNLP
Automatic Adaptation of Annotation Standards:
Chinese ... Segmentation and Tagging as
Character Classification
Before describing the adaptation algorithm, we
give a brief introduction of the baseline character
classification stra...
...
Morphologically Rich Languages in a Poor Resource Scenario
Sandipan Dandapat, Sudeshna Sarkar, Anupam Basu
Department of Computer Science and Engineering
Indian Institute of Technology Kharagpur ... instead of using only for rare words as is
described in Ratnaparkhi (1996). This can be
explained by the fact that due to small amount of
annotated data, a significant number...