1195 search results - page 114 / 239 » acl 2007 |
89
Voted
ACL
2001
15 years 2 months ago
2001
This paper investigates how, and to what extent the flexibility and robustness of a partial parser can be utilized to automatically extend existing semantic lexicons. Our work is ...
108
Voted
ACL
1998
15 years 2 months ago
1998
We present an empirical study of the applicability of Probabilistic Lexicalized Tree Insertion Grammars (PLTIG), a lexicalized counterpart to Probabilistic Context-Free Grammars (...
100
Voted
ACL
1989
15 years 1 months ago
1989
An effective procedure for automatically acquiring a new set of disambiguation rules for an existing deterministic parser on the basis of tagged text is presented. Performance of ...
123
Voted
ACL
1992
15 years 1 months ago
1992
We show that the class of string languages generated by linear context-free rewriting systems is equal to the class of output languages of deterministic treewalking transducers. F...
104
Voted
ACL
2004
15 years 2 months ago
2004
We describe a method for enriching the output of a parser with information available in a corpus. The method is based on graph rewriting using memorybased learning, applied to dep...